./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 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_da0a5293-ce6f-44c1-841f-27b399c4d978/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_da0a5293-ce6f-44c1-841f-27b399c4d978/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_da0a5293-ce6f-44c1-841f-27b399c4d978/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_da0a5293-ce6f-44c1-841f-27b399c4d978/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_da0a5293-ce6f-44c1-841f-27b399c4d978/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_da0a5293-ce6f-44c1-841f-27b399c4d978/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-0cd3be1 [2018-11-28 12:20:24,109 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 12:20:24,110 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 12:20:24,118 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 12:20:24,118 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 12:20:24,119 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 12:20:24,120 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 12:20:24,121 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 12:20:24,122 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 12:20:24,122 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 12:20:24,123 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 12:20:24,123 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 12:20:24,124 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 12:20:24,124 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 12:20:24,125 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 12:20:24,126 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 12:20:24,126 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 12:20:24,127 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 12:20:24,129 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 12:20:24,130 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 12:20:24,130 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 12:20:24,131 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 12:20:24,133 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 12:20:24,133 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 12:20:24,133 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 12:20:24,134 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 12:20:24,134 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 12:20:24,135 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 12:20:24,136 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 12:20:24,136 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 12:20:24,136 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 12:20:24,137 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 12:20:24,137 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 12:20:24,137 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 12:20:24,138 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 12:20:24,138 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 12:20:24,138 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_da0a5293-ce6f-44c1-841f-27b399c4d978/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 12:20:24,148 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 12:20:24,149 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 12:20:24,149 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 12:20:24,150 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 12:20:24,150 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 12:20:24,150 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 12:20:24,150 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 12:20:24,150 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 12:20:24,150 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 12:20:24,150 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 12:20:24,150 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 12:20:24,150 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 12:20:24,150 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 12:20:24,151 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 12:20:24,151 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 12:20:24,151 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 12:20:24,151 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 12:20:24,151 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 12:20:24,151 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 12:20:24,151 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 12:20:24,154 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 12:20:24,154 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 12:20:24,155 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 12:20:24,155 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 12:20:24,155 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 12:20:24,155 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 12:20:24,155 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 12:20:24,155 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 12:20:24,156 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 12:20:24,156 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_da0a5293-ce6f-44c1-841f-27b399c4d978/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 160024a3cc4acfbc7213f984e87ef0c708b94aaf [2018-11-28 12:20:24,181 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 12:20:24,189 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 12:20:24,192 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 12:20:24,193 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 12:20:24,193 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 12:20:24,194 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_da0a5293-ce6f-44c1-841f-27b399c4d978/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/gcd1-alloca_true-termination.c.i [2018-11-28 12:20:24,238 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_da0a5293-ce6f-44c1-841f-27b399c4d978/bin-2019/uautomizer/data/5113802dc/cbca36e663c64e5ebf66e590844fc01a/FLAGd63a79809 [2018-11-28 12:20:24,685 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 12:20:24,686 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_da0a5293-ce6f-44c1-841f-27b399c4d978/sv-benchmarks/c/termination-memory-alloca/gcd1-alloca_true-termination.c.i [2018-11-28 12:20:24,695 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_da0a5293-ce6f-44c1-841f-27b399c4d978/bin-2019/uautomizer/data/5113802dc/cbca36e663c64e5ebf66e590844fc01a/FLAGd63a79809 [2018-11-28 12:20:24,708 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_da0a5293-ce6f-44c1-841f-27b399c4d978/bin-2019/uautomizer/data/5113802dc/cbca36e663c64e5ebf66e590844fc01a [2018-11-28 12:20:24,710 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 12:20:24,712 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 12:20:24,712 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 12:20:24,712 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 12:20:24,715 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 12:20:24,716 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:20:24" (1/1) ... [2018-11-28 12:20:24,718 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3952dd5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:24, skipping insertion in model container [2018-11-28 12:20:24,718 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:20:24" (1/1) ... [2018-11-28 12:20:24,723 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 12:20:24,748 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 12:20:24,930 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:20:24,979 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 12:20:25,002 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:20:25,034 INFO L195 MainTranslator]: Completed translation [2018-11-28 12:20:25,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:25 WrapperNode [2018-11-28 12:20:25,034 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 12:20:25,035 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 12:20:25,035 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 12:20:25,035 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 12:20:25,042 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:25" (1/1) ... [2018-11-28 12:20:25,050 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:25" (1/1) ... [2018-11-28 12:20:25,064 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 12:20:25,065 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 12:20:25,065 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 12:20:25,065 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 12:20:25,071 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:25" (1/1) ... [2018-11-28 12:20:25,071 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:25" (1/1) ... [2018-11-28 12:20:25,073 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:25" (1/1) ... [2018-11-28 12:20:25,073 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:25" (1/1) ... [2018-11-28 12:20:25,077 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:25" (1/1) ... [2018-11-28 12:20:25,081 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:25" (1/1) ... [2018-11-28 12:20:25,082 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:25" (1/1) ... [2018-11-28 12:20:25,083 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 12:20:25,084 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 12:20:25,084 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 12:20:25,084 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 12:20:25,085 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da0a5293-ce6f-44c1-841f-27b399c4d978/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:20:25,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 12:20:25,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 12:20:25,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 12:20:25,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 12:20:25,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 12:20:25,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 12:20:25,298 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 12:20:25,298 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 12:20:25,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:20:25 BoogieIcfgContainer [2018-11-28 12:20:25,298 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 12:20:25,299 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 12:20:25,299 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 12:20:25,301 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 12:20:25,302 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:20:25,302 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 12:20:24" (1/3) ... [2018-11-28 12:20:25,302 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@31993f81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 12:20:25, skipping insertion in model container [2018-11-28 12:20:25,303 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:20:25,303 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:25" (2/3) ... [2018-11-28 12:20:25,303 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@31993f81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 12:20:25, skipping insertion in model container [2018-11-28 12:20:25,303 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:20:25,303 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:20:25" (3/3) ... [2018-11-28 12:20:25,304 INFO L375 chiAutomizerObserver]: Analyzing ICFG gcd1-alloca_true-termination.c.i [2018-11-28 12:20:25,339 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 12:20:25,340 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 12:20:25,340 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 12:20:25,340 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 12:20:25,340 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 12:20:25,340 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 12:20:25,340 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 12:20:25,341 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 12:20:25,341 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 12:20:25,352 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-28 12:20:25,368 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 12:20:25,368 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:20:25,368 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:20:25,373 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 12:20:25,373 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 12:20:25,373 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 12:20:25,373 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-28 12:20:25,374 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 12:20:25,374 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:20:25,374 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:20:25,375 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 12:20:25,375 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 12:20:25,380 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-11-28 12:20:25,380 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-11-28 12:20:25,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:20:25,384 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2018-11-28 12:20:25,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:20:25,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:20:25,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:20:25,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:20:25,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:20:25,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:20:25,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:20:25,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:20:25,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1513768, now seen corresponding path program 1 times [2018-11-28 12:20:25,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:20:25,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:20:25,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:20:25,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:20:25,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:20:25,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:20:25,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:20:25,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:20:25,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 12:20:25,523 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 12:20:25,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 12:20:25,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 12:20:25,534 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 2 states. [2018-11-28 12:20:25,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:20:25,538 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2018-11-28 12:20:25,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 12:20:25,540 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2018-11-28 12:20:25,541 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 12:20:25,543 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 10 states and 13 transitions. [2018-11-28 12:20:25,544 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 12:20:25,544 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 12:20:25,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2018-11-28 12:20:25,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:20:25,545 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-28 12:20:25,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2018-11-28 12:20:25,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-11-28 12:20:25,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-28 12:20:25,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-11-28 12:20:25,561 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-28 12:20:25,561 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-28 12:20:25,562 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 12:20:25,562 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2018-11-28 12:20:25,562 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 12:20:25,562 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:20:25,562 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:20:25,563 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 12:20:25,563 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 12:20:25,563 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-11-28 12:20:25,563 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~mem12;havoc gcd_#t~mem11; 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-11-28 12:20:25,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:20:25,563 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 2 times [2018-11-28 12:20:25,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:20:25,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:20:25,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:20:25,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:20:25,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:20:25,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:20:25,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:20:25,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:20:25,593 INFO L82 PathProgramCache]: Analyzing trace with hash 46919933, now seen corresponding path program 1 times [2018-11-28 12:20:25,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:20:25,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:20:25,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:20:25,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:20:25,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:20:25,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:20:25,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:20:25,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:20:25,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1985425099, now seen corresponding path program 1 times [2018-11-28 12:20:25,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:20:25,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:20:25,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:20:25,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:20:25,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:20:25,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:20:25,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:20:26,015 WARN L180 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 91 [2018-11-28 12:20:26,089 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:20:26,090 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:20:26,090 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:20:26,090 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:20:26,090 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:20:26,091 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:20:26,091 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:20:26,091 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:20:26,091 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd1-alloca_true-termination.c.i_Iteration2_Lasso [2018-11-28 12:20:26,091 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:20:26,092 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:20:26,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:26,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-11-28 12:20:26,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:26,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:26,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-11-28 12:20:26,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-11-28 12:20:26,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-11-28 12:20:26,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-11-28 12:20:26,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-11-28 12:20:26,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-11-28 12:20:26,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-11-28 12:20:26,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-11-28 12:20:26,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-11-28 12:20:26,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-11-28 12:20:26,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:26,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:26,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:26,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:26,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:26,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:26,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-11-28 12:20:26,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:26,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:26,374 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2018-11-28 12:20:26,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:26,755 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:20:26,758 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:20:26,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:26,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:26,760 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:26,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:26,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:26,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:26,762 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:26,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:26,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:26,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:26,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:26,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:26,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:26,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:26,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:26,765 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:26,765 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:26,766 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:26,766 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:26,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:26,767 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:26,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:26,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:26,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:26,768 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:26,768 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:26,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:26,768 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:26,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:26,769 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:26,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:26,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:26,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:26,770 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:26,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:26,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:26,771 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:26,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:26,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:26,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:26,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:26,773 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:20:26,773 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:26,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:26,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-11-28 12:20:26,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:26,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:26,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:26,776 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:26,777 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:20:26,777 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:26,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:26,780 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:26,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:26,780 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:26,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:26,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:26,781 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:26,781 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:26,781 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:26,782 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:26,782 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:26,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:26,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:26,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:26,783 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:26,784 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:20:26,784 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:26,787 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:26,787 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:26,788 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:26,788 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:26,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:26,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:26,788 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:26,788 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:26,789 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:26,789 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:26,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-11-28 12:20:26,790 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:26,790 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:26,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:26,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:26,790 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:26,791 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:26,791 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:26,792 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:26,792 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:26,792 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:26,792 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:26,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:26,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:26,793 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:26,793 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:26,793 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:26,794 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:26,794 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:26,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:26,795 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:26,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:26,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:26,795 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:26,795 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:26,795 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:26,796 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:26,797 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:26,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:26,797 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:26,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:26,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:26,797 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:26,798 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:26,798 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:26,799 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:26,799 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:26,799 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:26,799 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:26,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:26,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:26,800 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:26,800 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:26,800 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:26,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:26,801 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:26,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:26,802 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:26,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:26,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:26,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:26,802 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:26,802 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:26,803 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:26,803 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:26,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:26,804 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:26,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:26,804 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:26,804 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:26,805 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:26,805 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:26,805 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:26,806 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:26,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:26,806 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:26,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:26,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:26,807 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:26,807 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:26,807 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:26,808 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:26,808 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:26,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:26,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:26,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:26,809 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:26,810 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:20:26,810 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:26,812 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:26,813 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:26,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:26,813 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:26,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:26,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:26,813 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:26,814 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:26,814 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:26,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:26,815 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:26,815 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:26,816 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:26,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:26,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:26,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:26,816 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:26,816 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:26,817 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:26,818 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:26,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:26,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:26,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:26,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:26,819 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:20:26,820 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:26,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:26,823 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:26,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:26,824 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:26,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:26,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:26,824 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:26,824 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:26,824 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:26,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:26,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:26,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:26,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:26,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:26,826 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:26,827 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:20:26,828 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:26,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:26,830 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:26,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:26,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:26,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:26,831 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:26,832 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:20:26,832 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:26,842 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:26,842 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:26,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:26,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:26,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:26,843 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:26,846 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:20:26,846 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:26,873 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:20:26,892 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 12:20:26,892 INFO L444 ModelExtractionUtils]: 24 out of 31 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-28 12:20:26,895 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:20:26,896 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 12:20:26,896 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:20:26,897 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_1 Supporting invariants [] [2018-11-28 12:20:26,962 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-28 12:20:26,970 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 12:20:26,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:20:27,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:20:27,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:20:27,033 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-11-28 12:20:27,051 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:27,052 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:27,054 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-11-28 12:20:27,054 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:27,061 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:27,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:27,064 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-28 12:20:27,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:20:27,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:20:27,113 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-11-28 12:20:27,118 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-11-28 12:20:27,119 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:27,148 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-11-28 12:20:27,149 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 12:20:27,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:20:27,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:20:27,174 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:34, output treesize:56 [2018-11-28 12:20:27,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:20:27,244 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-28 12:20:27,244 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 7 states. [2018-11-28 12:20:27,341 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-11-28 12:20:27,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-28 12:20:27,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 12:20:27,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2018-11-28 12:20:27,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 5 letters. Loop has 5 letters. [2018-11-28 12:20:27,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:20:27,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 10 letters. Loop has 5 letters. [2018-11-28 12:20:27,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:20:27,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 5 letters. Loop has 10 letters. [2018-11-28 12:20:27,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:20:27,346 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2018-11-28 12:20:27,347 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-28 12:20:27,347 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 27 states and 34 transitions. [2018-11-28 12:20:27,348 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-28 12:20:27,348 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-28 12:20:27,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 34 transitions. [2018-11-28 12:20:27,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:20:27,348 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2018-11-28 12:20:27,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 34 transitions. [2018-11-28 12:20:27,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 19. [2018-11-28 12:20:27,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-28 12:20:27,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2018-11-28 12:20:27,350 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-11-28 12:20:27,350 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-11-28 12:20:27,350 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 12:20:27,350 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2018-11-28 12:20:27,351 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 12:20:27,351 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:20:27,351 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:20:27,351 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 12:20:27,351 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 12:20:27,351 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-11-28 12:20:27,352 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~mem12;havoc gcd_#t~mem11; 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-11-28 12:20:27,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:20:27,352 INFO L82 PathProgramCache]: Analyzing trace with hash 28695751, now seen corresponding path program 1 times [2018-11-28 12:20:27,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:20:27,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:20:27,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:20:27,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:20:27,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:20:27,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:20:27,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:20:27,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:20:27,368 INFO L82 PathProgramCache]: Analyzing trace with hash 46919933, now seen corresponding path program 2 times [2018-11-28 12:20:27,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:20:27,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:20:27,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:20:27,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:20:27,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:20:27,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:20:27,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:20:27,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:20:27,384 INFO L82 PathProgramCache]: Analyzing trace with hash -2042683401, now seen corresponding path program 1 times [2018-11-28 12:20:27,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:20:27,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:20:27,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:20:27,385 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:20:27,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:20:27,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:20:27,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:20:27,641 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 95 [2018-11-28 12:20:27,691 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:20:27,691 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:20:27,691 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:20:27,691 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:20:27,692 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:20:27,692 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:20:27,692 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:20:27,692 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:20:27,692 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd1-alloca_true-termination.c.i_Iteration3_Lasso [2018-11-28 12:20:27,692 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:20:27,692 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:20:27,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:27,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:27,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:27,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:27,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:27,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:27,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:27,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:27,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:27,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:27,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:27,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:27,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:27,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:27,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:27,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:27,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:27,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:27,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:27,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:27,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:27,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:27,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:27,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:28,246 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:20:28,246 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:20:28,246 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:28,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:28,247 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:28,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:28,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:28,247 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:28,248 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:28,248 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:28,249 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:28,249 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:28,249 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:28,249 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:28,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:28,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:28,250 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:28,250 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:28,250 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:28,250 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:28,251 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:28,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:28,251 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:28,251 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:28,251 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:28,252 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:28,252 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:28,252 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:28,252 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:28,253 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:28,253 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:28,253 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:28,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:28,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:28,253 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:28,254 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:28,254 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:28,254 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:28,254 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:28,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:28,255 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:28,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:28,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:28,255 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:28,255 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:28,255 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:28,256 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:28,256 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:28,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:28,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:28,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:28,257 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:28,257 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:20:28,257 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:28,259 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:28,259 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:28,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:28,259 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:28,260 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:28,260 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:28,260 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:28,260 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:28,260 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:28,260 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:28,261 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:28,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:28,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:28,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:28,261 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:28,262 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:20:28,262 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:28,264 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:28,264 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:28,264 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:28,265 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:28,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:28,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:28,265 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:28,265 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:28,265 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:28,266 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:28,266 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:28,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:28,266 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:28,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:28,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:28,267 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:28,267 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:28,267 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:28,267 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:28,267 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:28,268 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:28,268 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:28,268 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:28,268 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:28,268 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:28,268 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:28,269 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:28,269 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:28,269 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:28,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:28,270 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:28,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:28,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:28,270 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:28,270 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:28,270 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:28,271 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:28,271 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:28,271 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:28,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:28,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:28,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:28,272 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:20:28,272 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:28,274 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:28,274 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:28,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:28,274 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:28,275 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:28,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:28,275 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:28,275 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:28,275 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:28,275 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:28,276 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:28,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:28,276 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:28,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:28,276 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:28,276 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:28,277 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:28,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:28,277 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:28,277 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:28,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:28,278 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 12:20:28,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:28,278 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:28,279 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 12:20:28,279 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:28,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:28,284 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:28,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:28,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:28,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:28,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:28,285 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:20:28,285 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:28,286 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:28,287 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:28,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:28,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:28,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:28,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:28,288 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:20:28,288 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:28,292 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:28,293 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:28,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:28,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:28,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:28,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:28,294 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:20:28,294 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:28,295 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:28,295 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:28,296 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:28,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:28,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:28,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:28,297 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:20:28,297 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:28,298 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:28,298 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:28,299 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:28,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:28,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:28,299 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:28,301 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:20:28,301 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:28,309 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:28,310 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:28,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:28,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:28,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:28,311 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:28,311 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:20:28,311 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:28,314 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:28,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:28,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:28,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:28,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:28,315 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:28,316 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:20:28,316 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:28,320 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:28,320 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:28,320 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:28,320 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 12:20:28,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:28,321 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:28,321 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 12:20:28,322 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:28,325 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:28,325 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:28,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:28,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:28,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:28,326 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:28,328 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:20:28,328 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:28,339 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:20:28,348 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-28 12:20:28,348 INFO L444 ModelExtractionUtils]: 24 out of 31 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-28 12:20:28,348 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:20:28,349 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 12:20:28,349 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:20:28,349 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_2 Supporting invariants [] [2018-11-28 12:20:28,416 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-28 12:20:28,418 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 12:20:28,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:20:28,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:20:28,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:20:28,445 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-11-28 12:20:28,451 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:28,452 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:28,453 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-11-28 12:20:28,453 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:28,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:28,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:28,461 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-28 12:20:28,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:20:28,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:20:28,498 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-11-28 12:20:28,507 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-11-28 12:20:28,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 12:20:28,534 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-11-28 12:20:28,535 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:28,548 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:20:28,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:20:28,561 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:34, output treesize:56 [2018-11-28 12:20:28,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:20:28,634 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-28 12:20:28,634 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 7 Second operand 7 states. [2018-11-28 12:20:28,699 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-11-28 12:20:28,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-28 12:20:28,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 12:20:28,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2018-11-28 12:20:28,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 5 letters. Loop has 5 letters. [2018-11-28 12:20:28,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:20:28,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 10 letters. Loop has 5 letters. [2018-11-28 12:20:28,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:20:28,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 5 letters. Loop has 10 letters. [2018-11-28 12:20:28,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:20:28,701 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 49 transitions. [2018-11-28 12:20:28,702 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-28 12:20:28,703 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 36 states and 45 transitions. [2018-11-28 12:20:28,703 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-11-28 12:20:28,703 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-28 12:20:28,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 45 transitions. [2018-11-28 12:20:28,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:20:28,704 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2018-11-28 12:20:28,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 45 transitions. [2018-11-28 12:20:28,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 19. [2018-11-28 12:20:28,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-28 12:20:28,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2018-11-28 12:20:28,705 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-11-28 12:20:28,706 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-11-28 12:20:28,706 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 12:20:28,706 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2018-11-28 12:20:28,706 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 12:20:28,706 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:20:28,706 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:20:28,707 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:20:28,707 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 12:20:28,707 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~mem12;havoc gcd_#t~mem11;call gcd_#t~mem13 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem14 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem13 - gcd_#t~mem14, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem13;havoc gcd_#t~mem14; 489#L557-3 [2018-11-28 12:20:28,707 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~mem12;havoc gcd_#t~mem11;call gcd_#t~mem13 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem14 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem13 - gcd_#t~mem14, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem13;havoc gcd_#t~mem14; 489#L557-3 [2018-11-28 12:20:28,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:20:28,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1182880019, now seen corresponding path program 1 times [2018-11-28 12:20:28,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:20:28,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:20:28,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:20:28,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:20:28,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:20:28,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:20:28,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:20:28,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:20:28,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1894, now seen corresponding path program 1 times [2018-11-28 12:20:28,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:20:28,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:20:28,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:20:28,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:20:28,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:20:28,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:20:28,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:20:28,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:20:28,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1418634248, now seen corresponding path program 2 times [2018-11-28 12:20:28,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:20:28,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:20:28,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:20:28,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:20:28,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:20:28,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:20:28,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:20:29,178 WARN L180 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 111 [2018-11-28 12:20:29,272 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:20:29,272 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:20:29,272 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:20:29,272 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:20:29,272 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:20:29,272 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:20:29,272 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:20:29,272 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:20:29,272 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd1-alloca_true-termination.c.i_Iteration4_Lasso [2018-11-28 12:20:29,272 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:20:29,272 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:20:29,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:29,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:29,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:29,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:29,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:29,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:29,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:29,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:29,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:29,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:29,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:29,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:29,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:29,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:29,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:29,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:29,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:29,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:29,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:29,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:29,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:29,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:29,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:29,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:29,731 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:20:29,731 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:20:29,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-11-28 12:20:29,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:29,732 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:29,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:29,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:29,732 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:29,733 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:29,733 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:29,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:29,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-11-28 12:20:29,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:29,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:29,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:29,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:29,740 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:20:29,740 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:29,741 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:29,742 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:29,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:29,742 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:29,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:29,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:29,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:29,742 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:29,743 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:29,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:29,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:29,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:29,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:29,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:29,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:29,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:29,744 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:29,744 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:29,744 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:29,745 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:29,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:29,745 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:29,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:29,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:29,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:29,746 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:29,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:29,746 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:29,747 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:29,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:29,748 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:29,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:29,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:29,748 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:29,749 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:29,749 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:29,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:29,749 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:29,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:29,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:29,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:29,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:29,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:29,750 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:29,750 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:29,751 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:29,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-11-28 12:20:29,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:29,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:29,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:29,752 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:29,752 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:20:29,752 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:29,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:29,754 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:29,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:29,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:29,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:29,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:29,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:29,757 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:29,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:29,757 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:29,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-11-28 12:20:29,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:29,758 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:29,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:29,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:29,758 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:29,758 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:29,758 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:29,759 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:29,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:29,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:29,759 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:29,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:29,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:29,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:29,760 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:29,760 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:29,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:29,761 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:29,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:29,762 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:29,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:29,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:29,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:29,762 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:29,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:29,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:29,763 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:29,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:29,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:29,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:29,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:29,764 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:20:29,764 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:29,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:29,766 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:29,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:29,766 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:29,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:29,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:29,766 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:29,767 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:29,767 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:29,767 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:29,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:29,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:29,768 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:29,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:29,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:29,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:29,768 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:29,768 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:29,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:29,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:29,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:29,770 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:29,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:29,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:29,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:29,778 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:29,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:29,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:29,779 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:29,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:29,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:29,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:29,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:29,781 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:20:29,781 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:29,782 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:29,782 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:29,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:29,782 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:29,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:29,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:29,783 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:29,783 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:29,783 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:29,783 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:29,784 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:29,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:29,784 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:29,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:29,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:29,784 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:29,785 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:29,785 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:29,785 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:29,785 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:29,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:29,786 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:29,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:29,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:29,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:29,787 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:29,787 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:29,788 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:29,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:29,788 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:29,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:29,789 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:29,789 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:29,791 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:20:29,792 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:29,805 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:29,805 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:29,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:29,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:29,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:29,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:29,807 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:20:29,807 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:29,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:29,811 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:29,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:29,811 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 12:20:29,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:29,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:29,812 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 12:20:29,812 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:29,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:29,815 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:29,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:29,816 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 12:20:29,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:29,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:29,817 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 12:20:29,817 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:29,819 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:29,819 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:29,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:29,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:29,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:29,820 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:29,820 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:20:29,820 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:29,822 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:29,822 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:29,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:29,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:29,823 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:29,823 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:29,823 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:20:29,823 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:29,824 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:29,825 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:29,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:29,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:29,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:29,825 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:29,827 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:20:29,827 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:29,834 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:20:29,841 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 12:20:29,841 INFO L444 ModelExtractionUtils]: 25 out of 31 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 12:20:29,841 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:20:29,842 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-28 12:20:29,842 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:20:29,842 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_gcd_~r~0.base) ULTIMATE.start_gcd_~r~0.offset)_3, v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_3) = 2*v_rep(select (select #memory_int ULTIMATE.start_gcd_~r~0.base) ULTIMATE.start_gcd_~r~0.offset)_3 - 2*v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_3 + 1 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_3 - 1 >= 0] [2018-11-28 12:20:29,923 INFO L297 tatePredicateManager]: 17 out of 21 supporting invariants were superfluous and have been removed [2018-11-28 12:20:29,930 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 12:20:29,930 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 12:20:29,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:20:29,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:20:29,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:20:29,977 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-11-28 12:20:29,984 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:29,986 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:29,987 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-11-28 12:20:29,987 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:29,992 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:30,020 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-11-28 12:20:30,022 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-11-28 12:20:30,023 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:30,040 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-11-28 12:20:30,042 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-11-28 12:20:30,043 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:30,074 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-11-28 12:20:30,074 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-28 12:20:30,083 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:20:30,090 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:20:30,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:20:30,104 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:46, output treesize:31 [2018-11-28 12:20:30,136 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:30,160 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-11-28 12:20:30,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 35 treesize of output 34 [2018-11-28 12:20:30,164 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:30,191 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-11-28 12:20:30,192 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:30,203 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:30,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 12:20:30,210 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:34, output treesize:30 [2018-11-28 12:20:30,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:20:30,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:20:30,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:20:30,245 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2018-11-28 12:20:30,245 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 7 Second operand 6 states. [2018-11-28 12:20:30,305 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-11-28 12:20:30,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 12:20:30,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-28 12:20:30,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2018-11-28 12:20:30,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 9 letters. Loop has 2 letters. [2018-11-28 12:20:30,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:20:30,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 11 letters. Loop has 2 letters. [2018-11-28 12:20:30,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:20:30,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 9 letters. Loop has 4 letters. [2018-11-28 12:20:30,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:20:30,307 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 32 transitions. [2018-11-28 12:20:30,307 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 12:20:30,308 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 24 states and 31 transitions. [2018-11-28 12:20:30,308 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-28 12:20:30,308 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-28 12:20:30,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 31 transitions. [2018-11-28 12:20:30,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:20:30,308 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2018-11-28 12:20:30,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 31 transitions. [2018-11-28 12:20:30,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-11-28 12:20:30,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-28 12:20:30,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2018-11-28 12:20:30,309 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2018-11-28 12:20:30,309 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2018-11-28 12:20:30,309 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 12:20:30,309 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2018-11-28 12:20:30,310 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 12:20:30,310 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:20:30,310 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:20:30,310 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:20:30,310 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 12:20:30,310 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~mem12;havoc gcd_#t~mem11;call gcd_#t~mem13 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem14 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem13 - gcd_#t~mem14, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem13;havoc gcd_#t~mem14; 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~mem12;havoc gcd_#t~mem11; 676#L557-4 [2018-11-28 12:20:30,310 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~mem12;havoc gcd_#t~mem11; 676#L557-4 [2018-11-28 12:20:30,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:20:30,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1418634250, now seen corresponding path program 1 times [2018-11-28 12:20:30,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:20:30,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:20:30,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:20:30,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:20:30,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:20:30,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:20:30,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:20:30,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:20:30,331 INFO L82 PathProgramCache]: Analyzing trace with hash 64312973, now seen corresponding path program 3 times [2018-11-28 12:20:30,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:20:30,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:20:30,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:20:30,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:20:30,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:20:30,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:20:30,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:20:30,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:20:30,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1038603336, now seen corresponding path program 1 times [2018-11-28 12:20:30,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:20:30,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:20:30,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:20:30,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:20:30,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:20:30,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:20:30,547 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 12:20:30,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:20:30,547 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da0a5293-ce6f-44c1-841f-27b399c4d978/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:20:30,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:20:30,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:20:30,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:20:30,584 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:30,585 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-11-28 12:20:30,599 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:30,599 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:30,600 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-11-28 12:20:30,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:30,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:30,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:30,620 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2018-11-28 12:20:30,638 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-11-28 12:20:30,641 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-11-28 12:20:30,642 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:30,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:30,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:30,647 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:13 [2018-11-28 12:20:30,706 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-11-28 12:20:30,708 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-11-28 12:20:30,708 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:30,720 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:30,722 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-11-28 12:20:30,724 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-11-28 12:20:30,725 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:30,731 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:30,734 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:30,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:30,740 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:77, output treesize:37 [2018-11-28 12:20:30,761 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:30,762 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-11-28 12:20:30,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-11-28 12:20:30,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:30,771 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:30,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 12:20:30,776 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:37 [2018-11-28 12:20:30,800 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-11-28 12:20:30,802 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-11-28 12:20:30,802 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:30,810 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-11-28 12:20:30,810 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:30,814 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-11-28 12:20:30,815 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:30,816 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:30,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:30,820 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:51, output treesize:5 [2018-11-28 12:20:30,833 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 12:20:30,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:20:30,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2018-11-28 12:20:30,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-28 12:20:30,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-11-28 12:20:30,905 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. cyclomatic complexity: 10 Second operand 15 states. [2018-11-28 12:20:31,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:20:31,198 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2018-11-28 12:20:31,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 12:20:31,199 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 44 transitions. [2018-11-28 12:20:31,200 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 12:20:31,202 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 33 states and 41 transitions. [2018-11-28 12:20:31,202 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-28 12:20:31,202 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-11-28 12:20:31,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 41 transitions. [2018-11-28 12:20:31,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:20:31,202 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2018-11-28 12:20:31,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 41 transitions. [2018-11-28 12:20:31,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2018-11-28 12:20:31,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-28 12:20:31,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2018-11-28 12:20:31,204 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2018-11-28 12:20:31,204 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2018-11-28 12:20:31,204 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 12:20:31,205 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2018-11-28 12:20:31,205 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 12:20:31,205 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:20:31,205 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:20:31,205 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:20:31,206 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2018-11-28 12:20:31,206 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~mem12;havoc gcd_#t~mem11;call gcd_#t~mem13 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem14 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem13 - gcd_#t~mem14, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem13;havoc gcd_#t~mem14; 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~mem12;havoc gcd_#t~mem11; 834#L557-4 [2018-11-28 12:20:31,206 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~mem12;havoc gcd_#t~mem11;call gcd_#t~mem13 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem14 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem13 - gcd_#t~mem14, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem13;havoc gcd_#t~mem14; 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~mem12;havoc gcd_#t~mem11; 834#L557-4 [2018-11-28 12:20:31,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:20:31,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1418634250, now seen corresponding path program 2 times [2018-11-28 12:20:31,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:20:31,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:20:31,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:20:31,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:20:31,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:20:31,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:20:31,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:20:31,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:20:31,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1675227762, now seen corresponding path program 1 times [2018-11-28 12:20:31,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:20:31,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:20:31,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:20:31,224 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:20:31,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:20:31,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:20:31,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:20:31,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:20:31,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1665390371, now seen corresponding path program 2 times [2018-11-28 12:20:31,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:20:31,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:20:31,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:20:31,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:20:31,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:20:31,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:20:31,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:20:31,420 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 80 [2018-11-28 12:20:31,771 WARN L180 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 126 [2018-11-28 12:20:31,853 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:20:31,854 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:20:31,854 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:20:31,854 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:20:31,854 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:20:31,854 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:20:31,854 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:20:31,854 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:20:31,854 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd1-alloca_true-termination.c.i_Iteration6_Lasso [2018-11-28 12:20:31,854 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:20:31,854 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:20:31,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-11-28 12:20:31,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:31,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-11-28 12:20:31,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:32,049 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 74 [2018-11-28 12:20:32,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-11-28 12:20:32,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-11-28 12:20:32,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-11-28 12:20:32,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-11-28 12:20:32,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-11-28 12:20:32,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-11-28 12:20:32,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-11-28 12:20:32,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-11-28 12:20:32,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-11-28 12:20:32,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-11-28 12:20:32,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-11-28 12:20:32,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-11-28 12:20:32,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:32,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-11-28 12:20:32,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:32,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:32,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:32,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:32,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:32,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:32,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:32,384 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:20:32,384 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:20:32,384 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:32,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:32,385 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:32,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:32,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:32,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:32,386 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:32,386 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:32,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:32,386 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:32,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:32,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:32,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:32,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:32,387 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:20:32,388 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:32,388 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:32,389 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:32,389 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:32,389 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:32,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:32,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:32,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:32,390 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:32,390 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:32,390 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:32,390 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:32,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:32,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:32,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:32,391 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:32,391 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:20:32,391 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:32,394 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:32,394 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:32,395 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:32,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:32,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:32,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:32,395 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:20:32,396 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:32,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:32,398 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:32,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:32,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:32,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:32,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:32,401 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:20:32,401 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:32,409 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:32,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-11-28 12:20:32,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:32,410 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:32,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:32,410 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:32,410 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:20:32,410 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:32,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:32,412 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:32,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:32,412 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 12:20:32,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:32,412 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:32,413 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 12:20:32,413 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:32,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:32,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-11-28 12:20:32,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:32,416 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 12:20:32,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:32,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:32,417 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 12:20:32,417 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:32,419 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:32,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-11-28 12:20:32,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:32,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:32,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:32,420 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:32,421 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:20:32,421 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:32,423 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:32,424 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:32,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:32,424 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 12:20:32,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:32,425 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:32,425 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 12:20:32,425 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:32,428 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:32,428 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:32,428 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:32,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:32,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:32,429 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:32,430 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:20:32,430 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:32,450 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:20:32,469 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-28 12:20:32,469 INFO L444 ModelExtractionUtils]: 22 out of 31 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-11-28 12:20:32,469 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:20:32,471 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 12:20:32,471 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:20:32,471 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_gcd_~r~0.base) ULTIMATE.start_gcd_~r~0.offset)_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_gcd_~r~0.base) ULTIMATE.start_gcd_~r~0.offset)_4 Supporting invariants [] [2018-11-28 12:20:32,566 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-28 12:20:32,568 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 12:20:32,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:20:32,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:20:32,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:20:32,598 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-11-28 12:20:32,602 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:32,603 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:32,604 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-11-28 12:20:32,604 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:32,606 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:32,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:32,609 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-28 12:20:32,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:20:32,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:20:32,647 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-11-28 12:20:32,650 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-11-28 12:20:32,650 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:32,678 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-11-28 12:20:32,679 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:32,727 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-11-28 12:20:32,739 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-11-28 12:20:32,739 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-28 12:20:32,804 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-11-28 12:20:32,805 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:32,849 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-11-28 12:20:32,850 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-11-28 12:20:32,914 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-28 12:20:32,972 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-11-28 12:20:32,976 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-28 12:20:32,977 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:33,030 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-11-28 12:20:33,030 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:33,074 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-11-28 12:20:33,074 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-11-28 12:20:33,107 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-11-28 12:20:33,108 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-11-28 12:20:33,126 INFO L267 ElimStorePlain]: Start of recursive call 9: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-28 12:20:33,160 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 12:20:33,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 12:20:33,176 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 1 variables, input treesize:63, output treesize:95 [2018-11-28 12:20:33,232 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-11-28 12:20:33,235 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-11-28 12:20:33,236 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:33,245 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:33,289 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-11-28 12:20:33,298 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-11-28 12:20:33,299 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-28 12:20:33,323 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:20:33,376 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-11-28 12:20:33,379 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-11-28 12:20:33,379 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:33,386 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:33,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-11-28 12:20:33,419 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:161, output treesize:191 [2018-11-28 12:20:33,483 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:33,491 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-11-28 12:20:33,494 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:33,494 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-11-28 12:20:33,495 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:33,521 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:33,528 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-11-28 12:20:33,530 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-28 12:20:33,552 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-28 12:20:33,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-11-28 12:20:33,575 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:53, output treesize:118 [2018-11-28 12:20:33,678 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:20:33,679 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2018-11-28 12:20:33,679 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 8 Second operand 8 states. [2018-11-28 12:20:33,894 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-11-28 12:20:33,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-28 12:20:33,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-28 12:20:33,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 19 transitions. [2018-11-28 12:20:33,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 19 transitions. Stem has 11 letters. Loop has 7 letters. [2018-11-28 12:20:33,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:20:33,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 19 transitions. Stem has 18 letters. Loop has 7 letters. [2018-11-28 12:20:33,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:20:33,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 19 transitions. Stem has 11 letters. Loop has 14 letters. [2018-11-28 12:20:33,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:20:33,896 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 65 transitions. [2018-11-28 12:20:33,896 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 12:20:33,897 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 53 states and 63 transitions. [2018-11-28 12:20:33,897 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2018-11-28 12:20:33,897 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2018-11-28 12:20:33,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 63 transitions. [2018-11-28 12:20:33,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:20:33,897 INFO L705 BuchiCegarLoop]: Abstraction has 53 states and 63 transitions. [2018-11-28 12:20:33,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 63 transitions. [2018-11-28 12:20:33,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2018-11-28 12:20:33,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-28 12:20:33,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2018-11-28 12:20:33,900 INFO L728 BuchiCegarLoop]: Abstraction has 44 states and 54 transitions. [2018-11-28 12:20:33,900 INFO L608 BuchiCegarLoop]: Abstraction has 44 states and 54 transitions. [2018-11-28 12:20:33,900 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 12:20:33,900 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 54 transitions. [2018-11-28 12:20:33,901 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 12:20:33,901 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:20:33,901 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:20:33,901 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:20:33,901 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2018-11-28 12:20:33,901 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~mem12;havoc gcd_#t~mem11;call gcd_#t~mem13 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem14 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem13 - gcd_#t~mem14, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem13;havoc gcd_#t~mem14; 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~mem12;havoc gcd_#t~mem11; 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~mem12;havoc gcd_#t~mem11;call gcd_#t~mem13 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem14 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem13 - gcd_#t~mem14, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem13;havoc gcd_#t~mem14; 1100#L557-3 [2018-11-28 12:20:33,902 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~mem12;havoc gcd_#t~mem11;call gcd_#t~mem13 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem14 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem13 - gcd_#t~mem14, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem13;havoc gcd_#t~mem14; 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~mem12;havoc gcd_#t~mem11; 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-11-28 12:20:33,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:20:33,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1038603334, now seen corresponding path program 3 times [2018-11-28 12:20:33,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:20:33,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:20:33,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:20:33,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:20:33,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:20:33,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:20:33,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:20:33,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:20:33,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1583190302, now seen corresponding path program 2 times [2018-11-28 12:20:33,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:20:33,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:20:33,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:20:33,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:20:33,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:20:33,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:20:33,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:20:33,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:20:33,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1194503927, now seen corresponding path program 4 times [2018-11-28 12:20:33,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:20:33,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:20:33,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:20:33,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:20:33,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:20:33,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:20:33,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:20:35,028 WARN L180 SmtUtils]: Spent 955.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 155 [2018-11-28 12:20:35,228 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-11-28 12:20:35,231 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:20:35,231 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:20:35,231 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:20:35,231 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:20:35,231 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:20:35,231 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:20:35,231 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:20:35,231 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:20:35,231 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd1-alloca_true-termination.c.i_Iteration7_Lasso [2018-11-28 12:20:35,231 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:20:35,231 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:20:35,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:35,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:35,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:35,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:35,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:35,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:35,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:35,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:35,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:35,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:35,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:35,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:35,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:35,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:35,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:35,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:35,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:35,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:35,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:35,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:35,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:35,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:35,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:35,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:35,477 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2018-11-28 12:20:35,820 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:20:35,820 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:20:35,821 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:35,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:35,821 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:35,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:35,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:35,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:35,822 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:35,822 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:35,822 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:35,823 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:35,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:35,823 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:35,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:35,823 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:35,824 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:35,824 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:35,824 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:35,824 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:35,825 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:35,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:35,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:35,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:35,825 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:35,839 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:20:35,839 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:35,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:35,840 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:35,840 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:35,840 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:35,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:35,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:35,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:35,841 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:35,841 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:35,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:35,842 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:35,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:35,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:35,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:35,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:35,842 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:35,842 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:35,843 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:35,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:35,843 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:35,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:35,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:35,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:35,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:35,844 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:20:35,844 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:35,845 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:35,846 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:35,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:35,846 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:35,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:35,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:35,846 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:35,847 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:35,847 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:35,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:35,847 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:35,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:35,848 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:35,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:35,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:35,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:35,848 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:35,848 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:35,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:35,849 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:35,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:35,849 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:35,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:35,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:35,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:35,849 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:35,850 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:35,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:35,851 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:35,852 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:35,852 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:35,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:35,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:35,852 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:35,852 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:35,853 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:35,853 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:35,853 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:35,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:35,854 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:35,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:35,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:35,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:35,854 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:35,854 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:35,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:35,855 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:35,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:35,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:35,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:35,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:35,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:35,856 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:35,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:35,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:35,856 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:35,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:35,857 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:35,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:35,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:35,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:35,857 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:35,857 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:35,858 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:35,858 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:35,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:35,858 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:35,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:35,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:35,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:35,859 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:35,859 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:35,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:35,859 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:35,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:35,860 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:35,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:35,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:35,860 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:35,860 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:35,860 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:35,860 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:35,860 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:35,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:35,861 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:35,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:35,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:35,861 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:35,861 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:35,861 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:35,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:35,861 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:35,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:35,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:35,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:35,862 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:35,862 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:20:35,862 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:35,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:35,865 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:35,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:35,865 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:35,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:35,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:35,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:35,866 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:35,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:35,866 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:35,866 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:35,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:35,867 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:35,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:35,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:35,867 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:35,867 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:35,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:35,868 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:35,868 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:35,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:35,868 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:35,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:35,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:35,869 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:35,869 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:35,869 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:35,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:35,870 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:35,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:35,870 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:35,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:35,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:35,870 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:35,871 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:35,871 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:35,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:35,871 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:35,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:35,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:35,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:35,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:35,872 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:20:35,872 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:35,873 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:35,873 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:35,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:35,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:35,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:35,874 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:35,875 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:20:35,875 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:35,876 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:35,876 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:35,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:35,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:35,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:35,877 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:35,878 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:20:35,878 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:35,890 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:20:35,905 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 12:20:35,905 INFO L444 ModelExtractionUtils]: 24 out of 31 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-28 12:20:35,906 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:20:35,906 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 12:20:35,906 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:20:35,907 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-11-28 12:20:36,078 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-28 12:20:36,080 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 12:20:36,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:20:36,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:20:36,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:20:36,128 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-11-28 12:20:36,134 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:36,135 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:36,136 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-11-28 12:20:36,137 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:36,141 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:36,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:36,145 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-28 12:20:36,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:20:36,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:20:36,176 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-11-28 12:20:36,193 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-11-28 12:20:36,194 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-11-28 12:20:36,241 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-11-28 12:20:36,241 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:36,261 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-28 12:20:36,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 12:20:36,274 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:35, output treesize:66 [2018-11-28 12:20:36,383 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-11-28 12:20:36,387 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-11-28 12:20:36,387 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:36,434 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-11-28 12:20:36,434 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:36,476 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:36,478 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:36,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, 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-11-28 12:20:36,504 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-11-28 12:20:36,506 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-28 12:20:36,615 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:36,617 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:36,622 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-11-28 12:20:36,623 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-28 12:20:36,699 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:36,699 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-11-28 12:20:36,700 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:36,776 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-28 12:20:36,886 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:36,900 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-11-28 12:20:36,904 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-28 12:20:36,904 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:37,013 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:37,014 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-11-28 12:20:37,014 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:37,062 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:37,067 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-11-28 12:20:37,068 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-11-28 12:20:37,110 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:37,111 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:37,112 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-11-28 12:20:37,112 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:37,136 INFO L267 ElimStorePlain]: Start of recursive call 9: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-28 12:20:37,167 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 12:20:37,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 12:20:37,186 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 1 variables, input treesize:82, output treesize:129 [2018-11-28 12:20:37,260 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:20:37,260 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2018-11-28 12:20:37,260 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44 states and 54 transitions. cyclomatic complexity: 14 Second operand 9 states. [2018-11-28 12:20:37,480 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-11-28 12:20:37,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-28 12:20:37,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-28 12:20:37,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2018-11-28 12:20:37,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 23 transitions. Stem has 16 letters. Loop has 7 letters. [2018-11-28 12:20:37,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:20:37,481 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:20:37,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:20:37,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:20:37,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:20:37,510 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-11-28 12:20:37,515 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:37,516 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:37,516 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-11-28 12:20:37,517 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:37,519 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:37,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:37,522 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-28 12:20:37,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:20:37,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:20:37,552 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-11-28 12:20:37,555 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-11-28 12:20:37,555 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:37,576 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-11-28 12:20:37,577 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-28 12:20:37,591 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-28 12:20:37,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 12:20:37,603 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:35, output treesize:66 [2018-11-28 12:20:37,701 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-11-28 12:20:37,707 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-11-28 12:20:37,708 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:37,744 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-11-28 12:20:37,744 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:37,776 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:37,778 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-11-28 12:20:37,786 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-11-28 12:20:37,787 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-28 12:20:37,800 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:20:37,842 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:37,845 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:37,862 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-11-28 12:20:37,870 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-11-28 12:20:37,870 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:37,953 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:37,972 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:37,977 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-11-28 12:20:37,978 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-28 12:20:38,042 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:38,047 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-11-28 12:20:38,047 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-28 12:20:38,121 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-28 12:20:38,180 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:38,192 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-11-28 12:20:38,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, 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-11-28 12:20:38,202 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-11-28 12:20:38,287 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:38,288 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:38,288 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-11-28 12:20:38,288 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:38,380 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:38,380 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-11-28 12:20:38,380 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:38,404 INFO L267 ElimStorePlain]: Start of recursive call 11: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-28 12:20:38,434 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 12:20:38,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 12:20:38,453 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 1 variables, input treesize:82, output treesize:129 [2018-11-28 12:20:38,518 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:20:38,518 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 6 loop predicates [2018-11-28 12:20:38,518 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44 states and 54 transitions. cyclomatic complexity: 14 Second operand 9 states. [2018-11-28 12:20:38,718 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-11-28 12:20:38,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-28 12:20:38,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-28 12:20:38,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2018-11-28 12:20:38,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 23 transitions. Stem has 16 letters. Loop has 7 letters. [2018-11-28 12:20:38,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:20:38,719 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:20:38,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:20:38,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:20:38,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:20:38,757 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-11-28 12:20:38,762 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:38,762 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:38,763 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-11-28 12:20:38,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:38,767 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:38,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-11-28 12:20:38,771 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-28 12:20:38,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:20:38,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:20:38,794 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-11-28 12:20:38,807 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-11-28 12:20:38,808 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-11-28 12:20:38,830 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-11-28 12:20:38,830 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:38,842 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-28 12:20:38,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 12:20:38,855 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:35, output treesize:66 [2018-11-28 12:20:38,958 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-11-28 12:20:38,961 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-11-28 12:20:38,962 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:38,999 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-11-28 12:20:38,999 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:39,036 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:39,044 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-11-28 12:20:39,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, 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-11-28 12:20:39,047 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:39,069 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:39,070 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:39,070 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-11-28 12:20:39,071 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:39,083 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:20:39,124 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:39,125 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:39,140 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-11-28 12:20:39,155 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-11-28 12:20:39,156 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-28 12:20:39,298 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:39,301 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:39,306 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-11-28 12:20:39,307 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-28 12:20:39,401 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:39,402 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-11-28 12:20:39,402 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:39,503 INFO L267 ElimStorePlain]: Start of recursive call 8: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-28 12:20:39,561 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 12:20:39,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 12:20:39,580 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 1 variables, input treesize:82, output treesize:129 [2018-11-28 12:20:39,644 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:20:39,644 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2018-11-28 12:20:39,645 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44 states and 54 transitions. cyclomatic complexity: 14 Second operand 9 states. [2018-11-28 12:20:39,874 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-11-28 12:20:39,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-28 12:20:39,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-28 12:20:39,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 24 transitions. [2018-11-28 12:20:39,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 24 transitions. Stem has 16 letters. Loop has 7 letters. [2018-11-28 12:20:39,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:20:39,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 24 transitions. Stem has 23 letters. Loop has 7 letters. [2018-11-28 12:20:39,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:20:39,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 24 transitions. Stem has 16 letters. Loop has 14 letters. [2018-11-28 12:20:39,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:20:39,879 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 149 transitions. [2018-11-28 12:20:39,881 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-28 12:20:39,882 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 79 states and 96 transitions. [2018-11-28 12:20:39,882 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-11-28 12:20:39,882 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2018-11-28 12:20:39,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 96 transitions. [2018-11-28 12:20:39,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:20:39,882 INFO L705 BuchiCegarLoop]: Abstraction has 79 states and 96 transitions. [2018-11-28 12:20:39,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 96 transitions. [2018-11-28 12:20:39,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 50. [2018-11-28 12:20:39,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-28 12:20:39,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 63 transitions. [2018-11-28 12:20:39,885 INFO L728 BuchiCegarLoop]: Abstraction has 50 states and 63 transitions. [2018-11-28 12:20:39,885 INFO L608 BuchiCegarLoop]: Abstraction has 50 states and 63 transitions. [2018-11-28 12:20:39,885 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 12:20:39,885 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 63 transitions. [2018-11-28 12:20:39,886 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-28 12:20:39,886 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:20:39,886 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:20:39,887 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:20:39,887 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 12:20:39,887 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~mem12;havoc gcd_#t~mem11;call gcd_#t~mem13 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem14 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem13 - gcd_#t~mem14, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem13;havoc gcd_#t~mem14; 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~mem12;havoc gcd_#t~mem11; 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-11-28 12:20:39,887 INFO L796 eck$LassoCheckResult]: Loop: 1929#L557-1 assume !!(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem12;havoc gcd_#t~mem11;call gcd_#t~mem13 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem14 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem13 - gcd_#t~mem14, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem13;havoc gcd_#t~mem14; 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-11-28 12:20:39,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:20:39,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1696071320, now seen corresponding path program 5 times [2018-11-28 12:20:39,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:20:39,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:20:39,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:20:39,888 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:20:39,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:20:39,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:20:39,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:20:39,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:20:39,905 INFO L82 PathProgramCache]: Analyzing trace with hash 2044, now seen corresponding path program 2 times [2018-11-28 12:20:39,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:20:39,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:20:39,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:20:39,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:20:39,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:20:39,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:20:39,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:20:39,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:20:39,909 INFO L82 PathProgramCache]: Analyzing trace with hash -2131932253, now seen corresponding path program 6 times [2018-11-28 12:20:39,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:20:39,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:20:39,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:20:39,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:20:39,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:20:39,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:20:39,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:20:40,704 WARN L180 SmtUtils]: Spent 725.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 152 [2018-11-28 12:20:40,876 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-11-28 12:20:40,878 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:20:40,878 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:20:40,878 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:20:40,878 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:20:40,878 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:20:40,878 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:20:40,878 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:20:40,878 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:20:40,878 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd1-alloca_true-termination.c.i_Iteration8_Lasso [2018-11-28 12:20:40,878 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:20:40,878 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:20:40,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:40,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:40,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:40,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:40,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:40,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:40,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:40,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:40,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:40,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:40,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:40,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:41,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-11-28 12:20:41,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-11-28 12:20:41,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-11-28 12:20:41,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-11-28 12:20:41,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:41,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-11-28 12:20:41,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-11-28 12:20:41,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:41,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:41,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:41,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:41,367 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:20:41,367 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:20:41,367 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:41,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:41,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:41,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:41,368 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:41,368 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:20:41,368 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:41,369 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:41,369 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:41,370 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:41,370 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:41,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:41,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:41,370 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:41,370 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:41,370 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:41,370 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:41,371 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:41,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:41,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:41,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:41,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:41,371 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:41,371 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:41,371 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:41,372 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:41,372 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:41,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:41,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:41,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:41,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:41,373 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:20:41,373 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:41,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:41,374 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:41,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:41,375 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:41,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:41,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:41,375 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:41,375 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:41,375 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:41,375 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:41,376 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:41,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:41,376 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:41,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:41,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:41,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:41,376 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:41,376 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:41,377 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:41,377 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:41,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:41,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:41,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:41,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:41,378 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:20:41,378 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:41,379 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:41,379 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:41,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:41,379 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:41,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:41,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:41,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:41,380 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:41,380 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:41,380 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:41,380 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:41,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:41,381 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:41,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:41,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:41,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:41,381 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:41,381 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:41,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:41,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:41,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:41,382 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:41,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:41,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:41,382 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:41,383 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:41,383 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:41,383 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:41,383 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:41,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:41,384 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:41,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:41,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:41,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:41,384 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:41,384 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:41,384 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:41,385 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:41,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:41,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:41,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:41,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:41,385 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:20:41,386 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:41,387 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:41,387 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:41,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:41,387 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 12:20:41,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:41,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:41,388 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 12:20:41,388 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:41,390 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:41,390 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:41,391 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:41,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:41,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:41,391 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:41,392 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:20:41,392 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:41,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:41,398 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:41,398 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:41,398 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 12:20:41,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:41,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:41,399 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 12:20:41,399 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:41,401 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:41,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-11-28 12:20:41,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:41,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:41,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:41,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:41,403 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:20:41,403 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:41,405 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:41,405 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:41,405 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:41,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:41,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:41,406 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:41,406 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:20:41,406 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:41,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:41,408 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:41,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:41,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:41,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:41,409 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:41,410 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:20:41,410 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:41,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:41,412 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:41,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:41,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:41,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:41,412 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:41,413 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:20:41,413 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:41,414 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:41,414 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:41,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:41,414 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 12:20:41,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:41,414 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:41,415 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 12:20:41,415 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:41,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:41,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-11-28 12:20:41,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:41,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:41,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:41,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:41,418 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:20:41,418 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:41,419 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:41,419 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:41,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:41,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:41,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:41,420 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:41,421 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:20:41,421 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:41,434 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:20:41,446 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 12:20:41,447 INFO L444 ModelExtractionUtils]: 27 out of 37 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 12:20:41,447 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:20:41,448 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2018-11-28 12:20:41,448 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:20:41,448 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-11-28 12:20:41,576 INFO L297 tatePredicateManager]: 20 out of 25 supporting invariants were superfluous and have been removed [2018-11-28 12:20:41,582 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 12:20:41,583 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 12:20:41,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:20:41,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:20:41,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:20:41,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-28 12:20:41,621 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:41,622 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:41,622 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-11-28 12:20:41,622 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:41,625 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:41,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-11-28 12:20:41,629 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-11-28 12:20:41,660 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:41,663 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-11-28 12:20:41,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-28 12:20:41,664 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:41,671 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:41,673 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:20:41,673 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-11-28 12:20:41,675 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-11-28 12:20:41,675 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:41,678 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:41,681 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:41,684 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:41,719 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-11-28 12:20:41,728 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-11-28 12:20:41,728 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:41,930 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-11-28 12:20:41,930 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:42,239 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-11-28 12:20:42,240 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:42,559 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-11-28 12:20:42,561 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-11-28 12:20:42,561 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:42,566 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:42,700 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-11-28 12:20:42,700 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:42,816 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-11-28 12:20:42,823 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-11-28 12:20:42,823 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:42,829 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:42,916 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-11-28 12:20:42,920 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-11-28 12:20:42,920 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:20:42,985 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:20:43,043 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:20:43,108 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 42 treesize of output 34 [2018-11-28 12:20:43,108 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:43,160 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:20:43,224 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:20:43,290 INFO L267 ElimStorePlain]: Start of recursive call 15: 6 dim-1 vars, End of recursive call: 5 dim-0 vars, and 6 xjuncts. [2018-11-28 12:20:43,358 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-11-28 12:20:43,371 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-11-28 12:20:43,372 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 2 xjuncts. [2018-11-28 12:20:43,414 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-11-28 12:20:43,415 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:43,434 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-11-28 12:20:43,434 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:43,445 INFO L267 ElimStorePlain]: Start of recursive call 22: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:20:43,462 INFO L267 ElimStorePlain]: Start of recursive call 6: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:43,465 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:43,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, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 51 [2018-11-28 12:20:43,484 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-11-28 12:20:43,484 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:43,516 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-11-28 12:20:43,516 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:43,553 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-11-28 12:20:43,558 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-11-28 12:20:43,558 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:43,584 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-11-28 12:20:43,584 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 2 xjuncts. [2018-11-28 12:20:43,592 INFO L267 ElimStorePlain]: Start of recursive call 29: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:20:43,621 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-11-28 12:20:43,629 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-11-28 12:20:43,630 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 2 xjuncts. [2018-11-28 12:20:43,653 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-11-28 12:20:43,653 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:43,660 INFO L267 ElimStorePlain]: Start of recursive call 32: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:43,668 INFO L267 ElimStorePlain]: Start of recursive call 26: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:43,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:43,679 INFO L202 ElimStorePlain]: Needed 34 recursive calls to eliminate 1 variables, input treesize:63, output treesize:23 [2018-11-28 12:20:43,709 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:43,725 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-11-28 12:20:43,731 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-11-28 12:20:43,731 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:43,779 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-11-28 12:20:43,779 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:43,809 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-11-28 12:20:43,810 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-28 12:20:43,827 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-28 12:20:43,847 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-11-28 12:20:43,847 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:113 [2018-11-28 12:20:43,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:20:43,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:20:43,916 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:43,919 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:43,920 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-11-28 12:20:43,923 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:43,923 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-11-28 12:20:43,924 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:43,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:43,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:43,937 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:71, output treesize:36 [2018-11-28 12:20:43,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:20:43,952 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-11-28 12:20:43,953 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 63 transitions. cyclomatic complexity: 17 Second operand 7 states. [2018-11-28 12:20:43,987 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-11-28 12:20:43,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2018-11-28 12:20:43,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 12:20:43,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2018-11-28 12:20:43,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 15 letters. Loop has 2 letters. [2018-11-28 12:20:43,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:20:43,991 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:20:44,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:20:44,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:20:44,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:20:44,027 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-11-28 12:20:44,031 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:44,032 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:44,033 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-11-28 12:20:44,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:44,035 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:44,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:44,040 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-11-28 12:20:44,090 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:44,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, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 66 [2018-11-28 12:20:44,151 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-11-28 12:20:44,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:44,384 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-11-28 12:20:44,385 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:44,539 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-11-28 12:20:44,540 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:44,863 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-11-28 12:20:44,869 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-11-28 12:20:44,869 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:44,897 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-11-28 12:20:44,897 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-28 12:20:44,910 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:20:45,021 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-11-28 12:20:45,023 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-11-28 12:20:45,023 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:45,050 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-11-28 12:20:45,050 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-11-28 12:20:45,062 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:20:45,171 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-11-28 12:20:45,174 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-11-28 12:20:45,174 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:20:45,224 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:20:45,258 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-11-28 12:20:45,258 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:45,289 INFO L267 ElimStorePlain]: Start of recursive call 12: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-11-28 12:20:45,321 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:45,323 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:45,326 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-11-28 12:20:45,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 12 treesize of output 11 [2018-11-28 12:20:45,328 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:45,335 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:45,336 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:20:45,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, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2018-11-28 12:20:45,338 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-11-28 12:20:45,339 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:45,342 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:45,345 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:45,348 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:45,359 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-11-28 12:20:45,363 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-11-28 12:20:45,363 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:45,400 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-11-28 12:20:45,400 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:45,434 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-11-28 12:20:45,437 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-11-28 12:20:45,437 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:45,445 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:45,485 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-11-28 12:20:45,490 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-11-28 12:20:45,490 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:45,522 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-11-28 12:20:45,523 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 2 xjuncts. [2018-11-28 12:20:45,536 INFO L267 ElimStorePlain]: Start of recursive call 25: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:20:45,549 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:45,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:20:45,563 INFO L202 ElimStorePlain]: Needed 27 recursive calls to eliminate 1 variables, input treesize:63, output treesize:53 [2018-11-28 12:20:45,620 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-11-28 12:20:45,624 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-11-28 12:20:45,625 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:45,676 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-11-28 12:20:45,676 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:45,708 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-11-28 12:20:45,709 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-28 12:20:45,729 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-28 12:20:45,751 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-11-28 12:20:45,751 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:113 [2018-11-28 12:20:45,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:20:45,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:20:45,825 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:45,828 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:45,828 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-11-28 12:20:45,831 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:45,832 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-11-28 12:20:45,832 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:45,838 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:45,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:45,844 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:71, output treesize:36 [2018-11-28 12:20:45,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:20:45,860 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-11-28 12:20:45,860 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 63 transitions. cyclomatic complexity: 17 Second operand 7 states. [2018-11-28 12:20:45,893 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-11-28 12:20:45,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2018-11-28 12:20:45,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 12:20:45,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2018-11-28 12:20:45,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 15 letters. Loop has 2 letters. [2018-11-28 12:20:45,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:20:45,894 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:20:45,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:20:45,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:20:45,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:20:45,939 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-11-28 12:20:45,943 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:45,945 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:45,945 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-11-28 12:20:45,945 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:45,947 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:45,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:45,952 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-11-28 12:20:45,997 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:46,001 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-11-28 12:20:46,004 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-11-28 12:20:46,004 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:46,012 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:46,015 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:20:46,016 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-11-28 12:20:46,018 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-11-28 12:20:46,018 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:46,022 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:46,026 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:46,029 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:46,044 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-11-28 12:20:46,047 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-11-28 12:20:46,048 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:46,079 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-11-28 12:20:46,079 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:46,123 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-11-28 12:20:46,130 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-11-28 12:20:46,131 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:46,161 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-11-28 12:20:46,174 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-11-28 12:20:46,184 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:20:46,231 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-11-28 12:20:46,234 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-11-28 12:20:46,235 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:46,266 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-11-28 12:20:46,266 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-11-28 12:20:46,274 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:46,280 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:46,284 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:46,307 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-11-28 12:20:46,311 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-11-28 12:20:46,312 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:46,550 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-11-28 12:20:46,551 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:46,926 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-11-28 12:20:46,927 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:47,119 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-11-28 12:20:47,128 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-11-28 12:20:47,128 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:47,135 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:47,430 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-11-28 12:20:47,432 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-11-28 12:20:47,432 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:47,437 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:47,558 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 59 [2018-11-28 12:20:47,564 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 48 treesize of output 48 [2018-11-28 12:20:47,564 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:47,617 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-11-28 12:20:47,618 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 2 xjuncts. [2018-11-28 12:20:47,646 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 27 treesize of output 30 [2018-11-28 12:20:47,646 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:47,660 INFO L267 ElimStorePlain]: Start of recursive call 23: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:20:47,781 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-11-28 12:20:47,785 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-11-28 12:20:47,785 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:47,824 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 30 treesize of output 20 [2018-11-28 12:20:47,825 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:47,850 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 24 treesize of output 30 [2018-11-28 12:20:47,851 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 2 xjuncts. [2018-11-28 12:20:47,859 INFO L267 ElimStorePlain]: Start of recursive call 27: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:47,875 INFO L267 ElimStorePlain]: Start of recursive call 15: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:47,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:47,884 INFO L202 ElimStorePlain]: Needed 30 recursive calls to eliminate 1 variables, input treesize:63, output treesize:23 [2018-11-28 12:20:47,911 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:47,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 2 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 58 [2018-11-28 12:20:47,935 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-11-28 12:20:47,935 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:47,989 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-11-28 12:20:47,990 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 12:20:48,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 23 [2018-11-28 12:20:48,020 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:48,037 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-28 12:20:48,058 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-11-28 12:20:48,059 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:113 [2018-11-28 12:20:48,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:20:48,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:20:48,131 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:48,133 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:48,134 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-11-28 12:20:48,137 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:48,137 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-11-28 12:20:48,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:48,143 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:48,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:48,149 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:71, output treesize:36 [2018-11-28 12:20:48,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:20:48,162 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-11-28 12:20:48,163 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 63 transitions. cyclomatic complexity: 17 Second operand 7 states. [2018-11-28 12:20:48,244 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-11-28 12:20:48,244 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-11-28 12:20:48,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 12:20:48,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2018-11-28 12:20:48,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 15 letters. Loop has 2 letters. [2018-11-28 12:20:48,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:20:48,245 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:20:48,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:20:48,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:20:48,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:20:48,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-28 12:20:48,283 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:48,284 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:48,285 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-11-28 12:20:48,285 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:48,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:48,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:48,293 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-11-28 12:20:48,332 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:48,345 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-11-28 12:20:48,349 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-11-28 12:20:48,349 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:48,376 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-11-28 12:20:48,376 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:48,400 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-11-28 12:20:48,408 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-11-28 12:20:48,408 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-28 12:20:48,414 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:48,443 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-11-28 12:20:48,446 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-11-28 12:20:48,446 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:48,472 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-11-28 12:20:48,472 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-28 12:20:48,481 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:48,489 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:48,492 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:48,495 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-11-28 12:20:48,497 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-11-28 12:20:48,497 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:48,508 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:48,511 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:20:48,512 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-11-28 12:20:48,514 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-11-28 12:20:48,514 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:48,518 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:48,522 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:48,525 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:48,545 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-11-28 12:20:48,555 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-11-28 12:20:48,555 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:48,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 39 [2018-11-28 12:20:48,904 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:49,057 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-11-28 12:20:49,057 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:49,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, 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-11-28 12:20:49,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 22 treesize of output 11 [2018-11-28 12:20:49,364 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:49,369 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:49,498 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-11-28 12:20:49,498 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:49,612 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-11-28 12:20:49,615 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-11-28 12:20:49,615 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:49,620 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:49,702 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 59 [2018-11-28 12:20:49,707 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-11-28 12:20:49,707 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:49,750 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 27 treesize of output 30 [2018-11-28 12:20:49,750 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:49,775 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-11-28 12:20:49,776 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 2 xjuncts. [2018-11-28 12:20:49,786 INFO L267 ElimStorePlain]: Start of recursive call 23: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:20:49,803 INFO L267 ElimStorePlain]: Start of recursive call 14: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:49,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:20:49,815 INFO L202 ElimStorePlain]: Needed 26 recursive calls to eliminate 1 variables, input treesize:63, output treesize:53 [2018-11-28 12:20:49,849 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:49,861 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-11-28 12:20:49,864 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-11-28 12:20:49,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:49,915 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-11-28 12:20:49,916 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 12:20:49,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 23 [2018-11-28 12:20:49,940 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:49,954 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-28 12:20:49,972 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-11-28 12:20:49,972 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:113 [2018-11-28 12:20:50,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:20:50,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:20:50,038 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:50,051 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:50,052 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-11-28 12:20:50,055 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:50,055 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-11-28 12:20:50,056 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:50,061 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:50,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:50,066 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:71, output treesize:36 [2018-11-28 12:20:50,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:20:50,080 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-11-28 12:20:50,080 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 63 transitions. cyclomatic complexity: 17 Second operand 7 states. [2018-11-28 12:20:50,157 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-11-28 12:20:50,157 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-11-28 12:20:50,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 12:20:50,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2018-11-28 12:20:50,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 15 letters. Loop has 2 letters. [2018-11-28 12:20:50,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:20:50,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 17 letters. Loop has 2 letters. [2018-11-28 12:20:50,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:20:50,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 15 letters. Loop has 4 letters. [2018-11-28 12:20:50,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:20:50,159 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 81 transitions. [2018-11-28 12:20:50,159 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-28 12:20:50,161 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 59 states and 73 transitions. [2018-11-28 12:20:50,161 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-28 12:20:50,161 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-28 12:20:50,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 73 transitions. [2018-11-28 12:20:50,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:20:50,162 INFO L705 BuchiCegarLoop]: Abstraction has 59 states and 73 transitions. [2018-11-28 12:20:50,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 73 transitions. [2018-11-28 12:20:50,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 36. [2018-11-28 12:20:50,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-28 12:20:50,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2018-11-28 12:20:50,166 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2018-11-28 12:20:50,166 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2018-11-28 12:20:50,166 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-28 12:20:50,167 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 45 transitions. [2018-11-28 12:20:50,167 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-28 12:20:50,167 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:20:50,167 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:20:50,167 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:20:50,167 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 1, 1, 1, 1] [2018-11-28 12:20:50,167 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~mem12;havoc gcd_#t~mem11; 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-11-28 12:20:50,167 INFO L796 eck$LassoCheckResult]: Loop: 2613#L557-1 assume !!(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem12;havoc gcd_#t~mem11;call gcd_#t~mem13 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem14 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem13 - gcd_#t~mem14, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem13;havoc gcd_#t~mem14; 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~mem12;havoc gcd_#t~mem11;call gcd_#t~mem13 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem14 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem13 - gcd_#t~mem14, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem13;havoc gcd_#t~mem14; 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~mem12;havoc gcd_#t~mem11; 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-11-28 12:20:50,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:20:50,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1804472061, now seen corresponding path program 2 times [2018-11-28 12:20:50,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:20:50,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:20:50,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:20:50,168 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:20:50,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:20:50,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:20:50,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:20:50,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:20:50,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1547227717, now seen corresponding path program 3 times [2018-11-28 12:20:50,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:20:50,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:20:50,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:20:50,182 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:20:50,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:20:50,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:20:50,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:20:50,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:20:50,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1970848007, now seen corresponding path program 7 times [2018-11-28 12:20:50,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:20:50,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:20:50,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:20:50,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:20:50,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:20:50,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:20:50,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:20:50,350 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2018-11-28 12:20:50,830 WARN L180 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 140 [2018-11-28 12:20:50,959 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-11-28 12:20:50,962 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:20:50,962 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:20:50,962 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:20:50,962 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:20:50,962 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:20:50,962 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:20:50,962 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:20:50,962 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:20:50,962 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd1-alloca_true-termination.c.i_Iteration9_Lasso [2018-11-28 12:20:50,963 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:20:50,963 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:20:50,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:50,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:50,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:50,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:50,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:50,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:50,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:50,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:50,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:51,181 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 81 [2018-11-28 12:20:51,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:51,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:51,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:51,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:51,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:51,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:51,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:51,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:51,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:51,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:51,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:51,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:51,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:51,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:51,538 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:20:51,538 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:20:51,538 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:51,539 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:51,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:51,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:51,539 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:51,539 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:20:51,540 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:51,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:51,541 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:51,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:51,541 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:51,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:51,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:51,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:51,541 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:51,541 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:51,542 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:51,542 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:51,542 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:51,542 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:51,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:51,542 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:51,542 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:51,543 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:51,543 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:51,543 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:51,543 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:51,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:51,543 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:51,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:51,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:51,544 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:51,544 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:51,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:51,544 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:51,544 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:51,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:51,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:51,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:51,545 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:51,545 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:20:51,545 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:51,546 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:51,547 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:51,547 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:51,547 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:51,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:51,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:51,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:51,547 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:51,547 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:51,548 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:51,548 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:51,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:51,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:51,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:51,548 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:51,549 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:20:51,549 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:51,550 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:51,550 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:51,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:51,550 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:51,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:51,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:51,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:51,551 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:51,551 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:51,551 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:51,551 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:51,552 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:51,552 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 12:20:51,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:51,552 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:51,552 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 12:20:51,552 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:51,555 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:51,555 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:51,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:51,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:51,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:51,556 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:51,557 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:20:51,557 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:20:51,568 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:20:51,580 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 12:20:51,580 INFO L444 ModelExtractionUtils]: 28 out of 37 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-11-28 12:20:51,581 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:20:51,581 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 12:20:51,581 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:20:51,581 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-11-28 12:20:51,722 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-28 12:20:51,723 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 12:20:51,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:20:51,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:20:51,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:20:51,748 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-11-28 12:20:51,752 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:51,753 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:51,753 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-11-28 12:20:51,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:51,755 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:51,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:51,758 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-28 12:20:51,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:20:51,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:20:51,779 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-11-28 12:20:51,781 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-11-28 12:20:51,781 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:51,802 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-11-28 12:20:51,803 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-28 12:20:51,817 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-28 12:20:51,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 12:20:51,828 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:35, output treesize:54 [2018-11-28 12:20:51,848 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:20:51,849 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-11-28 12:20:51,851 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:20:51,851 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-11-28 12:20:51,852 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:51,855 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:51,878 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-11-28 12:20:51,881 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-11-28 12:20:51,881 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:51,885 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:51,902 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-11-28 12:20:51,913 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-11-28 12:20:51,913 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 3 xjuncts. [2018-11-28 12:20:51,922 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:20:51,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 12:20:51,934 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:123, output treesize:51 [2018-11-28 12:20:52,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, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 63 [2018-11-28 12:20:52,024 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-11-28 12:20:52,025 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:52,061 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-11-28 12:20:52,061 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:52,092 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:52,094 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-11-28 12:20:52,100 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-11-28 12:20:52,101 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-28 12:20:52,112 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:20:52,148 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:52,161 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-11-28 12:20:52,165 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-28 12:20:52,165 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:52,253 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:52,254 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 46 treesize of output 52 [2018-11-28 12:20:52,254 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:52,307 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:52,312 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-11-28 12:20:52,313 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-28 12:20:52,361 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:52,362 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:52,362 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-11-28 12:20:52,363 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:52,381 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-28 12:20:52,419 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 12:20:52,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 12:20:52,437 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 1 variables, input treesize:76, output treesize:115 [2018-11-28 12:20:52,511 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:52,512 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-11-28 12:20:52,515 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-11-28 12:20:52,515 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:52,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:52,561 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:52,563 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-11-28 12:20:52,565 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-11-28 12:20:52,565 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:52,575 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:52,605 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:20:52,607 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-11-28 12:20:52,608 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-11-28 12:20:52,609 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:52,615 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:52,639 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-11-28 12:20:52,639 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:178, output treesize:129 [2018-11-28 12:20:52,685 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 12:20:52,685 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-11-28 12:20:52,685 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 45 transitions. cyclomatic complexity: 12 Second operand 9 states. [2018-11-28 12:20:52,834 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-11-28 12:20:52,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-28 12:20:52,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-28 12:20:52,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 20 transitions. [2018-11-28 12:20:52,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 20 transitions. Stem has 13 letters. Loop has 9 letters. [2018-11-28 12:20:52,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:20:52,835 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:20:52,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:20:52,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:20:52,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:20:52,867 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-11-28 12:20:52,872 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:52,873 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:52,873 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-11-28 12:20:52,873 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:52,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:52,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:52,878 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-28 12:20:52,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:20:52,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:20:52,900 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-11-28 12:20:52,902 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-11-28 12:20:52,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:52,926 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-11-28 12:20:52,927 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-28 12:20:52,940 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-28 12:20:52,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 12:20:52,952 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:35, output treesize:54 [2018-11-28 12:20:52,974 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-11-28 12:20:52,976 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-11-28 12:20:52,976 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:52,979 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:53,001 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-11-28 12:20:53,005 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-11-28 12:20:53,005 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:53,009 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:53,025 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:20:53,025 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-11-28 12:20:53,027 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:20:53,027 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-11-28 12:20:53,027 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:53,031 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:53,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 12:20:53,085 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:123, output treesize:51 [2018-11-28 12:20:53,175 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-11-28 12:20:53,177 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-11-28 12:20:53,178 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:53,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2018-11-28 12:20:53,213 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:53,246 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:53,248 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-11-28 12:20:53,255 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-11-28 12:20:53,255 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-28 12:20:53,266 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:20:53,303 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:53,316 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-11-28 12:20:53,319 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-11-28 12:20:53,319 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:53,384 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:53,384 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:53,385 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-11-28 12:20:53,385 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:53,444 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:53,448 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-11-28 12:20:53,449 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-28 12:20:53,470 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-28 12:20:53,514 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 12:20:53,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 12:20:53,532 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 1 variables, input treesize:76, output treesize:115 [2018-11-28 12:20:53,600 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:53,601 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-11-28 12:20:53,603 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-11-28 12:20:53,603 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:53,611 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:53,643 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:20:53,644 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-11-28 12:20:53,645 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-11-28 12:20:53,646 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:53,650 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:53,679 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:53,680 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-11-28 12:20:53,682 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-11-28 12:20:53,682 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:53,689 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:53,709 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-11-28 12:20:53,709 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:178, output treesize:129 [2018-11-28 12:20:53,767 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 12:20:53,767 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-11-28 12:20:53,767 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 45 transitions. cyclomatic complexity: 12 Second operand 9 states. [2018-11-28 12:20:53,919 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-11-28 12:20:53,919 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-11-28 12:20:53,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-28 12:20:53,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 19 transitions. [2018-11-28 12:20:53,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 19 transitions. Stem has 13 letters. Loop has 9 letters. [2018-11-28 12:20:53,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:20:53,920 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:20:53,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:20:53,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:20:53,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:20:53,944 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-11-28 12:20:53,948 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:53,948 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:53,949 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-11-28 12:20:53,949 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:53,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:53,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:53,955 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-28 12:20:53,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:20:53,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:20:53,973 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-11-28 12:20:53,976 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-11-28 12:20:53,976 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:53,997 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-11-28 12:20:53,997 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-28 12:20:54,011 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-28 12:20:54,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 12:20:54,022 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:35, output treesize:54 [2018-11-28 12:20:54,044 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-11-28 12:20:54,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 18 treesize of output 15 [2018-11-28 12:20:54,046 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:54,050 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:54,073 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-11-28 12:20:54,077 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-11-28 12:20:54,077 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:54,081 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:54,097 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:20:54,097 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-11-28 12:20:54,099 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:20:54,099 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-11-28 12:20:54,099 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:54,103 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:54,115 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 12:20:54,115 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:123, output treesize:51 [2018-11-28 12:20:54,201 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-11-28 12:20:54,204 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-11-28 12:20:54,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:54,240 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-11-28 12:20:54,240 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:54,275 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:54,282 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 51 treesize of output 67 [2018-11-28 12:20:54,285 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-11-28 12:20:54,285 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:54,308 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:54,309 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:54,309 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-11-28 12:20:54,309 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:54,322 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:20:54,362 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:54,363 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:54,378 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-11-28 12:20:54,383 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 77 treesize of output 66 [2018-11-28 12:20:54,384 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:54,467 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:54,470 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:54,474 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-11-28 12:20:54,475 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-28 12:20:54,563 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:54,567 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-11-28 12:20:54,568 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-11-28 12:20:54,607 INFO L267 ElimStorePlain]: Start of recursive call 8: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-28 12:20:54,670 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 12:20:54,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 12:20:54,688 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 1 variables, input treesize:76, output treesize:115 [2018-11-28 12:20:54,760 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:54,761 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-11-28 12:20:54,762 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-11-28 12:20:54,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:54,769 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:54,803 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:54,803 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-11-28 12:20:54,805 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-11-28 12:20:54,805 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:54,814 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:54,841 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:20:54,841 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-11-28 12:20:54,843 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-11-28 12:20:54,843 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:54,848 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:54,868 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-11-28 12:20:54,868 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:178, output treesize:129 [2018-11-28 12:20:54,925 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 12:20:54,925 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-11-28 12:20:54,925 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 45 transitions. cyclomatic complexity: 12 Second operand 9 states. [2018-11-28 12:20:55,028 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-11-28 12:20:55,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-28 12:20:55,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-28 12:20:55,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 24 transitions. [2018-11-28 12:20:55,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 24 transitions. Stem has 13 letters. Loop has 9 letters. [2018-11-28 12:20:55,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:20:55,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 24 transitions. Stem has 22 letters. Loop has 9 letters. [2018-11-28 12:20:55,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:20:55,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 24 transitions. Stem has 13 letters. Loop has 18 letters. [2018-11-28 12:20:55,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:20:55,031 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 112 transitions. [2018-11-28 12:20:55,032 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 12:20:55,032 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 0 states and 0 transitions. [2018-11-28 12:20:55,032 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 12:20:55,032 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 12:20:55,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 12:20:55,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:20:55,032 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:20:55,032 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:20:55,032 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:20:55,032 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-28 12:20:55,032 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 12:20:55,033 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 12:20:55,033 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 12:20:55,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 12:20:55 BoogieIcfgContainer [2018-11-28 12:20:55,038 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 12:20:55,038 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 12:20:55,038 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 12:20:55,039 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 12:20:55,039 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:20:25" (3/4) ... [2018-11-28 12:20:55,042 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 12:20:55,042 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 12:20:55,043 INFO L168 Benchmark]: Toolchain (without parser) took 30332.00 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 497.0 MB). Free memory was 950.6 MB in the beginning and 1.4 GB in the end (delta: -427.3 MB). Peak memory consumption was 69.8 MB. Max. memory is 11.5 GB. [2018-11-28 12:20:55,043 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:20:55,044 INFO L168 Benchmark]: CACSL2BoogieTranslator took 322.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -164.2 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2018-11-28 12:20:55,044 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-28 12:20:55,044 INFO L168 Benchmark]: Boogie Preprocessor took 19.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-28 12:20:55,044 INFO L168 Benchmark]: RCFGBuilder took 214.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-11-28 12:20:55,044 INFO L168 Benchmark]: BuchiAutomizer took 29739.49 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 371.7 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -288.1 MB). Peak memory consumption was 83.6 MB. Max. memory is 11.5 GB. [2018-11-28 12:20:55,045 INFO L168 Benchmark]: Witness Printer took 3.83 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:20:55,046 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 322.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -164.2 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 214.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 29739.49 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 371.7 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -288.1 MB). Peak memory consumption was 83.6 MB. Max. memory is 11.5 GB. * Witness Printer took 3.83 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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[r][r] + -2 * unknown-#memory_int-unknown[y_ref][y_ref] + 1 and consists of 7 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[r][r] and consists of 8 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[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 29.7s and 10 iterations. TraceHistogramMax:3. Analysis of lassos took 11.2s. Construction of modules took 0.6s. Büchi inclusion checks took 17.7s. 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...