./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/gcd1-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_cb4fffb3-f1f1-4f62-9d11-0cd8c2085826/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_cb4fffb3-f1f1-4f62-9d11-0cd8c2085826/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_cb4fffb3-f1f1-4f62-9d11-0cd8c2085826/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_cb4fffb3-f1f1-4f62-9d11-0cd8c2085826/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_cb4fffb3-f1f1-4f62-9d11-0cd8c2085826/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_cb4fffb3-f1f1-4f62-9d11-0cd8c2085826/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 160024a3cc4acfbc7213f984e87ef0c708b94aaf ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-01 08:13:14,499 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 08:13:14,500 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 08:13:14,506 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 08:13:14,507 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 08:13:14,507 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 08:13:14,508 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 08:13:14,509 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 08:13:14,510 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 08:13:14,510 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 08:13:14,511 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 08:13:14,511 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 08:13:14,511 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 08:13:14,512 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 08:13:14,513 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 08:13:14,513 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 08:13:14,513 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 08:13:14,514 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 08:13:14,515 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 08:13:14,516 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 08:13:14,517 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 08:13:14,518 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 08:13:14,519 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 08:13:14,519 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 08:13:14,519 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 08:13:14,520 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 08:13:14,520 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 08:13:14,521 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 08:13:14,521 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 08:13:14,522 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 08:13:14,522 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 08:13:14,522 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 08:13:14,522 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 08:13:14,522 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 08:13:14,523 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 08:13:14,523 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 08:13:14,523 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_cb4fffb3-f1f1-4f62-9d11-0cd8c2085826/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-01 08:13:14,532 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 08:13:14,532 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 08:13:14,533 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 08:13:14,533 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 08:13:14,533 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 08:13:14,533 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-01 08:13:14,533 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-01 08:13:14,533 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-01 08:13:14,533 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-01 08:13:14,533 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-01 08:13:14,533 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-01 08:13:14,534 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 08:13:14,534 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-01 08:13:14,534 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 08:13:14,534 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 08:13:14,534 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-01 08:13:14,534 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-01 08:13:14,534 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-01 08:13:14,534 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 08:13:14,534 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-01 08:13:14,535 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 08:13:14,535 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-01 08:13:14,535 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 08:13:14,535 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 08:13:14,535 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-01 08:13:14,535 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 08:13:14,535 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 08:13:14,535 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-01 08:13:14,536 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-01 08:13:14,536 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_cb4fffb3-f1f1-4f62-9d11-0cd8c2085826/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 160024a3cc4acfbc7213f984e87ef0c708b94aaf [2018-12-01 08:13:14,553 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 08:13:14,560 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 08:13:14,562 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 08:13:14,563 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 08:13:14,563 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 08:13:14,564 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_cb4fffb3-f1f1-4f62-9d11-0cd8c2085826/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/gcd1-alloca_true-termination.c.i [2018-12-01 08:13:14,598 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cb4fffb3-f1f1-4f62-9d11-0cd8c2085826/bin-2019/uautomizer/data/65560023f/d066fba3c8e4417a8d6b80adb91d2ef6/FLAGc73e11f88 [2018-12-01 08:13:15,039 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 08:13:15,040 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_cb4fffb3-f1f1-4f62-9d11-0cd8c2085826/sv-benchmarks/c/termination-memory-alloca/gcd1-alloca_true-termination.c.i [2018-12-01 08:13:15,046 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cb4fffb3-f1f1-4f62-9d11-0cd8c2085826/bin-2019/uautomizer/data/65560023f/d066fba3c8e4417a8d6b80adb91d2ef6/FLAGc73e11f88 [2018-12-01 08:13:15,053 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_cb4fffb3-f1f1-4f62-9d11-0cd8c2085826/bin-2019/uautomizer/data/65560023f/d066fba3c8e4417a8d6b80adb91d2ef6 [2018-12-01 08:13:15,055 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 08:13:15,056 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 08:13:15,056 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 08:13:15,056 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 08:13:15,058 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 08:13:15,059 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 08:13:15" (1/1) ... [2018-12-01 08:13:15,060 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58dfd927 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:13:15, skipping insertion in model container [2018-12-01 08:13:15,060 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 08:13:15" (1/1) ... [2018-12-01 08:13:15,064 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 08:13:15,081 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 08:13:15,218 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 08:13:15,225 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 08:13:15,280 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 08:13:15,299 INFO L195 MainTranslator]: Completed translation [2018-12-01 08:13:15,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:13:15 WrapperNode [2018-12-01 08:13:15,300 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 08:13:15,300 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 08:13:15,300 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 08:13:15,300 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 08:13:15,305 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:13:15" (1/1) ... [2018-12-01 08:13:15,313 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:13:15" (1/1) ... [2018-12-01 08:13:15,325 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 08:13:15,326 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 08:13:15,326 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 08:13:15,326 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 08:13:15,331 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:13:15" (1/1) ... [2018-12-01 08:13:15,331 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:13:15" (1/1) ... [2018-12-01 08:13:15,333 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:13:15" (1/1) ... [2018-12-01 08:13:15,333 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:13:15" (1/1) ... [2018-12-01 08:13:15,335 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:13:15" (1/1) ... [2018-12-01 08:13:15,338 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:13:15" (1/1) ... [2018-12-01 08:13:15,339 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:13:15" (1/1) ... [2018-12-01 08:13:15,340 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 08:13:15,340 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 08:13:15,340 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 08:13:15,340 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 08:13:15,341 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:13:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cb4fffb3-f1f1-4f62-9d11-0cd8c2085826/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 08:13:15,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-01 08:13:15,372 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-01 08:13:15,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-01 08:13:15,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-01 08:13:15,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 08:13:15,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 08:13:15,501 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 08:13:15,502 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-01 08:13:15,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 08:13:15 BoogieIcfgContainer [2018-12-01 08:13:15,502 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 08:13:15,502 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-01 08:13:15,502 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-01 08:13:15,505 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-01 08:13:15,505 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 08:13:15,506 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.12 08:13:15" (1/3) ... [2018-12-01 08:13:15,506 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@35731614 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 08:13:15, skipping insertion in model container [2018-12-01 08:13:15,506 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 08:13:15,506 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:13:15" (2/3) ... [2018-12-01 08:13:15,507 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@35731614 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 08:13:15, skipping insertion in model container [2018-12-01 08:13:15,507 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 08:13:15,507 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 08:13:15" (3/3) ... [2018-12-01 08:13:15,508 INFO L375 chiAutomizerObserver]: Analyzing ICFG gcd1-alloca_true-termination.c.i [2018-12-01 08:13:15,540 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 08:13:15,541 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-01 08:13:15,541 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-01 08:13:15,541 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-01 08:13:15,541 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 08:13:15,541 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 08:13:15,541 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-01 08:13:15,541 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 08:13:15,541 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-01 08:13:15,549 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-12-01 08:13:15,562 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-01 08:13:15,562 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 08:13:15,562 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 08:13:15,566 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-01 08:13:15,567 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-01 08:13:15,567 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-01 08:13:15,567 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-12-01 08:13:15,567 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-01 08:13:15,568 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 08:13:15,568 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 08:13:15,568 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-01 08:13:15,568 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-01 08:13:15,573 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet18;havoc main_#t~nondet18;main_~y~0 := main_#t~nondet19;havoc main_#t~nondet19;gcd_#in~x, gcd_#in~y := main_~x~0, main_~y~0;havoc gcd_#res;havoc gcd_#t~malloc2.base, gcd_#t~malloc2.offset, gcd_#t~malloc3.base, gcd_#t~malloc3.offset, gcd_#t~malloc4.base, gcd_#t~malloc4.offset, gcd_#t~mem5, gcd_#t~mem6, gcd_#t~mem7, gcd_#t~mem8, gcd_#t~mem10, gcd_#t~mem13, gcd_#t~mem14, gcd_#t~mem11, gcd_#t~mem12, gcd_#t~mem15, gcd_#t~mem16, gcd_#t~mem9, gcd_#t~mem17, gcd_~x, gcd_~y, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, gcd_~r~0.base, gcd_~r~0.offset;gcd_~x := gcd_#in~x;gcd_~y := gcd_#in~y;call gcd_#t~malloc2.base, gcd_#t~malloc2.offset := #Ultimate.alloc(4);gcd_~x_ref~0.base, gcd_~x_ref~0.offset := gcd_#t~malloc2.base, gcd_#t~malloc2.offset;call gcd_#t~malloc3.base, gcd_#t~malloc3.offset := #Ultimate.alloc(4);gcd_~y_ref~0.base, gcd_~y_ref~0.offset := gcd_#t~malloc3.base, gcd_#t~malloc3.offset;call gcd_#t~malloc4.base, gcd_#t~malloc4.offset := #Ultimate.alloc(4);gcd_~r~0.base, gcd_~r~0.offset := gcd_#t~malloc4.base, gcd_#t~malloc4.offset;call write~int(gcd_~x, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_~y, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call gcd_#t~mem5 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4); 9#L553true assume !(gcd_#t~mem5 < 0);havoc gcd_#t~mem5; 15#L553-2true call gcd_#t~mem7 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 5#L554true assume !(gcd_#t~mem7 < 0);havoc gcd_#t~mem7; 10#L555-2true [2018-12-01 08:13:15,573 INFO L796 eck$LassoCheckResult]: Loop: 10#L555-2true call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 4#L555true assume !!(gcd_#t~mem9 > 0);havoc gcd_#t~mem9;call gcd_#t~mem10 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_#t~mem10, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem10; 6#L557-3true assume !true; 11#L557-4true call gcd_#t~mem15 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem15, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);havoc gcd_#t~mem15;call gcd_#t~mem16 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call write~int(gcd_#t~mem16, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);havoc gcd_#t~mem16; 10#L555-2true [2018-12-01 08:13:15,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:13:15,577 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2018-12-01 08:13:15,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:13:15,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:13:15,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:13:15,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:13:15,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:13:15,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:13:15,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:13:15,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:13:15,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1513768, now seen corresponding path program 1 times [2018-12-01 08:13:15,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:13:15,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:13:15,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:13:15,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:13:15,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:13:15,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:13:15,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 08:13:15,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 08:13:15,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-01 08:13:15,691 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 08:13:15,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-01 08:13:15,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-01 08:13:15,701 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 2 states. [2018-12-01 08:13:15,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 08:13:15,705 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2018-12-01 08:13:15,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-01 08:13:15,706 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2018-12-01 08:13:15,706 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-01 08:13:15,709 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 10 states and 13 transitions. [2018-12-01 08:13:15,709 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-01 08:13:15,709 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-01 08:13:15,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2018-12-01 08:13:15,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 08:13:15,710 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-12-01 08:13:15,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2018-12-01 08:13:15,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-01 08:13:15,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-01 08:13:15,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-12-01 08:13:15,726 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-12-01 08:13:15,726 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-12-01 08:13:15,726 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-01 08:13:15,726 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2018-12-01 08:13:15,726 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-01 08:13:15,726 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 08:13:15,727 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 08:13:15,727 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-01 08:13:15,727 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-01 08:13:15,727 INFO L794 eck$LassoCheckResult]: Stem: 44#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 38#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet18;havoc main_#t~nondet18;main_~y~0 := main_#t~nondet19;havoc main_#t~nondet19;gcd_#in~x, gcd_#in~y := main_~x~0, main_~y~0;havoc gcd_#res;havoc gcd_#t~malloc2.base, gcd_#t~malloc2.offset, gcd_#t~malloc3.base, gcd_#t~malloc3.offset, gcd_#t~malloc4.base, gcd_#t~malloc4.offset, gcd_#t~mem5, gcd_#t~mem6, gcd_#t~mem7, gcd_#t~mem8, gcd_#t~mem10, gcd_#t~mem13, gcd_#t~mem14, gcd_#t~mem11, gcd_#t~mem12, gcd_#t~mem15, gcd_#t~mem16, gcd_#t~mem9, gcd_#t~mem17, gcd_~x, gcd_~y, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, gcd_~r~0.base, gcd_~r~0.offset;gcd_~x := gcd_#in~x;gcd_~y := gcd_#in~y;call gcd_#t~malloc2.base, gcd_#t~malloc2.offset := #Ultimate.alloc(4);gcd_~x_ref~0.base, gcd_~x_ref~0.offset := gcd_#t~malloc2.base, gcd_#t~malloc2.offset;call gcd_#t~malloc3.base, gcd_#t~malloc3.offset := #Ultimate.alloc(4);gcd_~y_ref~0.base, gcd_~y_ref~0.offset := gcd_#t~malloc3.base, gcd_#t~malloc3.offset;call gcd_#t~malloc4.base, gcd_#t~malloc4.offset := #Ultimate.alloc(4);gcd_~r~0.base, gcd_~r~0.offset := gcd_#t~malloc4.base, gcd_#t~malloc4.offset;call write~int(gcd_~x, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_~y, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call gcd_#t~mem5 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4); 39#L553 assume !(gcd_#t~mem5 < 0);havoc gcd_#t~mem5; 42#L553-2 call gcd_#t~mem7 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 45#L554 assume !(gcd_#t~mem7 < 0);havoc gcd_#t~mem7; 41#L555-2 [2018-12-01 08:13:15,727 INFO L796 eck$LassoCheckResult]: Loop: 41#L555-2 call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 43#L555 assume !!(gcd_#t~mem9 > 0);havoc gcd_#t~mem9;call gcd_#t~mem10 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_#t~mem10, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem10; 47#L557-3 call gcd_#t~mem11 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem12 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 46#L557-1 assume !(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem11;havoc gcd_#t~mem12; 40#L557-4 call gcd_#t~mem15 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem15, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);havoc gcd_#t~mem15;call gcd_#t~mem16 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call write~int(gcd_#t~mem16, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);havoc gcd_#t~mem16; 41#L555-2 [2018-12-01 08:13:15,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:13:15,727 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 2 times [2018-12-01 08:13:15,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:13:15,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:13:15,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:13:15,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:13:15,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:13:15,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:13:15,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:13:15,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:13:15,748 INFO L82 PathProgramCache]: Analyzing trace with hash 46919933, now seen corresponding path program 1 times [2018-12-01 08:13:15,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:13:15,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:13:15,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:13:15,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 08:13:15,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:13:15,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:13:15,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:13:15,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:13:15,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1985425099, now seen corresponding path program 1 times [2018-12-01 08:13:15,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:13:15,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:13:15,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:13:15,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:13:15,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:13:15,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:13:15,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:13:16,049 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 91 [2018-12-01 08:13:16,119 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 08:13:16,120 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 08:13:16,120 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 08:13:16,120 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 08:13:16,120 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 08:13:16,120 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 08:13:16,121 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 08:13:16,121 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 08:13:16,121 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd1-alloca_true-termination.c.i_Iteration2_Lasso [2018-12-01 08:13:16,121 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 08:13:16,121 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 08:13:16,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:16,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:16,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:16,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:16,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:16,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:16,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:16,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:16,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:16,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:16,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:16,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:16,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:16,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:16,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:16,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:16,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:16,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:16,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:16,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:16,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:16,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:16,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:16,353 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2018-12-01 08:13:16,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:16,721 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 08:13:16,724 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 08:13:16,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:16,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:16,726 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:16,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:16,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:16,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:16,735 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:16,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:16,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:16,737 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:16,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:16,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:16,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:16,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:16,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:16,738 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:16,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:16,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:16,739 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:16,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:16,739 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:16,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:16,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:16,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:16,739 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:16,739 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:16,740 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:16,740 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:16,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:16,740 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:16,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:16,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:16,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:16,741 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:16,741 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:16,741 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:16,741 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:16,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:16,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:16,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:16,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:16,743 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:13:16,743 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:16,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:16,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-12-01 08:13:16,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:16,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:16,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:16,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:16,747 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:13:16,747 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:16,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:16,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-12-01 08:13:16,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:16,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:16,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:16,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:16,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:16,750 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:16,750 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:16,751 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:16,751 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:16,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:16,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:16,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:16,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:16,752 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:13:16,752 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:16,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:16,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-12-01 08:13:16,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:16,755 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:16,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:16,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:16,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:16,755 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:16,755 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:16,756 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:16,756 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:16,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:16,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:16,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:16,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:16,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:16,757 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:16,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:16,757 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:16,757 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:16,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:16,758 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:16,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:16,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:16,758 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:16,758 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:16,758 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:16,759 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:16,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:16,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:16,759 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:16,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:16,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:16,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:16,760 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:16,760 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:16,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:16,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-12-01 08:13:16,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:16,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:16,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:16,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:16,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:16,761 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:16,761 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:16,762 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:16,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:16,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:16,762 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:16,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:16,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:16,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:16,763 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:16,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:16,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:16,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-12-01 08:13:16,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:16,764 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:16,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:16,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:16,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:16,764 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:16,764 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:16,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:16,765 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:16,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:16,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:16,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:16,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:16,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:16,766 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:16,766 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:16,766 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:16,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-12-01 08:13:16,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:16,767 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:16,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:16,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:16,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:16,767 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:16,767 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:16,767 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:16,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-12-01 08:13:16,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:16,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:16,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:16,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:16,769 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:13:16,769 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:16,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:16,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-12-01 08:13:16,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:16,771 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:16,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:16,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:16,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:16,771 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:16,772 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:16,772 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:16,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:16,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:16,773 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:16,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:16,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:16,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:16,773 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:16,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:16,773 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:16,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:16,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:16,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:16,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:16,774 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:16,775 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:13:16,775 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:16,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:16,778 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:16,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:16,778 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:16,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:16,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:16,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:16,779 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:16,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:16,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:16,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-12-01 08:13:16,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:16,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:16,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:16,781 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:16,782 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:13:16,782 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:16,785 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:16,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-12-01 08:13:16,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:16,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:16,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:16,786 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:16,787 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:13:16,787 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:16,796 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:16,796 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:16,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:16,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:16,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:16,797 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:16,800 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:13:16,800 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:16,822 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 08:13:16,840 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-01 08:13:16,840 INFO L444 ModelExtractionUtils]: 24 out of 31 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-12-01 08:13:16,842 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 08:13:16,844 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 08:13:16,844 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 08:13:16,844 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_1 Supporting invariants [] [2018-12-01 08:13:16,904 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-12-01 08:13:16,909 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-01 08:13:16,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:13:16,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:13:16,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 08:13:16,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-01 08:13:16,974 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:16,976 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:16,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-01 08:13:16,977 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:16,979 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:16,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:16,982 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-12-01 08:13:16,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:13:16,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 08:13:17,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 44 [2018-12-01 08:13:17,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2018-12-01 08:13:17,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:17,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 32 [2018-12-01 08:13:17,070 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-01 08:13:17,084 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 08:13:17,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-01 08:13:17,097 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:34, output treesize:56 [2018-12-01 08:13:17,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-12-01 08:13:17,164 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-12-01 08:13:17,164 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 7 states. [2018-12-01 08:13:17,248 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4. Second operand 7 states. Result 31 states and 38 transitions. Complement of second has 14 states. [2018-12-01 08:13:17,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-12-01 08:13:17,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-01 08:13:17,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2018-12-01 08:13:17,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 5 letters. Loop has 5 letters. [2018-12-01 08:13:17,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 08:13:17,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 10 letters. Loop has 5 letters. [2018-12-01 08:13:17,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 08:13:17,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 5 letters. Loop has 10 letters. [2018-12-01 08:13:17,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 08:13:17,252 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2018-12-01 08:13:17,253 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-01 08:13:17,253 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 27 states and 34 transitions. [2018-12-01 08:13:17,253 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-12-01 08:13:17,253 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-12-01 08:13:17,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 34 transitions. [2018-12-01 08:13:17,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 08:13:17,254 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2018-12-01 08:13:17,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 34 transitions. [2018-12-01 08:13:17,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 19. [2018-12-01 08:13:17,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-01 08:13:17,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2018-12-01 08:13:17,255 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-12-01 08:13:17,255 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-12-01 08:13:17,255 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-01 08:13:17,256 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2018-12-01 08:13:17,256 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-01 08:13:17,256 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 08:13:17,256 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 08:13:17,257 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-01 08:13:17,257 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-01 08:13:17,257 INFO L794 eck$LassoCheckResult]: Stem: 258#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 248#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet18;havoc main_#t~nondet18;main_~y~0 := main_#t~nondet19;havoc main_#t~nondet19;gcd_#in~x, gcd_#in~y := main_~x~0, main_~y~0;havoc gcd_#res;havoc gcd_#t~malloc2.base, gcd_#t~malloc2.offset, gcd_#t~malloc3.base, gcd_#t~malloc3.offset, gcd_#t~malloc4.base, gcd_#t~malloc4.offset, gcd_#t~mem5, gcd_#t~mem6, gcd_#t~mem7, gcd_#t~mem8, gcd_#t~mem10, gcd_#t~mem13, gcd_#t~mem14, gcd_#t~mem11, gcd_#t~mem12, gcd_#t~mem15, gcd_#t~mem16, gcd_#t~mem9, gcd_#t~mem17, gcd_~x, gcd_~y, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, gcd_~r~0.base, gcd_~r~0.offset;gcd_~x := gcd_#in~x;gcd_~y := gcd_#in~y;call gcd_#t~malloc2.base, gcd_#t~malloc2.offset := #Ultimate.alloc(4);gcd_~x_ref~0.base, gcd_~x_ref~0.offset := gcd_#t~malloc2.base, gcd_#t~malloc2.offset;call gcd_#t~malloc3.base, gcd_#t~malloc3.offset := #Ultimate.alloc(4);gcd_~y_ref~0.base, gcd_~y_ref~0.offset := gcd_#t~malloc3.base, gcd_#t~malloc3.offset;call gcd_#t~malloc4.base, gcd_#t~malloc4.offset := #Ultimate.alloc(4);gcd_~r~0.base, gcd_~r~0.offset := gcd_#t~malloc4.base, gcd_#t~malloc4.offset;call write~int(gcd_~x, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_~y, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call gcd_#t~mem5 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4); 249#L553 assume !(gcd_#t~mem5 < 0);havoc gcd_#t~mem5; 250#L553-2 call gcd_#t~mem7 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 259#L554 assume gcd_#t~mem7 < 0;havoc gcd_#t~mem7;call gcd_#t~mem8 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(-gcd_#t~mem8, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);havoc gcd_#t~mem8; 251#L555-2 [2018-12-01 08:13:17,257 INFO L796 eck$LassoCheckResult]: Loop: 251#L555-2 call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 252#L555 assume !!(gcd_#t~mem9 > 0);havoc gcd_#t~mem9;call gcd_#t~mem10 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_#t~mem10, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem10; 261#L557-3 call gcd_#t~mem11 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem12 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 266#L557-1 assume !(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem11;havoc gcd_#t~mem12; 256#L557-4 call gcd_#t~mem15 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem15, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);havoc gcd_#t~mem15;call gcd_#t~mem16 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call write~int(gcd_#t~mem16, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);havoc gcd_#t~mem16; 251#L555-2 [2018-12-01 08:13:17,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:13:17,257 INFO L82 PathProgramCache]: Analyzing trace with hash 28695751, now seen corresponding path program 1 times [2018-12-01 08:13:17,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:13:17,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:13:17,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:13:17,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:13:17,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:13:17,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:13:17,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:13:17,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:13:17,270 INFO L82 PathProgramCache]: Analyzing trace with hash 46919933, now seen corresponding path program 2 times [2018-12-01 08:13:17,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:13:17,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:13:17,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:13:17,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:13:17,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:13:17,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:13:17,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:13:17,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:13:17,279 INFO L82 PathProgramCache]: Analyzing trace with hash -2042683401, now seen corresponding path program 1 times [2018-12-01 08:13:17,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:13:17,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:13:17,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:13:17,280 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 08:13:17,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:13:17,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:13:17,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:13:17,514 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 95 [2018-12-01 08:13:17,571 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 08:13:17,571 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 08:13:17,571 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 08:13:17,571 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 08:13:17,572 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 08:13:17,572 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 08:13:17,572 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 08:13:17,572 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 08:13:17,572 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd1-alloca_true-termination.c.i_Iteration3_Lasso [2018-12-01 08:13:17,572 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 08:13:17,572 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 08:13:17,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:17,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:17,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:17,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:17,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:17,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:17,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:17,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:17,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:17,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:17,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:17,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:17,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:17,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:17,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:17,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:17,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:17,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:17,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:17,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:17,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:17,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:17,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:17,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:18,066 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 08:13:18,067 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 08:13:18,067 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:18,068 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:18,068 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:18,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:18,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:18,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:18,069 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:18,069 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:18,069 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:18,069 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:18,070 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:18,070 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:18,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:18,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:18,070 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:18,070 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:18,070 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:18,071 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:18,071 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:18,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:18,071 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:18,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:18,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:18,072 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:18,072 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:18,072 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:18,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:18,073 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:18,073 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:18,073 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:18,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:18,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:18,073 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:18,073 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:18,074 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:18,074 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:18,074 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:18,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:18,074 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:18,075 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:18,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:18,075 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:18,075 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:18,075 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:18,075 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:18,075 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:18,076 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:18,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:18,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:18,076 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:18,076 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:13:18,076 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:18,077 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:18,078 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:18,078 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:18,078 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:18,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:18,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:18,079 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:18,079 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:18,079 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:18,079 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:18,080 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:18,080 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:18,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:18,080 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:18,080 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:18,081 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:13:18,081 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:18,083 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:18,083 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:18,083 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:18,084 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:18,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:18,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:18,084 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:18,084 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:18,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:18,084 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:18,085 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:18,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:18,085 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:18,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:18,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:18,085 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:18,086 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:18,086 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:18,086 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:18,087 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:18,087 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:18,087 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:18,087 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:18,087 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:18,087 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:18,088 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:18,088 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:18,088 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:18,089 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:18,089 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:18,089 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:18,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:18,089 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:18,089 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:18,090 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:18,090 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:18,090 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:18,091 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:18,091 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:18,091 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:18,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:18,091 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:18,092 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:13:18,092 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:18,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:18,094 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:18,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:18,094 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:18,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:18,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:18,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:18,094 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:18,095 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:18,095 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:18,095 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:18,095 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:18,095 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:18,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:18,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:18,096 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:18,096 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:18,096 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:18,096 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:18,096 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:18,097 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:18,097 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 08:13:18,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:18,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:18,098 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 08:13:18,098 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:18,102 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:18,103 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:18,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:18,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:18,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:18,103 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:18,104 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:13:18,104 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:18,106 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:18,106 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:18,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:18,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:18,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:18,107 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:18,107 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:13:18,108 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:18,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:18,112 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:18,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:18,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:18,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:18,113 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:18,113 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:13:18,113 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:18,114 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:18,115 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:18,115 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:18,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:18,115 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:18,115 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:18,116 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:13:18,116 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:18,117 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:18,117 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:18,117 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:18,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:18,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:18,118 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:18,119 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:13:18,119 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:18,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:18,131 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:18,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:18,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:18,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:18,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:18,132 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:13:18,133 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:18,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:18,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:18,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:18,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:18,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:18,137 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:18,138 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:13:18,138 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:18,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:18,141 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:18,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:18,141 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 08:13:18,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:18,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:18,142 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 08:13:18,142 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:18,145 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:18,146 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:18,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:18,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:18,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:18,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:18,148 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:13:18,149 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:18,158 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 08:13:18,164 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-01 08:13:18,164 INFO L444 ModelExtractionUtils]: 24 out of 31 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-12-01 08:13:18,165 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 08:13:18,165 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 08:13:18,166 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 08:13:18,166 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_2 Supporting invariants [] [2018-12-01 08:13:18,235 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-12-01 08:13:18,237 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-01 08:13:18,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:13:18,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:13:18,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 08:13:18,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-01 08:13:18,266 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:18,267 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:18,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-01 08:13:18,268 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:18,271 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:18,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:18,274 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-12-01 08:13:18,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:13:18,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 08:13:18,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 44 [2018-12-01 08:13:18,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 36 [2018-12-01 08:13:18,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-01 08:13:18,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-12-01 08:13:18,378 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:18,389 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 08:13:18,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-01 08:13:18,399 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:34, output treesize:56 [2018-12-01 08:13:18,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 08:13:18,464 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-12-01 08:13:18,464 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 7 Second operand 7 states. [2018-12-01 08:13:18,530 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 7. Second operand 7 states. Result 40 states and 49 transitions. Complement of second has 14 states. [2018-12-01 08:13:18,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-12-01 08:13:18,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-01 08:13:18,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2018-12-01 08:13:18,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 5 letters. Loop has 5 letters. [2018-12-01 08:13:18,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 08:13:18,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 10 letters. Loop has 5 letters. [2018-12-01 08:13:18,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 08:13:18,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 5 letters. Loop has 10 letters. [2018-12-01 08:13:18,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 08:13:18,532 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 49 transitions. [2018-12-01 08:13:18,533 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-01 08:13:18,533 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 36 states and 45 transitions. [2018-12-01 08:13:18,533 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-12-01 08:13:18,533 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-12-01 08:13:18,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 45 transitions. [2018-12-01 08:13:18,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 08:13:18,534 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2018-12-01 08:13:18,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 45 transitions. [2018-12-01 08:13:18,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 19. [2018-12-01 08:13:18,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-01 08:13:18,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2018-12-01 08:13:18,535 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-12-01 08:13:18,535 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-12-01 08:13:18,535 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-01 08:13:18,535 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2018-12-01 08:13:18,535 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-01 08:13:18,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 08:13:18,535 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 08:13:18,535 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 08:13:18,536 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 08:13:18,536 INFO L794 eck$LassoCheckResult]: Stem: 486#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 476#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet18;havoc main_#t~nondet18;main_~y~0 := main_#t~nondet19;havoc main_#t~nondet19;gcd_#in~x, gcd_#in~y := main_~x~0, main_~y~0;havoc gcd_#res;havoc gcd_#t~malloc2.base, gcd_#t~malloc2.offset, gcd_#t~malloc3.base, gcd_#t~malloc3.offset, gcd_#t~malloc4.base, gcd_#t~malloc4.offset, gcd_#t~mem5, gcd_#t~mem6, gcd_#t~mem7, gcd_#t~mem8, gcd_#t~mem10, gcd_#t~mem13, gcd_#t~mem14, gcd_#t~mem11, gcd_#t~mem12, gcd_#t~mem15, gcd_#t~mem16, gcd_#t~mem9, gcd_#t~mem17, gcd_~x, gcd_~y, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, gcd_~r~0.base, gcd_~r~0.offset;gcd_~x := gcd_#in~x;gcd_~y := gcd_#in~y;call gcd_#t~malloc2.base, gcd_#t~malloc2.offset := #Ultimate.alloc(4);gcd_~x_ref~0.base, gcd_~x_ref~0.offset := gcd_#t~malloc2.base, gcd_#t~malloc2.offset;call gcd_#t~malloc3.base, gcd_#t~malloc3.offset := #Ultimate.alloc(4);gcd_~y_ref~0.base, gcd_~y_ref~0.offset := gcd_#t~malloc3.base, gcd_#t~malloc3.offset;call gcd_#t~malloc4.base, gcd_#t~malloc4.offset := #Ultimate.alloc(4);gcd_~r~0.base, gcd_~r~0.offset := gcd_#t~malloc4.base, gcd_#t~malloc4.offset;call write~int(gcd_~x, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_~y, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call gcd_#t~mem5 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4); 477#L553 assume !(gcd_#t~mem5 < 0);havoc gcd_#t~mem5; 485#L553-2 call gcd_#t~mem7 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 487#L554 assume !(gcd_#t~mem7 < 0);havoc gcd_#t~mem7; 493#L555-2 call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 484#L555 assume !!(gcd_#t~mem9 > 0);havoc gcd_#t~mem9;call gcd_#t~mem10 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_#t~mem10, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem10; 494#L557-3 call gcd_#t~mem11 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem12 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 488#L557-1 assume !!(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem11;havoc gcd_#t~mem12;call gcd_#t~mem13 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem14 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem13 - gcd_#t~mem14, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem14;havoc gcd_#t~mem13; 489#L557-3 [2018-12-01 08:13:18,536 INFO L796 eck$LassoCheckResult]: Loop: 489#L557-3 call gcd_#t~mem11 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem12 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 492#L557-1 assume !!(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem11;havoc gcd_#t~mem12;call gcd_#t~mem13 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem14 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem13 - gcd_#t~mem14, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem14;havoc gcd_#t~mem13; 489#L557-3 [2018-12-01 08:13:18,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:13:18,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1182880019, now seen corresponding path program 1 times [2018-12-01 08:13:18,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:13:18,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:13:18,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:13:18,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:13:18,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:13:18,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:13:18,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:13:18,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:13:18,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1894, now seen corresponding path program 1 times [2018-12-01 08:13:18,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:13:18,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:13:18,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:13:18,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:13:18,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:13:18,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:13:18,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:13:18,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:13:18,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1418634248, now seen corresponding path program 2 times [2018-12-01 08:13:18,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:13:18,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:13:18,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:13:18,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:13:18,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:13:18,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:13:18,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:13:18,868 WARN L180 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 111 [2018-12-01 08:13:18,942 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 08:13:18,942 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 08:13:18,942 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 08:13:18,942 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 08:13:18,942 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 08:13:18,942 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 08:13:18,942 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 08:13:18,942 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 08:13:18,942 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd1-alloca_true-termination.c.i_Iteration4_Lasso [2018-12-01 08:13:18,942 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 08:13:18,942 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 08:13:18,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:18,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:18,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:18,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:18,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:18,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:18,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:18,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:18,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:18,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:18,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:18,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:18,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:18,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:18,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:18,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:18,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:18,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:18,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:18,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:18,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:19,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-12-01 08:13:19,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-12-01 08:13:19,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-12-01 08:13:19,356 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 08:13:19,356 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 08:13:19,356 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:19,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:19,357 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:19,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:19,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:19,357 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:19,357 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:19,357 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:19,358 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:19,358 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:19,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:19,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:19,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:19,358 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:19,359 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:13:19,359 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:19,360 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:19,360 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:19,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:19,360 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:19,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:19,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:19,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:19,360 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:19,360 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:19,361 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:19,361 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:19,361 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:19,361 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:19,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:19,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:19,361 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:19,361 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:19,361 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:19,362 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:19,362 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:19,362 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:19,362 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:19,362 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:19,362 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:19,362 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:19,362 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:19,362 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:19,363 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:19,363 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:19,363 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:19,363 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:19,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:19,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:19,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:19,363 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:19,363 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:19,364 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:19,364 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:19,364 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:19,364 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:19,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:19,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:19,364 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:19,364 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:19,364 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:19,365 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:19,365 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:19,365 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:19,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:19,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:19,365 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:19,365 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:13:19,365 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:19,366 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:19,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-12-01 08:13:19,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:19,367 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:19,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:19,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:19,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:19,367 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:19,367 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:19,367 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:19,368 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:19,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:19,368 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:19,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:19,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:19,368 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:19,368 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:19,368 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:19,368 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:19,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-12-01 08:13:19,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:19,369 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:19,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:19,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:19,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:19,369 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:19,369 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:19,369 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:19,370 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:19,370 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:19,370 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:19,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:19,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:19,370 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:19,370 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:19,370 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:19,370 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:19,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-12-01 08:13:19,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:19,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:19,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:19,371 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:19,371 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:13:19,371 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:19,372 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:19,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-12-01 08:13:19,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:19,372 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:19,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:19,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:19,373 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:19,373 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:19,373 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:19,373 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:19,373 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:19,373 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:19,373 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:19,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:19,373 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:19,374 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:19,374 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:19,374 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:19,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:19,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-12-01 08:13:19,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:19,374 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:19,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:19,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:19,375 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:19,375 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:19,375 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:19,375 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:19,375 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:19,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:19,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:19,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:19,375 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:19,376 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:13:19,376 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:19,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:19,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-12-01 08:13:19,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:19,377 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:19,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:19,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:19,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:19,377 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:19,377 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:19,377 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:19,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-12-01 08:13:19,378 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:19,378 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:19,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:19,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:19,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:19,378 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:19,378 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:19,378 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:19,378 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:19,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:19,379 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:19,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:19,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:19,379 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:19,379 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:19,379 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:19,379 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:19,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-12-01 08:13:19,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:19,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:19,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:19,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:19,381 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:13:19,381 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:19,385 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:19,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-12-01 08:13:19,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:19,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:19,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:19,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:19,386 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:13:19,386 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:19,388 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:19,388 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:19,388 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:19,388 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 08:13:19,388 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:19,388 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:19,389 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 08:13:19,389 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:19,390 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:19,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-12-01 08:13:19,391 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:19,391 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 08:13:19,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:19,391 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:19,391 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 08:13:19,391 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:19,392 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:19,393 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:19,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:19,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:19,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:19,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:19,393 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:13:19,393 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:19,394 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:19,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-12-01 08:13:19,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:19,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:19,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:19,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:19,395 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:13:19,395 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:19,395 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:19,396 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:19,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:19,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:19,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:19,396 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:19,397 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:13:19,397 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:19,401 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 08:13:19,405 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-01 08:13:19,405 INFO L444 ModelExtractionUtils]: 25 out of 31 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-01 08:13:19,405 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 08:13:19,406 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-12-01 08:13:19,406 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 08:13:19,406 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_3, v_rep(select (select #memory_int ULTIMATE.start_gcd_~r~0.base) ULTIMATE.start_gcd_~r~0.offset)_3) = -2*v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_3 + 2*v_rep(select (select #memory_int ULTIMATE.start_gcd_~r~0.base) ULTIMATE.start_gcd_~r~0.offset)_3 + 1 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_3 - 1 >= 0] [2018-12-01 08:13:19,449 INFO L297 tatePredicateManager]: 17 out of 21 supporting invariants were superfluous and have been removed [2018-12-01 08:13:19,455 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-01 08:13:19,455 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-01 08:13:19,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:13:19,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:13:19,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 08:13:19,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-01 08:13:19,496 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:19,497 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:19,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-01 08:13:19,498 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:19,504 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:19,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-12-01 08:13:19,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-01 08:13:19,516 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:19,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-12-01 08:13:19,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 20 treesize of output 19 [2018-12-01 08:13:19,534 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:19,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2018-12-01 08:13:19,552 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-12-01 08:13:19,560 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 08:13:19,567 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-01 08:13:19,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-01 08:13:19,578 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:46, output treesize:31 [2018-12-01 08:13:19,613 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:19,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 23 treesize of output 49 [2018-12-01 08:13:19,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2018-12-01 08:13:19,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:19,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-12-01 08:13:19,661 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:19,669 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:19,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-01 08:13:19,675 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:34, output treesize:30 [2018-12-01 08:13:19,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:13:19,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 08:13:19,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 08:13:19,701 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2018-12-01 08:13:19,701 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 7 Second operand 6 states. [2018-12-01 08:13:19,745 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 7. Second operand 6 states. Result 25 states and 32 transitions. Complement of second has 10 states. [2018-12-01 08:13:19,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-01 08:13:19,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-01 08:13:19,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2018-12-01 08:13:19,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 9 letters. Loop has 2 letters. [2018-12-01 08:13:19,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 08:13:19,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 11 letters. Loop has 2 letters. [2018-12-01 08:13:19,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 08:13:19,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 9 letters. Loop has 4 letters. [2018-12-01 08:13:19,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 08:13:19,747 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 32 transitions. [2018-12-01 08:13:19,747 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-01 08:13:19,748 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 24 states and 31 transitions. [2018-12-01 08:13:19,748 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-12-01 08:13:19,748 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-01 08:13:19,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 31 transitions. [2018-12-01 08:13:19,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 08:13:19,748 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2018-12-01 08:13:19,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 31 transitions. [2018-12-01 08:13:19,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-12-01 08:13:19,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-01 08:13:19,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2018-12-01 08:13:19,749 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2018-12-01 08:13:19,749 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2018-12-01 08:13:19,750 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-01 08:13:19,750 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2018-12-01 08:13:19,750 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-01 08:13:19,750 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 08:13:19,750 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 08:13:19,750 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 08:13:19,750 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-01 08:13:19,750 INFO L794 eck$LassoCheckResult]: Stem: 684#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 674#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet18;havoc main_#t~nondet18;main_~y~0 := main_#t~nondet19;havoc main_#t~nondet19;gcd_#in~x, gcd_#in~y := main_~x~0, main_~y~0;havoc gcd_#res;havoc gcd_#t~malloc2.base, gcd_#t~malloc2.offset, gcd_#t~malloc3.base, gcd_#t~malloc3.offset, gcd_#t~malloc4.base, gcd_#t~malloc4.offset, gcd_#t~mem5, gcd_#t~mem6, gcd_#t~mem7, gcd_#t~mem8, gcd_#t~mem10, gcd_#t~mem13, gcd_#t~mem14, gcd_#t~mem11, gcd_#t~mem12, gcd_#t~mem15, gcd_#t~mem16, gcd_#t~mem9, gcd_#t~mem17, gcd_~x, gcd_~y, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, gcd_~r~0.base, gcd_~r~0.offset;gcd_~x := gcd_#in~x;gcd_~y := gcd_#in~y;call gcd_#t~malloc2.base, gcd_#t~malloc2.offset := #Ultimate.alloc(4);gcd_~x_ref~0.base, gcd_~x_ref~0.offset := gcd_#t~malloc2.base, gcd_#t~malloc2.offset;call gcd_#t~malloc3.base, gcd_#t~malloc3.offset := #Ultimate.alloc(4);gcd_~y_ref~0.base, gcd_~y_ref~0.offset := gcd_#t~malloc3.base, gcd_#t~malloc3.offset;call gcd_#t~malloc4.base, gcd_#t~malloc4.offset := #Ultimate.alloc(4);gcd_~r~0.base, gcd_~r~0.offset := gcd_#t~malloc4.base, gcd_#t~malloc4.offset;call write~int(gcd_~x, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_~y, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call gcd_#t~mem5 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4); 675#L553 assume !(gcd_#t~mem5 < 0);havoc gcd_#t~mem5; 683#L553-2 call gcd_#t~mem7 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 685#L554 assume !(gcd_#t~mem7 < 0);havoc gcd_#t~mem7; 693#L555-2 call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 682#L555 assume !!(gcd_#t~mem9 > 0);havoc gcd_#t~mem9;call gcd_#t~mem10 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_#t~mem10, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem10; 689#L557-3 call gcd_#t~mem11 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem12 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 696#L557-1 assume !!(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem11;havoc gcd_#t~mem12;call gcd_#t~mem13 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem14 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem13 - gcd_#t~mem14, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem14;havoc gcd_#t~mem13; 695#L557-3 call gcd_#t~mem11 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem12 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 686#L557-1 assume !(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem11;havoc gcd_#t~mem12; 676#L557-4 [2018-12-01 08:13:19,751 INFO L796 eck$LassoCheckResult]: Loop: 676#L557-4 call gcd_#t~mem15 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem15, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);havoc gcd_#t~mem15;call gcd_#t~mem16 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call write~int(gcd_#t~mem16, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);havoc gcd_#t~mem16; 677#L555-2 call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 680#L555 assume !!(gcd_#t~mem9 > 0);havoc gcd_#t~mem9;call gcd_#t~mem10 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_#t~mem10, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem10; 691#L557-3 call gcd_#t~mem11 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem12 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 692#L557-1 assume !(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem11;havoc gcd_#t~mem12; 676#L557-4 [2018-12-01 08:13:19,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:13:19,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1418634250, now seen corresponding path program 1 times [2018-12-01 08:13:19,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:13:19,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:13:19,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:13:19,751 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 08:13:19,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:13:19,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:13:19,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:13:19,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:13:19,763 INFO L82 PathProgramCache]: Analyzing trace with hash 64312973, now seen corresponding path program 3 times [2018-12-01 08:13:19,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:13:19,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:13:19,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:13:19,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:13:19,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:13:19,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:13:19,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:13:19,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:13:19,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1038603336, now seen corresponding path program 1 times [2018-12-01 08:13:19,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:13:19,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:13:19,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:13:19,770 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 08:13:19,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:13:19,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:13:19,951 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-01 08:13:19,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 08:13:19,951 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cb4fffb3-f1f1-4f62-9d11-0cd8c2085826/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 08:13:19,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:13:19,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:13:19,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 08:13:20,004 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:20,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-12-01 08:13:20,014 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:20,015 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:20,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-01 08:13:20,015 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:20,018 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:20,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:20,021 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2018-12-01 08:13:20,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2018-12-01 08:13:20,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-12-01 08:13:20,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:20,039 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:20,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:20,041 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:13 [2018-12-01 08:13:20,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 53 [2018-12-01 08:13:20,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-01 08:13:20,101 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:20,111 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:20,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 55 [2018-12-01 08:13:20,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-12-01 08:13:20,115 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:20,123 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:20,126 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:20,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:20,131 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:77, output treesize:37 [2018-12-01 08:13:20,152 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:20,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 55 [2018-12-01 08:13:20,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-12-01 08:13:20,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:20,160 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:20,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-01 08:13:20,165 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:37 [2018-12-01 08:13:20,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 39 [2018-12-01 08:13:20,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-01 08:13:20,191 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:20,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-01 08:13:20,198 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:20,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-12-01 08:13:20,203 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:20,204 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:20,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:20,208 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:51, output treesize:5 [2018-12-01 08:13:20,217 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-01 08:13:20,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 08:13:20,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2018-12-01 08:13:20,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-01 08:13:20,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-12-01 08:13:20,290 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. cyclomatic complexity: 10 Second operand 15 states. [2018-12-01 08:13:20,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 08:13:20,573 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2018-12-01 08:13:20,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-01 08:13:20,574 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 44 transitions. [2018-12-01 08:13:20,575 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-01 08:13:20,575 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 33 states and 41 transitions. [2018-12-01 08:13:20,575 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-12-01 08:13:20,575 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-12-01 08:13:20,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 41 transitions. [2018-12-01 08:13:20,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 08:13:20,575 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2018-12-01 08:13:20,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 41 transitions. [2018-12-01 08:13:20,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2018-12-01 08:13:20,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-01 08:13:20,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2018-12-01 08:13:20,577 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2018-12-01 08:13:20,577 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2018-12-01 08:13:20,577 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-01 08:13:20,577 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2018-12-01 08:13:20,577 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-01 08:13:20,577 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 08:13:20,577 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 08:13:20,577 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 08:13:20,578 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2018-12-01 08:13:20,578 INFO L794 eck$LassoCheckResult]: Stem: 819#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 812#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet18;havoc main_#t~nondet18;main_~y~0 := main_#t~nondet19;havoc main_#t~nondet19;gcd_#in~x, gcd_#in~y := main_~x~0, main_~y~0;havoc gcd_#res;havoc gcd_#t~malloc2.base, gcd_#t~malloc2.offset, gcd_#t~malloc3.base, gcd_#t~malloc3.offset, gcd_#t~malloc4.base, gcd_#t~malloc4.offset, gcd_#t~mem5, gcd_#t~mem6, gcd_#t~mem7, gcd_#t~mem8, gcd_#t~mem10, gcd_#t~mem13, gcd_#t~mem14, gcd_#t~mem11, gcd_#t~mem12, gcd_#t~mem15, gcd_#t~mem16, gcd_#t~mem9, gcd_#t~mem17, gcd_~x, gcd_~y, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, gcd_~r~0.base, gcd_~r~0.offset;gcd_~x := gcd_#in~x;gcd_~y := gcd_#in~y;call gcd_#t~malloc2.base, gcd_#t~malloc2.offset := #Ultimate.alloc(4);gcd_~x_ref~0.base, gcd_~x_ref~0.offset := gcd_#t~malloc2.base, gcd_#t~malloc2.offset;call gcd_#t~malloc3.base, gcd_#t~malloc3.offset := #Ultimate.alloc(4);gcd_~y_ref~0.base, gcd_~y_ref~0.offset := gcd_#t~malloc3.base, gcd_#t~malloc3.offset;call gcd_#t~malloc4.base, gcd_#t~malloc4.offset := #Ultimate.alloc(4);gcd_~r~0.base, gcd_~r~0.offset := gcd_#t~malloc4.base, gcd_#t~malloc4.offset;call write~int(gcd_~x, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_~y, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call gcd_#t~mem5 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4); 813#L553 assume !(gcd_#t~mem5 < 0);havoc gcd_#t~mem5; 818#L553-2 call gcd_#t~mem7 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 820#L554 assume !(gcd_#t~mem7 < 0);havoc gcd_#t~mem7; 828#L555-2 call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 832#L555 assume !!(gcd_#t~mem9 > 0);havoc gcd_#t~mem9;call gcd_#t~mem10 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_#t~mem10, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem10; 831#L557-3 call gcd_#t~mem11 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem12 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 830#L557-1 assume !!(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem11;havoc gcd_#t~mem12;call gcd_#t~mem13 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem14 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem13 - gcd_#t~mem14, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem14;havoc gcd_#t~mem13; 829#L557-3 call gcd_#t~mem11 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem12 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 827#L557-1 assume !(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem11;havoc gcd_#t~mem12; 834#L557-4 [2018-12-01 08:13:20,578 INFO L796 eck$LassoCheckResult]: Loop: 834#L557-4 call gcd_#t~mem15 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem15, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);havoc gcd_#t~mem15;call gcd_#t~mem16 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call write~int(gcd_#t~mem16, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);havoc gcd_#t~mem16; 816#L555-2 call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 817#L555 assume !!(gcd_#t~mem9 > 0);havoc gcd_#t~mem9;call gcd_#t~mem10 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_#t~mem10, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem10; 825#L557-3 call gcd_#t~mem11 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem12 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 821#L557-1 assume !!(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem11;havoc gcd_#t~mem12;call gcd_#t~mem13 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem14 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem13 - gcd_#t~mem14, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem14;havoc gcd_#t~mem13; 822#L557-3 call gcd_#t~mem11 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem12 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 826#L557-1 assume !(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem11;havoc gcd_#t~mem12; 834#L557-4 [2018-12-01 08:13:20,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:13:20,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1418634250, now seen corresponding path program 2 times [2018-12-01 08:13:20,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:13:20,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:13:20,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:13:20,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:13:20,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:13:20,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:13:20,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:13:20,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:13:20,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1675227762, now seen corresponding path program 1 times [2018-12-01 08:13:20,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:13:20,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:13:20,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:13:20,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 08:13:20,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:13:20,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:13:20,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:13:20,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:13:20,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1665390371, now seen corresponding path program 2 times [2018-12-01 08:13:20,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:13:20,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:13:20,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:13:20,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:13:20,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:13:20,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:13:20,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:13:20,764 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 80 [2018-12-01 08:13:21,078 WARN L180 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 126 [2018-12-01 08:13:21,160 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 08:13:21,160 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 08:13:21,160 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 08:13:21,160 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 08:13:21,160 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 08:13:21,160 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 08:13:21,160 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 08:13:21,160 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 08:13:21,160 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd1-alloca_true-termination.c.i_Iteration6_Lasso [2018-12-01 08:13:21,161 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 08:13:21,161 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 08:13:21,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:21,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:21,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:21,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:21,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:21,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:21,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:21,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:21,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:21,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:21,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:21,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:21,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:21,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:21,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:21,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:21,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:21,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:21,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:21,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:21,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:21,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:21,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:21,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:21,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:21,638 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 08:13:21,638 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 08:13:21,638 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:21,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:21,638 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:21,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:21,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:21,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:21,639 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:21,639 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:21,639 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:21,639 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:21,639 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:21,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:21,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:21,640 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:21,640 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:13:21,640 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:21,640 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:21,641 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:21,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:21,641 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:21,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:21,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:21,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:21,641 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:21,641 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:21,641 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:21,642 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:21,642 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:21,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:21,642 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:21,642 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:21,642 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:13:21,642 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:21,644 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:21,644 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:21,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:21,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:21,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:21,644 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:21,645 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:13:21,645 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:21,646 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:21,646 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:21,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:21,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:21,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:21,647 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:21,648 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:13:21,648 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:21,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:21,652 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:21,652 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:21,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:21,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:21,652 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:21,653 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:13:21,653 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:21,653 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:21,654 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:21,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:21,654 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 08:13:21,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:21,654 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:21,654 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 08:13:21,654 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:21,656 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:21,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:21,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:21,656 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 08:13:21,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:21,656 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:21,657 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 08:13:21,657 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:21,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:21,658 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:21,658 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:21,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:21,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:21,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:21,659 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:13:21,659 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:21,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:21,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:21,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:21,661 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 08:13:21,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:21,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:21,661 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 08:13:21,662 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:21,663 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:21,663 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:21,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:21,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:21,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:21,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:21,664 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:13:21,664 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:21,673 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 08:13:21,682 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-01 08:13:21,683 INFO L444 ModelExtractionUtils]: 25 out of 31 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-01 08:13:21,683 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 08:13:21,683 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 08:13:21,683 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 08:13:21,683 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_gcd_~r~0.base) ULTIMATE.start_gcd_~r~0.offset)_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_gcd_~r~0.base) ULTIMATE.start_gcd_~r~0.offset)_4 Supporting invariants [] [2018-12-01 08:13:21,736 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-12-01 08:13:21,738 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-01 08:13:21,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:13:21,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:13:21,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 08:13:21,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-01 08:13:21,782 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:21,782 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:21,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-01 08:13:21,783 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:21,785 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:21,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:21,788 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-12-01 08:13:21,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:13:21,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 08:13:21,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 54 [2018-12-01 08:13:21,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 42 [2018-12-01 08:13:21,830 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:21,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 40 [2018-12-01 08:13:21,860 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:21,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 62 [2018-12-01 08:13:21,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 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 44 [2018-12-01 08:13:21,916 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-01 08:13:21,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 37 [2018-12-01 08:13:21,982 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:22,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 54 [2018-12-01 08:13:22,027 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-12-01 08:13:22,088 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-01 08:13:22,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 61 [2018-12-01 08:13:22,146 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-01 08:13:22,146 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:22,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2018-12-01 08:13:22,200 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:22,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 36 [2018-12-01 08:13:22,242 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-12-01 08:13:22,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 33 [2018-12-01 08:13:22,275 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-12-01 08:13:22,292 INFO L267 ElimStorePlain]: Start of recursive call 9: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-01 08:13:22,325 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-01 08:13:22,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-01 08:13:22,340 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 1 variables, input treesize:63, output treesize:95 [2018-12-01 08:13:22,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2018-12-01 08:13:22,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 37 [2018-12-01 08:13:22,400 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:22,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:22,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 59 treesize of output 57 [2018-12-01 08:13:22,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 67 [2018-12-01 08:13:22,463 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-01 08:13:22,486 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 08:13:22,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 42 [2018-12-01 08:13:22,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2018-12-01 08:13:22,535 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:22,539 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:22,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-12-01 08:13:22,571 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:161, output treesize:191 [2018-12-01 08:13:22,625 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:22,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 71 [2018-12-01 08:13:22,636 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:22,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 70 [2018-12-01 08:13:22,636 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:22,662 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:22,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 64 [2018-12-01 08:13:22,671 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-12-01 08:13:22,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-01 08:13:22,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-12-01 08:13:22,713 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:53, output treesize:118 [2018-12-01 08:13:22,808 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 08:13:22,808 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2018-12-01 08:13:22,808 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 8 Second operand 8 states. [2018-12-01 08:13:23,035 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 55 states and 65 transitions. Complement of second has 14 states. [2018-12-01 08:13:23,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-12-01 08:13:23,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-01 08:13:23,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 19 transitions. [2018-12-01 08:13:23,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 19 transitions. Stem has 11 letters. Loop has 7 letters. [2018-12-01 08:13:23,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 08:13:23,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 19 transitions. Stem has 18 letters. Loop has 7 letters. [2018-12-01 08:13:23,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 08:13:23,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 19 transitions. Stem has 11 letters. Loop has 14 letters. [2018-12-01 08:13:23,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 08:13:23,037 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 65 transitions. [2018-12-01 08:13:23,038 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-01 08:13:23,039 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 53 states and 63 transitions. [2018-12-01 08:13:23,039 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2018-12-01 08:13:23,039 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2018-12-01 08:13:23,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 63 transitions. [2018-12-01 08:13:23,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 08:13:23,040 INFO L705 BuchiCegarLoop]: Abstraction has 53 states and 63 transitions. [2018-12-01 08:13:23,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 63 transitions. [2018-12-01 08:13:23,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2018-12-01 08:13:23,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-01 08:13:23,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2018-12-01 08:13:23,043 INFO L728 BuchiCegarLoop]: Abstraction has 44 states and 54 transitions. [2018-12-01 08:13:23,043 INFO L608 BuchiCegarLoop]: Abstraction has 44 states and 54 transitions. [2018-12-01 08:13:23,043 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-01 08:13:23,043 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 54 transitions. [2018-12-01 08:13:23,044 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-01 08:13:23,044 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 08:13:23,044 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 08:13:23,044 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 08:13:23,044 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2018-12-01 08:13:23,044 INFO L794 eck$LassoCheckResult]: Stem: 1097#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1087#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet18;havoc main_#t~nondet18;main_~y~0 := main_#t~nondet19;havoc main_#t~nondet19;gcd_#in~x, gcd_#in~y := main_~x~0, main_~y~0;havoc gcd_#res;havoc gcd_#t~malloc2.base, gcd_#t~malloc2.offset, gcd_#t~malloc3.base, gcd_#t~malloc3.offset, gcd_#t~malloc4.base, gcd_#t~malloc4.offset, gcd_#t~mem5, gcd_#t~mem6, gcd_#t~mem7, gcd_#t~mem8, gcd_#t~mem10, gcd_#t~mem13, gcd_#t~mem14, gcd_#t~mem11, gcd_#t~mem12, gcd_#t~mem15, gcd_#t~mem16, gcd_#t~mem9, gcd_#t~mem17, gcd_~x, gcd_~y, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, gcd_~r~0.base, gcd_~r~0.offset;gcd_~x := gcd_#in~x;gcd_~y := gcd_#in~y;call gcd_#t~malloc2.base, gcd_#t~malloc2.offset := #Ultimate.alloc(4);gcd_~x_ref~0.base, gcd_~x_ref~0.offset := gcd_#t~malloc2.base, gcd_#t~malloc2.offset;call gcd_#t~malloc3.base, gcd_#t~malloc3.offset := #Ultimate.alloc(4);gcd_~y_ref~0.base, gcd_~y_ref~0.offset := gcd_#t~malloc3.base, gcd_#t~malloc3.offset;call gcd_#t~malloc4.base, gcd_#t~malloc4.offset := #Ultimate.alloc(4);gcd_~r~0.base, gcd_~r~0.offset := gcd_#t~malloc4.base, gcd_#t~malloc4.offset;call write~int(gcd_~x, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_~y, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call gcd_#t~mem5 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4); 1088#L553 assume !(gcd_#t~mem5 < 0);havoc gcd_#t~mem5; 1096#L553-2 call gcd_#t~mem7 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 1098#L554 assume !(gcd_#t~mem7 < 0);havoc gcd_#t~mem7; 1107#L555-2 call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 1129#L555 assume !!(gcd_#t~mem9 > 0);havoc gcd_#t~mem9;call gcd_#t~mem10 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_#t~mem10, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem10; 1128#L557-3 call gcd_#t~mem11 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem12 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 1126#L557-1 assume !!(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem11;havoc gcd_#t~mem12;call gcd_#t~mem13 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem14 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem13 - gcd_#t~mem14, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem14;havoc gcd_#t~mem13; 1124#L557-3 call gcd_#t~mem11 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem12 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 1123#L557-1 assume !(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem11;havoc gcd_#t~mem12; 1109#L557-4 call gcd_#t~mem15 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem15, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);havoc gcd_#t~mem15;call gcd_#t~mem16 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call write~int(gcd_#t~mem16, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);havoc gcd_#t~mem16; 1093#L555-2 call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 1094#L555 assume !!(gcd_#t~mem9 > 0);havoc gcd_#t~mem9;call gcd_#t~mem10 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_#t~mem10, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem10; 1130#L557-3 call gcd_#t~mem11 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem12 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 1099#L557-1 assume !!(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem11;havoc gcd_#t~mem12;call gcd_#t~mem13 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem14 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem13 - gcd_#t~mem14, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem14;havoc gcd_#t~mem13; 1100#L557-3 [2018-12-01 08:13:23,044 INFO L796 eck$LassoCheckResult]: Loop: 1100#L557-3 call gcd_#t~mem11 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem12 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 1105#L557-1 assume !!(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem11;havoc gcd_#t~mem12;call gcd_#t~mem13 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem14 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem13 - gcd_#t~mem14, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem14;havoc gcd_#t~mem13; 1116#L557-3 call gcd_#t~mem11 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem12 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 1117#L557-1 assume !(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem11;havoc gcd_#t~mem12; 1089#L557-4 call gcd_#t~mem15 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem15, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);havoc gcd_#t~mem15;call gcd_#t~mem16 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call write~int(gcd_#t~mem16, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);havoc gcd_#t~mem16; 1090#L555-2 call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 1103#L555 assume !!(gcd_#t~mem9 > 0);havoc gcd_#t~mem9;call gcd_#t~mem10 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_#t~mem10, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem10; 1100#L557-3 [2018-12-01 08:13:23,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:13:23,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1038603334, now seen corresponding path program 3 times [2018-12-01 08:13:23,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:13:23,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:13:23,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:13:23,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 08:13:23,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:13:23,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:13:23,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:13:23,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:13:23,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1583190302, now seen corresponding path program 2 times [2018-12-01 08:13:23,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:13:23,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:13:23,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:13:23,074 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 08:13:23,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:13:23,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:13:23,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:13:23,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:13:23,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1194503927, now seen corresponding path program 4 times [2018-12-01 08:13:23,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:13:23,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:13:23,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:13:23,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 08:13:23,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:13:23,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:13:23,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:13:24,118 WARN L180 SmtUtils]: Spent 899.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 155 [2018-12-01 08:13:24,286 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-12-01 08:13:24,289 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 08:13:24,289 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 08:13:24,289 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 08:13:24,289 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 08:13:24,289 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 08:13:24,289 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 08:13:24,289 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 08:13:24,289 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 08:13:24,289 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd1-alloca_true-termination.c.i_Iteration7_Lasso [2018-12-01 08:13:24,289 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 08:13:24,290 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 08:13:24,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-12-01 08:13:24,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-12-01 08:13:24,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-12-01 08:13:24,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:24,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:24,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-12-01 08:13:24,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:24,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-12-01 08:13:24,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-12-01 08:13:24,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-12-01 08:13:24,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:24,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-12-01 08:13:24,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-12-01 08:13:24,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-12-01 08:13:24,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:24,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:24,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:24,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:24,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:24,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:24,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:24,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:24,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:24,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:24,531 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2018-12-01 08:13:24,832 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 08:13:24,832 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 08:13:24,833 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:24,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:24,833 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:24,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:24,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:24,833 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:24,833 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:24,833 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:24,834 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:24,834 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:24,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:24,834 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:24,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:24,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:24,834 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:24,834 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:24,834 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:24,835 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:24,835 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:24,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:24,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:24,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:24,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:24,835 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:13:24,836 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:24,836 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:24,836 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:24,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:24,837 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:24,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:24,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:24,837 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:24,837 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:24,837 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:24,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:24,837 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:24,837 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:24,837 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:24,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:24,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:24,838 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:24,838 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:24,838 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:24,838 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:24,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:24,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:24,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:24,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:24,838 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:24,839 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:13:24,839 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:24,839 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:24,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-12-01 08:13:24,840 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:24,840 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:24,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:24,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:24,840 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:24,840 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:24,840 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:24,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:24,841 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:24,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:24,841 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:24,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:24,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:24,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:24,841 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:24,841 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:24,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:24,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-12-01 08:13:24,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:24,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:24,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:24,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:24,842 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:24,842 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:24,842 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:24,842 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:24,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-12-01 08:13:24,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:24,843 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:24,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:24,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:24,843 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:24,843 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:24,843 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:24,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:24,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-12-01 08:13:24,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:24,844 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:24,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:24,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:24,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:24,844 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:24,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:24,844 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:24,844 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:24,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:24,844 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:24,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:24,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:24,845 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:24,845 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:24,845 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:24,845 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:24,845 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:24,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:24,845 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:24,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:24,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:24,846 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:24,846 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:24,846 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:24,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:24,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-12-01 08:13:24,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:24,846 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:24,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:24,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:24,846 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:24,846 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:24,846 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:24,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:24,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-12-01 08:13:24,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:24,847 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:24,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:24,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:24,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:24,847 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:24,847 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:24,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:24,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:24,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:24,848 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:24,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:24,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:24,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:24,848 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:24,848 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:24,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:24,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:24,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:24,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:24,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:24,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:24,849 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:13:24,849 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:24,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:24,850 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:24,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:24,850 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:24,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:24,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:24,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:24,850 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:24,850 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:24,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:24,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-12-01 08:13:24,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:24,851 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:24,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:24,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:24,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:24,851 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:24,851 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:24,851 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:24,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-12-01 08:13:24,852 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:24,852 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:24,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:24,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:24,852 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:24,852 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:24,852 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:24,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:24,852 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:24,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:24,853 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:24,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:24,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:24,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:24,853 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:24,853 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:24,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:24,854 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:24,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:24,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:24,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:24,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:24,855 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:13:24,855 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:24,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:24,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-12-01 08:13:24,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:24,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:24,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:24,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:24,856 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:13:24,856 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:24,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:24,857 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:24,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:24,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:24,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:24,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:24,858 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:13:24,858 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:24,866 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 08:13:24,877 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-01 08:13:24,877 INFO L444 ModelExtractionUtils]: 24 out of 31 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-12-01 08:13:24,877 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 08:13:24,878 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 08:13:24,878 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 08:13:24,878 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_gcd_~r~0.base) ULTIMATE.start_gcd_~r~0.offset)_5) = 1*v_rep(select (select #memory_int ULTIMATE.start_gcd_~r~0.base) ULTIMATE.start_gcd_~r~0.offset)_5 Supporting invariants [] [2018-12-01 08:13:24,953 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-12-01 08:13:24,954 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-01 08:13:24,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:13:24,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:13:24,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 08:13:24,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-01 08:13:25,000 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:25,001 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:25,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-01 08:13:25,001 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:25,004 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:25,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:25,006 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-12-01 08:13:25,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:13:25,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 08:13:25,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 39 [2018-12-01 08:13:25,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 37 [2018-12-01 08:13:25,039 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-12-01 08:13:25,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-12-01 08:13:25,063 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:25,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-01 08:13:25,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-01 08:13:25,088 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:35, output treesize:66 [2018-12-01 08:13:25,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 66 treesize of output 69 [2018-12-01 08:13:25,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 61 [2018-12-01 08:13:25,197 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:25,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 51 [2018-12-01 08:13:25,236 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:25,273 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:25,274 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:25,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 92 [2018-12-01 08:13:25,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 63 [2018-12-01 08:13:25,300 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-01 08:13:25,418 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:25,420 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:25,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 74 [2018-12-01 08:13:25,426 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-12-01 08:13:25,497 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:25,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 56 [2018-12-01 08:13:25,498 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:25,576 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-12-01 08:13:25,688 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:25,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 82 [2018-12-01 08:13:25,707 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-01 08:13:25,707 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:25,788 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:25,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 58 [2018-12-01 08:13:25,789 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:25,846 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:25,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 55 [2018-12-01 08:13:25,852 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-12-01 08:13:25,895 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:25,897 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:25,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, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 57 [2018-12-01 08:13:25,897 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:25,922 INFO L267 ElimStorePlain]: Start of recursive call 9: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-01 08:13:25,963 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-01 08:13:25,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-01 08:13:25,990 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 1 variables, input treesize:82, output treesize:129 [2018-12-01 08:13:26,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 08:13:26,067 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2018-12-01 08:13:26,068 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44 states and 54 transitions. cyclomatic complexity: 14 Second operand 9 states. [2018-12-01 08:13:26,294 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2018-12-01 08:13:26,298 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 44 states and 54 transitions. cyclomatic complexity: 14. Second operand 9 states. Result 123 states and 144 transitions. Complement of second has 16 states. [2018-12-01 08:13:26,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2018-12-01 08:13:26,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-01 08:13:26,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2018-12-01 08:13:26,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 23 transitions. Stem has 16 letters. Loop has 7 letters. [2018-12-01 08:13:26,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 08:13:26,299 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 08:13:26,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:13:26,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:13:26,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 08:13:26,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-01 08:13:26,338 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:26,339 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:26,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-01 08:13:26,339 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:26,342 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:26,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:26,344 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-12-01 08:13:26,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:13:26,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 08:13:26,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 39 [2018-12-01 08:13:26,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-12-01 08:13:26,367 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:26,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 37 [2018-12-01 08:13:26,389 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-12-01 08:13:26,403 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-01 08:13:26,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-01 08:13:26,415 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:35, output treesize:66 [2018-12-01 08:13:26,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 66 treesize of output 69 [2018-12-01 08:13:26,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 61 [2018-12-01 08:13:26,525 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:26,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 51 [2018-12-01 08:13:26,571 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:26,603 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:26,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 59 [2018-12-01 08:13:26,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 52 [2018-12-01 08:13:26,614 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-01 08:13:26,626 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 08:13:26,663 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:26,665 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:26,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 92 [2018-12-01 08:13:26,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 72 [2018-12-01 08:13:26,686 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:26,764 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:26,766 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:26,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 74 [2018-12-01 08:13:26,772 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-12-01 08:13:26,835 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:26,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 55 [2018-12-01 08:13:26,841 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-12-01 08:13:26,917 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-12-01 08:13:26,979 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:26,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 82 [2018-12-01 08:13:27,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 63 [2018-12-01 08:13:27,014 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-12-01 08:13:27,105 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:27,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2018-12-01 08:13:27,106 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:27,179 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:27,180 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:27,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 57 [2018-12-01 08:13:27,180 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:27,204 INFO L267 ElimStorePlain]: Start of recursive call 11: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-01 08:13:27,235 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-01 08:13:27,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-01 08:13:27,253 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 1 variables, input treesize:82, output treesize:129 [2018-12-01 08:13:27,321 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 08:13:27,322 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 6 loop predicates [2018-12-01 08:13:27,322 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44 states and 54 transitions. cyclomatic complexity: 14 Second operand 9 states. [2018-12-01 08:13:27,532 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 44 states and 54 transitions. cyclomatic complexity: 14. Second operand 9 states. Result 123 states and 144 transitions. Complement of second has 16 states. [2018-12-01 08:13:27,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2018-12-01 08:13:27,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-01 08:13:27,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2018-12-01 08:13:27,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 23 transitions. Stem has 16 letters. Loop has 7 letters. [2018-12-01 08:13:27,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 08:13:27,533 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 08:13:27,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:13:27,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:13:27,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 08:13:27,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-01 08:13:27,566 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:27,567 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:27,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-01 08:13:27,567 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:27,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:27,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:27,572 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-12-01 08:13:27,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:13:27,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 08:13:27,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 39 [2018-12-01 08:13:27,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 37 [2018-12-01 08:13:27,603 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-12-01 08:13:27,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-12-01 08:13:27,623 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:27,635 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-01 08:13:27,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-01 08:13:27,647 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:35, output treesize:66 [2018-12-01 08:13:27,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 66 treesize of output 69 [2018-12-01 08:13:27,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 61 [2018-12-01 08:13:27,750 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:27,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 51 [2018-12-01 08:13:27,789 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:27,834 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:27,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 71 [2018-12-01 08:13:27,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2018-12-01 08:13:27,848 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:27,878 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:27,879 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:27,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 57 [2018-12-01 08:13:27,879 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:27,894 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 08:13:27,939 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:27,941 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:27,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 92 [2018-12-01 08:13:27,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 63 [2018-12-01 08:13:27,967 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-12-01 08:13:28,068 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:28,071 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:28,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 74 [2018-12-01 08:13:28,076 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-12-01 08:13:28,156 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:28,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 56 [2018-12-01 08:13:28,157 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:28,239 INFO L267 ElimStorePlain]: Start of recursive call 8: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-12-01 08:13:28,292 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-01 08:13:28,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-01 08:13:28,310 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 1 variables, input treesize:82, output treesize:129 [2018-12-01 08:13:28,377 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 08:13:28,378 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2018-12-01 08:13:28,378 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44 states and 54 transitions. cyclomatic complexity: 14 Second operand 9 states. [2018-12-01 08:13:28,883 WARN L180 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2018-12-01 08:13:28,893 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 44 states and 54 transitions. cyclomatic complexity: 14. Second operand 9 states. Result 126 states and 149 transitions. Complement of second has 19 states. [2018-12-01 08:13:28,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2018-12-01 08:13:28,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-01 08:13:28,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 24 transitions. [2018-12-01 08:13:28,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 24 transitions. Stem has 16 letters. Loop has 7 letters. [2018-12-01 08:13:28,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 08:13:28,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 24 transitions. Stem has 23 letters. Loop has 7 letters. [2018-12-01 08:13:28,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 08:13:28,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 24 transitions. Stem has 16 letters. Loop has 14 letters. [2018-12-01 08:13:28,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 08:13:28,896 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 149 transitions. [2018-12-01 08:13:28,899 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-12-01 08:13:28,900 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 79 states and 96 transitions. [2018-12-01 08:13:28,901 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-12-01 08:13:28,901 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2018-12-01 08:13:28,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 96 transitions. [2018-12-01 08:13:28,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 08:13:28,901 INFO L705 BuchiCegarLoop]: Abstraction has 79 states and 96 transitions. [2018-12-01 08:13:28,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 96 transitions. [2018-12-01 08:13:28,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 50. [2018-12-01 08:13:28,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-01 08:13:28,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 63 transitions. [2018-12-01 08:13:28,905 INFO L728 BuchiCegarLoop]: Abstraction has 50 states and 63 transitions. [2018-12-01 08:13:28,905 INFO L608 BuchiCegarLoop]: Abstraction has 50 states and 63 transitions. [2018-12-01 08:13:28,905 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-01 08:13:28,905 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 63 transitions. [2018-12-01 08:13:28,906 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-12-01 08:13:28,906 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 08:13:28,906 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 08:13:28,907 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 08:13:28,907 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 08:13:28,907 INFO L794 eck$LassoCheckResult]: Stem: 1927#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1917#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet18;havoc main_#t~nondet18;main_~y~0 := main_#t~nondet19;havoc main_#t~nondet19;gcd_#in~x, gcd_#in~y := main_~x~0, main_~y~0;havoc gcd_#res;havoc gcd_#t~malloc2.base, gcd_#t~malloc2.offset, gcd_#t~malloc3.base, gcd_#t~malloc3.offset, gcd_#t~malloc4.base, gcd_#t~malloc4.offset, gcd_#t~mem5, gcd_#t~mem6, gcd_#t~mem7, gcd_#t~mem8, gcd_#t~mem10, gcd_#t~mem13, gcd_#t~mem14, gcd_#t~mem11, gcd_#t~mem12, gcd_#t~mem15, gcd_#t~mem16, gcd_#t~mem9, gcd_#t~mem17, gcd_~x, gcd_~y, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, gcd_~r~0.base, gcd_~r~0.offset;gcd_~x := gcd_#in~x;gcd_~y := gcd_#in~y;call gcd_#t~malloc2.base, gcd_#t~malloc2.offset := #Ultimate.alloc(4);gcd_~x_ref~0.base, gcd_~x_ref~0.offset := gcd_#t~malloc2.base, gcd_#t~malloc2.offset;call gcd_#t~malloc3.base, gcd_#t~malloc3.offset := #Ultimate.alloc(4);gcd_~y_ref~0.base, gcd_~y_ref~0.offset := gcd_#t~malloc3.base, gcd_#t~malloc3.offset;call gcd_#t~malloc4.base, gcd_#t~malloc4.offset := #Ultimate.alloc(4);gcd_~r~0.base, gcd_~r~0.offset := gcd_#t~malloc4.base, gcd_#t~malloc4.offset;call write~int(gcd_~x, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_~y, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call gcd_#t~mem5 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4); 1918#L553 assume !(gcd_#t~mem5 < 0);havoc gcd_#t~mem5; 1926#L553-2 call gcd_#t~mem7 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 1928#L554 assume !(gcd_#t~mem7 < 0);havoc gcd_#t~mem7; 1935#L555-2 call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 1943#L555 assume !!(gcd_#t~mem9 > 0);havoc gcd_#t~mem9;call gcd_#t~mem10 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_#t~mem10, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem10; 1942#L557-3 call gcd_#t~mem11 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem12 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 1939#L557-1 assume !!(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem11;havoc gcd_#t~mem12;call gcd_#t~mem13 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem14 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem13 - gcd_#t~mem14, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem14;havoc gcd_#t~mem13; 1940#L557-3 call gcd_#t~mem11 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem12 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 1951#L557-1 assume !(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem11;havoc gcd_#t~mem12; 1919#L557-4 call gcd_#t~mem15 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem15, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);havoc gcd_#t~mem15;call gcd_#t~mem16 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call write~int(gcd_#t~mem16, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);havoc gcd_#t~mem16; 1921#L555-2 call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 1924#L555 assume !!(gcd_#t~mem9 > 0);havoc gcd_#t~mem9;call gcd_#t~mem10 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_#t~mem10, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem10; 1933#L557-3 call gcd_#t~mem11 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem12 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 1929#L557-1 [2018-12-01 08:13:28,907 INFO L796 eck$LassoCheckResult]: Loop: 1929#L557-1 assume !!(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem11;havoc gcd_#t~mem12;call gcd_#t~mem13 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem14 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem13 - gcd_#t~mem14, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem14;havoc gcd_#t~mem13; 1930#L557-3 call gcd_#t~mem11 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem12 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 1929#L557-1 [2018-12-01 08:13:28,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:13:28,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1696071320, now seen corresponding path program 5 times [2018-12-01 08:13:28,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:13:28,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:13:28,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:13:28,908 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 08:13:28,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:13:28,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:13:28,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:13:28,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:13:28,924 INFO L82 PathProgramCache]: Analyzing trace with hash 2044, now seen corresponding path program 2 times [2018-12-01 08:13:28,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:13:28,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:13:28,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:13:28,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 08:13:28,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:13:28,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:13:28,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:13:28,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:13:28,929 INFO L82 PathProgramCache]: Analyzing trace with hash -2131932253, now seen corresponding path program 6 times [2018-12-01 08:13:28,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:13:28,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:13:28,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:13:28,930 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 08:13:28,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:13:28,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:13:28,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:13:29,633 WARN L180 SmtUtils]: Spent 643.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 152 [2018-12-01 08:13:29,863 WARN L180 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-12-01 08:13:29,866 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 08:13:29,866 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 08:13:29,866 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 08:13:29,866 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 08:13:29,866 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 08:13:29,866 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 08:13:29,866 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 08:13:29,866 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 08:13:29,866 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd1-alloca_true-termination.c.i_Iteration8_Lasso [2018-12-01 08:13:29,866 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 08:13:29,866 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 08:13:29,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-12-01 08:13:29,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:29,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:29,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:29,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:29,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:29,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:29,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:29,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:29,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:29,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:29,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:30,067 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2018-12-01 08:13:30,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:30,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:30,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:30,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:30,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:30,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:30,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:30,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-12-01 08:13:30,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:30,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-12-01 08:13:30,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-12-01 08:13:30,378 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 08:13:30,378 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 08:13:30,378 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:30,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:30,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:30,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:30,379 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:30,379 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:13:30,379 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:30,380 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:30,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-12-01 08:13:30,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:30,380 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:30,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:30,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:30,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:30,380 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:30,380 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:30,380 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:30,381 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:30,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:30,381 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:30,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:30,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:30,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:30,381 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:30,381 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:30,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:30,381 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:30,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:30,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:30,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:30,382 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:30,382 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:13:30,382 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:30,382 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:30,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-12-01 08:13:30,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:30,383 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:30,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:30,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:30,383 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:30,383 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:30,383 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:30,383 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:30,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-12-01 08:13:30,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:30,384 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:30,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:30,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:30,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:30,384 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:30,384 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:30,384 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:30,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-12-01 08:13:30,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:30,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:30,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:30,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:30,385 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:13:30,385 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:30,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:30,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-12-01 08:13:30,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:30,386 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:30,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:30,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:30,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:30,386 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:30,387 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:30,387 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:30,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-12-01 08:13:30,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:30,387 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:30,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:30,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:30,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:30,387 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:30,387 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:30,387 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:30,388 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:30,388 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:30,388 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:30,388 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:30,388 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:30,388 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:30,388 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:30,388 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:30,388 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:30,388 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:30,389 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:30,389 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:30,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:30,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:30,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:30,389 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:30,389 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:30,389 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:30,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-12-01 08:13:30,389 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:30,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:30,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:30,390 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:30,390 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:13:30,390 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:30,390 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:30,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:30,391 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:30,391 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 08:13:30,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:30,391 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:30,391 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 08:13:30,391 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:30,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:30,393 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:30,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:30,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:30,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:30,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:30,395 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:13:30,395 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:30,400 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:30,400 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:30,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:30,401 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 08:13:30,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:30,401 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:30,402 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 08:13:30,402 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:30,404 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:30,404 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:30,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:30,404 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:30,404 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:30,405 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:30,405 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:13:30,405 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:30,407 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:30,407 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:30,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:30,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:30,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:30,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:30,409 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:13:30,409 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:30,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:30,411 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:30,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:30,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:30,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:30,412 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:30,412 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:13:30,412 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:30,414 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:30,414 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:30,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:30,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:30,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:30,415 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:30,415 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:13:30,415 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:30,416 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:30,416 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:30,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:30,417 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 08:13:30,417 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:30,417 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:30,417 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 08:13:30,417 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:30,419 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:30,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-12-01 08:13:30,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:30,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:30,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:30,420 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:30,420 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:13:30,421 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:30,421 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:30,422 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:30,422 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:30,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:30,422 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:30,422 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:30,424 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:13:30,424 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:30,436 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 08:13:30,447 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-01 08:13:30,447 INFO L444 ModelExtractionUtils]: 27 out of 37 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-01 08:13:30,448 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 08:13:30,448 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2018-12-01 08:13:30,448 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 08:13:30,449 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)_6, 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 + 2*v_rep(select (select #memory_int ULTIMATE.start_gcd_~r~0.base) ULTIMATE.start_gcd_~r~0.offset)_6 + 1 Supporting invariants [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, 1*v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_6 - 1 >= 0] [2018-12-01 08:13:30,513 INFO L297 tatePredicateManager]: 20 out of 25 supporting invariants were superfluous and have been removed [2018-12-01 08:13:30,520 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-01 08:13:30,520 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-01 08:13:30,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:13:30,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:13:30,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 08:13:30,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-01 08:13:30,568 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:30,569 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:30,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-01 08:13:30,569 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:30,572 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:30,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:30,577 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-12-01 08:13:30,617 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:30,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 38 [2018-12-01 08:13:30,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-01 08:13:30,621 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:30,628 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:30,631 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 08:13:30,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2018-12-01 08:13:30,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-12-01 08:13:30,634 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:30,638 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:30,641 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:30,644 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:30,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 66 [2018-12-01 08:13:30,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 43 [2018-12-01 08:13:30,667 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:30,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 37 [2018-12-01 08:13:30,874 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:31,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-12-01 08:13:31,214 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:31,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 41 [2018-12-01 08:13:31,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 11 [2018-12-01 08:13:31,570 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:31,575 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:31,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 39 [2018-12-01 08:13:31,730 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:31,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 35 [2018-12-01 08:13:31,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 41 [2018-12-01 08:13:31,866 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:31,872 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:31,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 34 treesize of output 61 [2018-12-01 08:13:31,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2018-12-01 08:13:31,963 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:32,023 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 08:13:32,068 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 08:13:32,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 30 [2018-12-01 08:13:32,121 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 08:13:32,168 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 08:13:32,221 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 08:13:32,270 INFO L267 ElimStorePlain]: Start of recursive call 15: 6 dim-1 vars, End of recursive call: 5 dim-0 vars, and 6 xjuncts. [2018-12-01 08:13:32,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 31 treesize of output 55 [2018-12-01 08:13:32,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 41 [2018-12-01 08:13:32,362 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 2 xjuncts. [2018-12-01 08:13:32,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2018-12-01 08:13:32,403 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:32,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-12-01 08:13:32,422 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:32,433 INFO L267 ElimStorePlain]: Start of recursive call 22: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 08:13:32,450 INFO L267 ElimStorePlain]: Start of recursive call 6: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:32,453 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:32,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 51 [2018-12-01 08:13:32,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 39 [2018-12-01 08:13:32,468 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:32,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2018-12-01 08:13:32,496 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:32,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 53 [2018-12-01 08:13:32,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 45 [2018-12-01 08:13:32,534 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:32,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2018-12-01 08:13:32,562 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 2 xjuncts. [2018-12-01 08:13:32,570 INFO L267 ElimStorePlain]: Start of recursive call 29: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 08:13:32,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 31 treesize of output 52 [2018-12-01 08:13:32,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 44 [2018-12-01 08:13:32,608 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 2 xjuncts. [2018-12-01 08:13:32,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2018-12-01 08:13:32,631 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:32,636 INFO L267 ElimStorePlain]: Start of recursive call 32: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:32,644 INFO L267 ElimStorePlain]: Start of recursive call 26: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:32,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:32,653 INFO L202 ElimStorePlain]: Needed 34 recursive calls to eliminate 1 variables, input treesize:63, output treesize:23 [2018-12-01 08:13:32,679 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:32,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 58 [2018-12-01 08:13:32,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 34 [2018-12-01 08:13:32,696 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:32,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 23 [2018-12-01 08:13:32,737 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:32,764 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 37 [2018-12-01 08:13:32,764 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-01 08:13:32,781 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-01 08:13:32,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-01 08:13:32,799 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:113 [2018-12-01 08:13:33,949 WARN L180 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 48 DAG size of output: 37 [2018-12-01 08:13:33,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:13:33,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 08:13:33,958 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:33,960 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:33,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 72 [2018-12-01 08:13:33,963 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:33,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 50 [2018-12-01 08:13:33,964 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:33,969 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:33,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:33,975 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:71, output treesize:36 [2018-12-01 08:13:33,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 08:13:33,988 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2018-12-01 08:13:33,988 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 63 transitions. cyclomatic complexity: 17 Second operand 7 states. [2018-12-01 08:13:34,017 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 63 transitions. cyclomatic complexity: 17. Second operand 7 states. Result 50 states and 63 transitions. Complement of second has 4 states. [2018-12-01 08:13:34,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2018-12-01 08:13:34,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-01 08:13:34,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2018-12-01 08:13:34,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 15 letters. Loop has 2 letters. [2018-12-01 08:13:34,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 08:13:34,018 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 08:13:34,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:13:34,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:13:34,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 08:13:34,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-01 08:13:34,054 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:34,054 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:34,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-01 08:13:34,055 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:34,057 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:34,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:34,061 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-12-01 08:13:34,098 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:34,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 66 [2018-12-01 08:13:34,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 45 [2018-12-01 08:13:34,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:34,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 39 [2018-12-01 08:13:34,347 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:34,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-12-01 08:13:34,516 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:34,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 53 [2018-12-01 08:13:34,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 45 [2018-12-01 08:13:34,888 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:34,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 33 [2018-12-01 08:13:34,923 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-12-01 08:13:34,936 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 08:13:35,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 52 [2018-12-01 08:13:35,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2018-12-01 08:13:35,056 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:35,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 33 [2018-12-01 08:13:35,083 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-12-01 08:13:35,095 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 08:13:35,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 34 treesize of output 61 [2018-12-01 08:13:35,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41 [2018-12-01 08:13:35,218 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 08:13:35,264 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 08:13:35,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2018-12-01 08:13:35,298 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:35,327 INFO L267 ElimStorePlain]: Start of recursive call 12: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-12-01 08:13:35,375 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:35,377 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:35,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 38 [2018-12-01 08:13:35,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-01 08:13:35,382 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:35,388 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:35,390 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 08:13:35,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2018-12-01 08:13:35,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-12-01 08:13:35,392 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:35,395 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:35,398 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:35,401 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:35,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 51 [2018-12-01 08:13:35,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 41 [2018-12-01 08:13:35,416 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:35,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-12-01 08:13:35,442 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:35,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 41 [2018-12-01 08:13:35,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 11 [2018-12-01 08:13:35,470 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:35,475 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:35,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 53 [2018-12-01 08:13:35,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 45 [2018-12-01 08:13:35,511 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:35,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2018-12-01 08:13:35,538 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 2 xjuncts. [2018-12-01 08:13:35,547 INFO L267 ElimStorePlain]: Start of recursive call 25: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 08:13:35,558 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:35,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-01 08:13:35,570 INFO L202 ElimStorePlain]: Needed 27 recursive calls to eliminate 1 variables, input treesize:63, output treesize:53 [2018-12-01 08:13:35,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-12-01 08:13:35,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-12-01 08:13:35,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:35,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 23 [2018-12-01 08:13:35,666 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:35,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 37 [2018-12-01 08:13:35,693 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-01 08:13:35,710 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-01 08:13:35,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-01 08:13:35,728 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:113 [2018-12-01 08:13:36,863 WARN L180 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 48 DAG size of output: 37 [2018-12-01 08:13:36,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:13:36,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 08:13:36,870 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:36,872 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:36,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 72 [2018-12-01 08:13:36,875 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:36,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 50 [2018-12-01 08:13:36,875 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:36,880 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:36,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:36,886 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:71, output treesize:36 [2018-12-01 08:13:36,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 08:13:36,899 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.5 stem predicates 2 loop predicates [2018-12-01 08:13:36,899 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 63 transitions. cyclomatic complexity: 17 Second operand 7 states. [2018-12-01 08:13:36,928 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 63 transitions. cyclomatic complexity: 17. Second operand 7 states. Result 50 states and 63 transitions. Complement of second has 4 states. [2018-12-01 08:13:36,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2018-12-01 08:13:36,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-01 08:13:36,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2018-12-01 08:13:36,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 15 letters. Loop has 2 letters. [2018-12-01 08:13:36,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 08:13:36,929 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 08:13:36,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:13:36,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:13:36,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 08:13:36,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-01 08:13:36,964 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:36,965 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:36,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-01 08:13:36,965 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:36,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:36,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:36,971 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-12-01 08:13:37,009 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:37,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 38 [2018-12-01 08:13:37,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-01 08:13:37,014 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:37,020 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:37,022 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 08:13:37,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2018-12-01 08:13:37,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-12-01 08:13:37,024 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:37,027 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:37,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:37,032 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:37,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 51 [2018-12-01 08:13:37,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-12-01 08:13:37,047 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:37,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2018-12-01 08:13:37,073 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:37,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 53 [2018-12-01 08:13:37,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 45 [2018-12-01 08:13:37,113 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:37,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2018-12-01 08:13:37,136 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-12-01 08:13:37,144 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 08:13:37,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 31 treesize of output 52 [2018-12-01 08:13:37,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2018-12-01 08:13:37,186 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:37,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 30 [2018-12-01 08:13:37,213 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-12-01 08:13:37,222 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:37,229 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:37,234 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:37,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 66 [2018-12-01 08:13:37,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 43 [2018-12-01 08:13:37,264 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:37,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-12-01 08:13:37,464 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:37,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 37 [2018-12-01 08:13:37,798 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:37,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 35 [2018-12-01 08:13: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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 41 [2018-12-01 08:13:37,977 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:37,983 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:38,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2018-12-01 08:13:38,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 11 [2018-12-01 08:13:38,291 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:38,296 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:38,399 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 08:13:38,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 58 [2018-12-01 08:13:38,411 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 3 xjuncts. [2018-12-01 08:13:38,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 34 [2018-12-01 08:13:38,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2018-12-01 08:13:38,534 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 2 xjuncts. [2018-12-01 08:13:38,540 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:38,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 58 [2018-12-01 08:13:38,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 44 [2018-12-01 08:13:38,675 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 2 xjuncts. [2018-12-01 08:13:38,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 23 [2018-12-01 08:13:38,728 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:38,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2018-12-01 08:13:38,754 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:38,763 INFO L267 ElimStorePlain]: Start of recursive call 26: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:38,781 INFO L267 ElimStorePlain]: Start of recursive call 15: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:38,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:38,793 INFO L202 ElimStorePlain]: Needed 29 recursive calls to eliminate 1 variables, input treesize:63, output treesize:23 [2018-12-01 08:13:38,826 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:38,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 58 [2018-12-01 08:13:38,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 34 [2018-12-01 08:13:38,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:38,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 23 [2018-12-01 08:13:38,888 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:38,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 37 [2018-12-01 08:13:38,915 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-01 08:13:38,931 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-01 08:13:38,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-01 08:13:38,949 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:113 [2018-12-01 08:13:40,084 WARN L180 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 48 DAG size of output: 37 [2018-12-01 08:13:40,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:13:40,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 08:13:40,091 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:40,093 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:40,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 72 [2018-12-01 08:13:40,095 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:40,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 50 [2018-12-01 08:13:40,096 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:40,101 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:40,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:40,107 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:71, output treesize:36 [2018-12-01 08:13:40,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 08:13:40,121 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2018-12-01 08:13:40,121 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 63 transitions. cyclomatic complexity: 17 Second operand 7 states. [2018-12-01 08:13:40,202 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 63 transitions. cyclomatic complexity: 17. Second operand 7 states. Result 64 states and 80 transitions. Complement of second has 8 states. [2018-12-01 08:13:40,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 5 stem states 0 non-accepting loop states 2 accepting loop states [2018-12-01 08:13:40,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-01 08:13:40,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2018-12-01 08:13:40,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 15 letters. Loop has 2 letters. [2018-12-01 08:13:40,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 08:13:40,203 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 08:13:40,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:13:40,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:13:40,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 08:13:40,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-01 08:13:40,239 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:40,240 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:40,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-01 08:13:40,240 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:40,244 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:40,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:40,248 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-12-01 08:13:40,281 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:40,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 51 [2018-12-01 08:13:40,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 39 [2018-12-01 08:13:40,296 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:40,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2018-12-01 08:13:40,323 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:40,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2018-12-01 08:13:40,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2018-12-01 08:13:40,356 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-01 08:13:40,362 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:40,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 31 treesize of output 52 [2018-12-01 08:13:40,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 44 [2018-12-01 08:13:40,401 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-12-01 08:13:40,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2018-12-01 08:13:40,427 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:40,433 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:40,441 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:40,443 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:40,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 38 [2018-12-01 08:13:40,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-01 08:13:40,448 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:40,454 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:40,456 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 08:13:40,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2018-12-01 08:13:40,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-12-01 08:13:40,459 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:40,462 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:40,466 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:40,472 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:40,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 66 [2018-12-01 08:13:40,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 42 [2018-12-01 08:13:40,499 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:40,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 39 [2018-12-01 08:13:40,721 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:40,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 37 [2018-12-01 08:13:40,892 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:41,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 53 [2018-12-01 08:13:41,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 45 [2018-12-01 08:13:41,256 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:41,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 33 [2018-12-01 08:13:41,288 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2018-12-01 08:13:41,304 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 08:13:41,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 52 [2018-12-01 08:13:41,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2018-12-01 08:13:41,549 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:41,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 33 [2018-12-01 08:13:41,578 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 2 xjuncts. [2018-12-01 08:13:41,591 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 08:13:41,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2018-12-01 08:13:41,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 11 [2018-12-01 08:13:41,740 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:41,745 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:41,767 INFO L267 ElimStorePlain]: Start of recursive call 14: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:41,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-01 08:13:41,782 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 1 variables, input treesize:63, output treesize:53 [2018-12-01 08:13:41,819 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:41,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 58 [2018-12-01 08:13:41,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 45 [2018-12-01 08:13:41,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-01 08:13:41,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 30 [2018-12-01 08:13:41,894 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:41,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 23 [2018-12-01 08:13:41,917 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:41,931 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-01 08:13:41,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-01 08:13:41,949 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:113 [2018-12-01 08:13:43,087 WARN L180 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 48 DAG size of output: 37 [2018-12-01 08:13:43,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:13:43,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 08:13:43,094 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:43,096 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:43,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 72 [2018-12-01 08:13:43,099 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:43,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 50 [2018-12-01 08:13:43,099 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:43,104 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:43,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:43,109 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:71, output treesize:36 [2018-12-01 08:13:43,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 08:13:43,122 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.5 stem predicates 2 loop predicates [2018-12-01 08:13:43,123 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 63 transitions. cyclomatic complexity: 17 Second operand 7 states. [2018-12-01 08:13:43,204 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 63 transitions. cyclomatic complexity: 17. Second operand 7 states. Result 66 states and 81 transitions. Complement of second has 10 states. [2018-12-01 08:13:43,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 5 stem states 1 non-accepting loop states 2 accepting loop states [2018-12-01 08:13:43,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-01 08:13:43,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2018-12-01 08:13:43,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 15 letters. Loop has 2 letters. [2018-12-01 08:13:43,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 08:13:43,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 17 letters. Loop has 2 letters. [2018-12-01 08:13:43,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 08:13:43,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 15 letters. Loop has 4 letters. [2018-12-01 08:13:43,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 08:13:43,205 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 81 transitions. [2018-12-01 08:13:43,205 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-12-01 08:13:43,206 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 59 states and 73 transitions. [2018-12-01 08:13:43,207 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-12-01 08:13:43,207 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-12-01 08:13:43,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 73 transitions. [2018-12-01 08:13:43,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 08:13:43,207 INFO L705 BuchiCegarLoop]: Abstraction has 59 states and 73 transitions. [2018-12-01 08:13:43,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 73 transitions. [2018-12-01 08:13:43,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 36. [2018-12-01 08:13:43,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-01 08:13:43,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2018-12-01 08:13:43,209 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2018-12-01 08:13:43,209 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2018-12-01 08:13:43,209 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-01 08:13:43,209 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 45 transitions. [2018-12-01 08:13:43,209 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-12-01 08:13:43,209 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 08:13:43,209 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 08:13:43,210 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 08:13:43,210 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 1, 1, 1, 1] [2018-12-01 08:13:43,210 INFO L794 eck$LassoCheckResult]: Stem: 2596#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2588#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet18;havoc main_#t~nondet18;main_~y~0 := main_#t~nondet19;havoc main_#t~nondet19;gcd_#in~x, gcd_#in~y := main_~x~0, main_~y~0;havoc gcd_#res;havoc gcd_#t~malloc2.base, gcd_#t~malloc2.offset, gcd_#t~malloc3.base, gcd_#t~malloc3.offset, gcd_#t~malloc4.base, gcd_#t~malloc4.offset, gcd_#t~mem5, gcd_#t~mem6, gcd_#t~mem7, gcd_#t~mem8, gcd_#t~mem10, gcd_#t~mem13, gcd_#t~mem14, gcd_#t~mem11, gcd_#t~mem12, gcd_#t~mem15, gcd_#t~mem16, gcd_#t~mem9, gcd_#t~mem17, gcd_~x, gcd_~y, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, gcd_~r~0.base, gcd_~r~0.offset;gcd_~x := gcd_#in~x;gcd_~y := gcd_#in~y;call gcd_#t~malloc2.base, gcd_#t~malloc2.offset := #Ultimate.alloc(4);gcd_~x_ref~0.base, gcd_~x_ref~0.offset := gcd_#t~malloc2.base, gcd_#t~malloc2.offset;call gcd_#t~malloc3.base, gcd_#t~malloc3.offset := #Ultimate.alloc(4);gcd_~y_ref~0.base, gcd_~y_ref~0.offset := gcd_#t~malloc3.base, gcd_#t~malloc3.offset;call gcd_#t~malloc4.base, gcd_#t~malloc4.offset := #Ultimate.alloc(4);gcd_~r~0.base, gcd_~r~0.offset := gcd_#t~malloc4.base, gcd_#t~malloc4.offset;call write~int(gcd_~x, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_~y, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call gcd_#t~mem5 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4); 2589#L553 assume !(gcd_#t~mem5 < 0);havoc gcd_#t~mem5; 2595#L553-2 call gcd_#t~mem7 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 2597#L554 assume !(gcd_#t~mem7 < 0);havoc gcd_#t~mem7; 2607#L555-2 call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 2602#L555 assume !!(gcd_#t~mem9 > 0);havoc gcd_#t~mem9;call gcd_#t~mem10 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_#t~mem10, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem10; 2599#L557-3 call gcd_#t~mem11 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem12 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 2604#L557-1 assume !(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem11;havoc gcd_#t~mem12; 2608#L557-4 call gcd_#t~mem15 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem15, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);havoc gcd_#t~mem15;call gcd_#t~mem16 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call write~int(gcd_#t~mem16, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);havoc gcd_#t~mem16; 2592#L555-2 call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 2593#L555 assume !!(gcd_#t~mem9 > 0);havoc gcd_#t~mem9;call gcd_#t~mem10 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_#t~mem10, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem10; 2623#L557-3 call gcd_#t~mem11 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem12 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 2613#L557-1 [2018-12-01 08:13:43,210 INFO L796 eck$LassoCheckResult]: Loop: 2613#L557-1 assume !!(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem11;havoc gcd_#t~mem12;call gcd_#t~mem13 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem14 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem13 - gcd_#t~mem14, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem14;havoc gcd_#t~mem13; 2601#L557-3 call gcd_#t~mem11 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem12 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 2612#L557-1 assume !!(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem11;havoc gcd_#t~mem12;call gcd_#t~mem13 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem14 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem13 - gcd_#t~mem14, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem14;havoc gcd_#t~mem13; 2611#L557-3 call gcd_#t~mem11 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem12 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 2610#L557-1 assume !(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem11;havoc gcd_#t~mem12; 2590#L557-4 call gcd_#t~mem15 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem15, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);havoc gcd_#t~mem15;call gcd_#t~mem16 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call write~int(gcd_#t~mem16, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);havoc gcd_#t~mem16; 2591#L555-2 call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 2594#L555 assume !!(gcd_#t~mem9 > 0);havoc gcd_#t~mem9;call gcd_#t~mem10 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_#t~mem10, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem10; 2603#L557-3 call gcd_#t~mem11 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem12 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 2613#L557-1 [2018-12-01 08:13:43,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:13:43,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1804472061, now seen corresponding path program 2 times [2018-12-01 08:13:43,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:13:43,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:13:43,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:13:43,211 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 08:13:43,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:13:43,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:13:43,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:13:43,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:13:43,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1547227717, now seen corresponding path program 3 times [2018-12-01 08:13:43,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:13:43,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:13:43,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:13:43,223 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 08:13:43,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:13:43,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:13:43,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:13:43,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:13:43,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1970848007, now seen corresponding path program 7 times [2018-12-01 08:13:43,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:13:43,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:13:43,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:13:43,236 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 08:13:43,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:13:43,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:13:43,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:13:43,837 WARN L180 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 140 [2018-12-01 08:13:43,962 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-12-01 08:13:43,965 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 08:13:43,965 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 08:13:43,965 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 08:13:43,965 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 08:13:43,965 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 08:13:43,965 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 08:13:43,965 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 08:13:43,965 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 08:13:43,965 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd1-alloca_true-termination.c.i_Iteration9_Lasso [2018-12-01 08:13:43,965 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 08:13:43,965 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 08:13:43,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:43,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:43,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:43,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:43,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-12-01 08:13:43,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-12-01 08:13:43,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-12-01 08:13:43,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-12-01 08:13:43,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:44,162 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 81 [2018-12-01 08:13:44,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-12-01 08:13:44,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-12-01 08:13:44,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-12-01 08:13:44,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-12-01 08:13:44,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-12-01 08:13:44,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-12-01 08:13:44,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:13:44,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-12-01 08:13:44,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-12-01 08:13:44,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-12-01 08:13:44,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-12-01 08:13:44,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-12-01 08:13:44,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-12-01 08:13:44,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-12-01 08:13:44,506 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 08:13:44,506 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 08:13:44,506 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:44,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:44,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:44,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:44,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:44,507 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:13:44,507 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:44,507 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:44,508 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:44,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:44,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:44,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:44,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:44,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:44,508 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:44,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:44,508 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:44,509 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:44,509 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:44,509 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:44,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:44,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:44,509 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:44,509 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:44,509 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:44,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:44,509 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:44,509 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:44,510 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:44,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:44,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:44,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:44,510 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:44,510 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:44,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:44,510 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:44,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:44,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:44,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:44,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:44,511 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:13:44,511 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:44,511 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:44,511 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:44,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:44,512 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:44,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:44,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:44,512 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:44,512 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:44,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:44,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:44,512 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:44,512 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:44,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:44,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:44,512 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:44,513 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:13:44,513 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:44,513 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:44,513 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:44,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:44,513 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:13:44,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:44,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:44,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:44,514 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:13:44,514 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:13:44,514 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:44,514 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:44,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:44,514 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 08:13:44,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:44,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:44,515 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 08:13:44,515 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:44,516 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:13:44,516 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 08:13:44,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:13:44,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:13:44,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:13:44,516 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:13:44,517 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:13:44,517 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:13:44,523 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 08:13:44,530 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-01 08:13:44,530 INFO L444 ModelExtractionUtils]: 28 out of 37 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-12-01 08:13:44,531 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 08:13:44,531 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 08:13:44,531 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 08:13:44,531 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_7) = 1*v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_7 Supporting invariants [] [2018-12-01 08:13:44,598 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-12-01 08:13:44,599 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-01 08:13:44,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:13:44,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:13:44,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 08:13:44,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-01 08:13:44,637 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:44,638 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:44,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-01 08:13:44,639 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:44,641 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:44,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:44,644 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-12-01 08:13:44,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:13:44,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 08:13:44,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 39 [2018-12-01 08:13:44,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 37 [2018-12-01 08:13:44,675 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-12-01 08:13:44,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2018-12-01 08:13:44,695 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:44,706 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-01 08:13:44,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-01 08:13:44,718 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:35, output treesize:54 [2018-12-01 08:13:44,739 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 08:13:44,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 45 [2018-12-01 08:13:44,741 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 08:13:44,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 11 [2018-12-01 08:13:44,741 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:44,745 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:44,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 34 [2018-12-01 08:13:44,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-12-01 08:13:44,771 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:44,774 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:44,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2018-12-01 08:13:44,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 34 [2018-12-01 08:13:44,802 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 3 xjuncts. [2018-12-01 08:13:44,811 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 08:13:44,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-01 08:13:44,823 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:123, output treesize:51 [2018-12-01 08:13:44,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 63 [2018-12-01 08:13:44,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 55 [2018-12-01 08:13:44,919 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:44,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2018-12-01 08:13:44,958 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:44,990 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:44,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 53 [2018-12-01 08:13:44,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 46 [2018-12-01 08:13:45,000 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-01 08:13:45,011 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 08:13:45,049 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:45,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 78 [2018-12-01 08:13:45,066 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-01 08:13:45,066 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:45,153 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:45,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 49 [2018-12-01 08:13:45,158 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-12-01 08:13:45,219 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:45,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 48 [2018-12-01 08:13:45,220 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:45,256 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:45,257 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:45,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 51 [2018-12-01 08:13:45,257 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:45,276 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-01 08:13:45,326 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-01 08:13:45,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-01 08:13:45,347 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 1 variables, input treesize:76, output treesize:115 [2018-12-01 08:13:45,455 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:45,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 65 [2018-12-01 08:13:45,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-12-01 08:13:45,462 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:45,474 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:45,510 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:45,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 68 [2018-12-01 08:13:45,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2018-12-01 08:13:45,512 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:45,520 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:45,548 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 08:13:45,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 43 [2018-12-01 08:13:45,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-12-01 08:13:45,550 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:45,555 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:45,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 3 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-01 08:13:45,576 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:178, output treesize:129 [2018-12-01 08:13:45,639 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-01 08:13:45,639 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2018-12-01 08:13:45,640 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 45 transitions. cyclomatic complexity: 12 Second operand 9 states. [2018-12-01 08:13:45,757 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 45 transitions. cyclomatic complexity: 12. Second operand 9 states. Result 87 states and 107 transitions. Complement of second has 16 states. [2018-12-01 08:13:45,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2018-12-01 08:13:45,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-01 08:13:45,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 20 transitions. [2018-12-01 08:13:45,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 20 transitions. Stem has 13 letters. Loop has 9 letters. [2018-12-01 08:13:45,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 08:13:45,757 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 08:13:45,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:13:45,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:13:45,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 08:13:45,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-01 08:13:45,798 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:45,798 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:45,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-01 08:13:45,799 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:45,801 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:45,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:45,803 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-12-01 08:13:45,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:13:45,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 08:13:45,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 39 [2018-12-01 08:13:45,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2018-12-01 08:13:45,826 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:45,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 37 [2018-12-01 08:13:45,849 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-12-01 08:13:45,863 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-01 08:13:45,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-01 08:13:45,875 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:35, output treesize:54 [2018-12-01 08:13:45,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 34 [2018-12-01 08:13:45,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-12-01 08:13:45,901 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:45,904 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:45,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2018-12-01 08:13:45,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 27 [2018-12-01 08:13:45,933 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:45,937 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:45,953 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 08:13:45,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 45 [2018-12-01 08:13:45,955 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 08:13:45,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 11 [2018-12-01 08:13:45,956 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:45,959 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:45,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-01 08:13:45,971 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:123, output treesize:51 [2018-12-01 08:13:46,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 63 [2018-12-01 08:13:46,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 55 [2018-12-01 08:13:46,066 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:46,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2018-12-01 08:13:46,103 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:46,136 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:46,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 53 [2018-12-01 08:13:46,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 46 [2018-12-01 08:13:46,144 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-01 08:13:46,156 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 08:13:46,194 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:46,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 78 [2018-12-01 08:13:46,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2018-12-01 08:13:46,211 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:46,340 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:46,340 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:46,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 51 [2018-12-01 08:13:46,341 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:46,387 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:46,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 49 [2018-12-01 08:13:46,394 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-12-01 08:13:46,425 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-01 08:13:46,503 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-01 08:13:46,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-01 08:13:46,537 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 1 variables, input treesize:76, output treesize:115 [2018-12-01 08:13:46,728 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:46,729 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 68 [2018-12-01 08:13:46,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2018-12-01 08:13:46,734 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:46,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:46,846 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 08:13:46,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 43 [2018-12-01 08:13:46,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-12-01 08:13:46,850 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:46,861 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:46,946 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:46,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 65 [2018-12-01 08:13:46,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-12-01 08:13:46,953 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:46,971 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:47,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 3 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-01 08:13:47,024 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:178, output treesize:129 [2018-12-01 08:13:47,188 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-12-01 08:13:47,189 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-01 08:13:47,189 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 7 loop predicates [2018-12-01 08:13:47,189 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 45 transitions. cyclomatic complexity: 12 Second operand 9 states. [2018-12-01 08:13:47,646 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2018-12-01 08:13:47,650 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 45 transitions. cyclomatic complexity: 12. Second operand 9 states. Result 90 states and 110 transitions. Complement of second has 18 states. [2018-12-01 08:13:47,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 2 stem states 7 non-accepting loop states 1 accepting loop states [2018-12-01 08:13:47,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-01 08:13:47,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 19 transitions. [2018-12-01 08:13:47,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 19 transitions. Stem has 13 letters. Loop has 9 letters. [2018-12-01 08:13:47,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 08:13:47,651 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 08:13:47,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:13:47,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:13:47,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 08:13:47,704 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-01 08:13:47,717 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:47,719 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:47,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-01 08:13:47,719 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:47,724 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:47,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:47,729 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-12-01 08:13:47,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:13:47,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 08:13:47,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 39 [2018-12-01 08:13:47,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2018-12-01 08:13:47,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:47,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 37 [2018-12-01 08:13:47,781 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-12-01 08:13:47,795 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-01 08:13:47,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-01 08:13:47,806 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:35, output treesize:54 [2018-12-01 08:13:47,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 34 [2018-12-01 08:13:47,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-12-01 08:13:47,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:47,835 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:47,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2018-12-01 08:13:47,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 27 [2018-12-01 08:13:47,863 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:47,867 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:47,883 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 08:13:47,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 45 [2018-12-01 08:13:47,886 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 08:13:47,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 11 [2018-12-01 08:13:47,886 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:47,890 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:47,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-01 08:13:47,903 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:123, output treesize:51 [2018-12-01 08:13:47,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 63 [2018-12-01 08:13:47,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 55 [2018-12-01 08:13:47,998 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:48,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2018-12-01 08:13:48,034 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:48,069 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:48,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 53 [2018-12-01 08:13:48,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 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 46 [2018-12-01 08:13:48,077 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-01 08:13:48,088 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 08:13:48,124 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:48,126 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:48,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 50 treesize of output 88 [2018-12-01 08:13:48,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 83 [2018-12-01 08:13:48,151 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-12-01 08:13:48,285 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:48,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 50 [2018-12-01 08:13:48,285 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:48,351 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:48,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 49 [2018-12-01 08:13:48,356 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-12-01 08:13:48,453 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:48,456 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:48,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 68 [2018-12-01 08:13:48,461 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-12-01 08:13:48,568 INFO L267 ElimStorePlain]: Start of recursive call 7: 6 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-12-01 08:13:48,643 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:48,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 78 [2018-12-01 08:13:48,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2018-12-01 08:13:48,663 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:48,774 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:48,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 49 [2018-12-01 08:13:48,779 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-12-01 08:13:48,814 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:48,815 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:48,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 51 [2018-12-01 08:13:48,815 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:48,834 INFO L267 ElimStorePlain]: Start of recursive call 12: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-01 08:13:48,867 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-01 08:13:48,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-01 08:13:48,888 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 1 variables, input treesize:76, output treesize:115 [2018-12-01 08:13:48,967 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:48,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 65 [2018-12-01 08:13:48,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-12-01 08:13:48,970 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:48,977 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:49,010 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 08:13:49,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 43 [2018-12-01 08:13:49,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-12-01 08:13:49,012 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:49,016 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:49,049 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:13:49,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 68 [2018-12-01 08:13:49,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2018-12-01 08:13:49,052 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 08:13:49,070 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:13:49,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 3 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-01 08:13:49,091 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:178, output treesize:129 [2018-12-01 08:13:49,155 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-01 08:13:49,155 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2018-12-01 08:13:49,155 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 45 transitions. cyclomatic complexity: 12 Second operand 9 states. [2018-12-01 08:13:49,259 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 45 transitions. cyclomatic complexity: 12. Second operand 9 states. Result 89 states and 112 transitions. Complement of second has 18 states. [2018-12-01 08:13:49,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2018-12-01 08:13:49,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-01 08:13:49,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 24 transitions. [2018-12-01 08:13:49,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 24 transitions. Stem has 13 letters. Loop has 9 letters. [2018-12-01 08:13:49,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 08:13:49,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 24 transitions. Stem has 22 letters. Loop has 9 letters. [2018-12-01 08:13:49,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 08:13:49,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 24 transitions. Stem has 13 letters. Loop has 18 letters. [2018-12-01 08:13:49,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 08:13:49,260 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 112 transitions. [2018-12-01 08:13:49,261 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-01 08:13:49,261 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 0 states and 0 transitions. [2018-12-01 08:13:49,261 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-01 08:13:49,261 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-01 08:13:49,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-01 08:13:49,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 08:13:49,261 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 08:13:49,261 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 08:13:49,261 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 08:13:49,261 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-01 08:13:49,261 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-01 08:13:49,261 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-01 08:13:49,261 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-01 08:13:49,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.12 08:13:49 BoogieIcfgContainer [2018-12-01 08:13:49,265 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-01 08:13:49,266 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 08:13:49,266 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 08:13:49,266 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 08:13:49,266 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 08:13:15" (3/4) ... [2018-12-01 08:13:49,269 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-01 08:13:49,269 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 08:13:49,269 INFO L168 Benchmark]: Toolchain (without parser) took 34214.03 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 600.8 MB). Free memory was 957.1 MB in the beginning and 886.5 MB in the end (delta: 70.6 MB). Peak memory consumption was 671.4 MB. Max. memory is 11.5 GB. [2018-12-01 08:13:49,269 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 08:13:49,270 INFO L168 Benchmark]: CACSL2BoogieTranslator took 243.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -157.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2018-12-01 08:13:49,270 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.38 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 08:13:49,270 INFO L168 Benchmark]: Boogie Preprocessor took 14.39 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 08:13:49,270 INFO L168 Benchmark]: RCFGBuilder took 161.67 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: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. [2018-12-01 08:13:49,270 INFO L168 Benchmark]: BuchiAutomizer took 33763.27 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 470.8 MB). Free memory was 1.1 GB in the beginning and 886.5 MB in the end (delta: 202.3 MB). Peak memory consumption was 673.2 MB. Max. memory is 11.5 GB. [2018-12-01 08:13:49,270 INFO L168 Benchmark]: Witness Printer took 3.04 ms. Allocated memory is still 1.6 GB. Free memory is still 886.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 08:13:49,271 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 243.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -157.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.38 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.39 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 161.67 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: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 33763.27 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 470.8 MB). Free memory was 1.1 GB in the beginning and 886.5 MB in the end (delta: 202.3 MB). Peak memory consumption was 673.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.04 ms. Allocated memory is still 1.6 GB. Free memory is still 886.5 MB. 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[y_ref][y_ref] + 2 * unknown-#memory_int-unknown[r][r] + 1 and consists of 7 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[r][r] and consists of 8 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[r][r] and consists of 9 locations. One nondeterministic module has affine ranking function -2 * unknown-#memory_int-unknown[y_ref][y_ref] + 2 * unknown-#memory_int-unknown[r][r] + 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 33.7s and 10 iterations. TraceHistogramMax:3. Analysis of lassos took 9.8s. Construction of modules took 0.6s. Büchi inclusion checks took 23.1s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 7. Automata minimization 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 95 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 50 states and ocurred in iteration 7. Nontrivial modules had stage [4, 0, 2, 1, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/10 HoareTripleCheckerStatistics: 132 SDtfs, 333 SDslu, 103 SDs, 0 SdLazy, 727 SolverSat, 123 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 0.6s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso7 LassoPreprocessingBenchmarks: Lassos: inital3529 mio100 ax102 hnf100 lsp97 ukn21 mio100 lsp35 div100 bol100 ite100 ukn100 eq192 hnf87 smp99 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...