./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/gcd1-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-memory-alloca/gcd1-alloca_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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.24-0ed9222-m [2019-01-14 02:33:01,506 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:33:01,510 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:33:01,524 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:33:01,524 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:33:01,526 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:33:01,527 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:33:01,530 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:33:01,533 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:33:01,534 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:33:01,537 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:33:01,537 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:33:01,538 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:33:01,539 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:33:01,540 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:33:01,544 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:33:01,545 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:33:01,547 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:33:01,552 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:33:01,554 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:33:01,555 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:33:01,556 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:33:01,558 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:33:01,558 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:33:01,559 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:33:01,559 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:33:01,560 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:33:01,561 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:33:01,563 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:33:01,564 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:33:01,564 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:33:01,565 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:33:01,565 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:33:01,566 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:33:01,566 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:33:01,567 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:33:01,568 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:33:01,585 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:33:01,586 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:33:01,587 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:33:01,587 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:33:01,587 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:33:01,587 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:33:01,587 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:33:01,588 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:33:01,588 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:33:01,588 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:33:01,588 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:33:01,588 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:33:01,589 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:33:01,589 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:33:01,589 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:33:01,589 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:33:01,592 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:33:01,592 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:33:01,592 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:33:01,592 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:33:01,593 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:33:01,593 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:33:01,593 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:33:01,593 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:33:01,593 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:33:01,594 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:33:01,594 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:33:01,594 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:33:01,595 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:33:01,595 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 [2019-01-14 02:33:01,629 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:33:01,641 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:33:01,644 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:33:01,645 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:33:01,646 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:33:01,646 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/gcd1-alloca_true-termination.c.i [2019-01-14 02:33:01,702 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4abe6c0a2/03bf1050d2e44ab8809d01601c707912/FLAG105d2f68d [2019-01-14 02:33:02,150 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:33:02,151 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/gcd1-alloca_true-termination.c.i [2019-01-14 02:33:02,163 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4abe6c0a2/03bf1050d2e44ab8809d01601c707912/FLAG105d2f68d [2019-01-14 02:33:02,463 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4abe6c0a2/03bf1050d2e44ab8809d01601c707912 [2019-01-14 02:33:02,468 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:33:02,470 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:33:02,471 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:33:02,471 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:33:02,475 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:33:02,476 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:33:02" (1/1) ... [2019-01-14 02:33:02,480 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37f0b80a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:33:02, skipping insertion in model container [2019-01-14 02:33:02,480 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:33:02" (1/1) ... [2019-01-14 02:33:02,488 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:33:02,542 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:33:02,932 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:33:02,957 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:33:03,007 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:33:03,062 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:33:03,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:33:03 WrapperNode [2019-01-14 02:33:03,063 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:33:03,064 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:33:03,064 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:33:03,064 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:33:03,146 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:33:03" (1/1) ... [2019-01-14 02:33:03,162 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:33:03" (1/1) ... [2019-01-14 02:33:03,184 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:33:03,185 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:33:03,185 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:33:03,185 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:33:03,192 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:33:03" (1/1) ... [2019-01-14 02:33:03,192 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:33:03" (1/1) ... [2019-01-14 02:33:03,196 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:33:03" (1/1) ... [2019-01-14 02:33:03,196 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:33:03" (1/1) ... [2019-01-14 02:33:03,201 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:33:03" (1/1) ... [2019-01-14 02:33:03,206 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:33:03" (1/1) ... [2019-01-14 02:33:03,208 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:33:03" (1/1) ... [2019-01-14 02:33:03,211 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:33:03,211 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:33:03,211 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:33:03,212 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:33:03,212 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:33:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 02:33:03,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:33:03,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:33:03,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 02:33:03,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:33:03,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:33:03,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:33:03,718 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:33:03,718 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-14 02:33:03,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:33:03 BoogieIcfgContainer [2019-01-14 02:33:03,720 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:33:03,721 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:33:03,721 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:33:03,723 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:33:03,724 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:33:03,724 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:33:02" (1/3) ... [2019-01-14 02:33:03,725 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@59d72e10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:33:03, skipping insertion in model container [2019-01-14 02:33:03,725 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:33:03,725 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:33:03" (2/3) ... [2019-01-14 02:33:03,727 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@59d72e10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:33:03, skipping insertion in model container [2019-01-14 02:33:03,727 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:33:03,727 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:33:03" (3/3) ... [2019-01-14 02:33:03,729 INFO L375 chiAutomizerObserver]: Analyzing ICFG gcd1-alloca_true-termination.c.i [2019-01-14 02:33:03,785 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:33:03,785 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:33:03,786 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:33:03,786 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:33:03,786 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:33:03,787 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:33:03,787 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:33:03,787 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:33:03,787 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:33:03,800 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-01-14 02:33:03,820 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:33:03,820 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:33:03,820 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:33:03,828 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:33:03,828 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 02:33:03,828 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:33:03,828 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-01-14 02:33:03,830 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:33:03,831 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:33:03,831 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:33:03,831 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:33:03,831 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 02:33:03,840 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.allocOnStack(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.allocOnStack(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.allocOnStack(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 [2019-01-14 02:33:03,842 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 [2019-01-14 02:33:03,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:33:03,848 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2019-01-14 02:33:03,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:33:03,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:33:03,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:03,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:33:03,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:03,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:04,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:04,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:33:04,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1513768, now seen corresponding path program 1 times [2019-01-14 02:33:04,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:33:04,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:33:04,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:04,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:33:04,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:04,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:33:04,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:33:04,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:33:04,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 02:33:04,075 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:33:04,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-14 02:33:04,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 02:33:04,093 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 2 states. [2019-01-14 02:33:04,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:33:04,101 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2019-01-14 02:33:04,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 02:33:04,103 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2019-01-14 02:33:04,105 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:33:04,109 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 10 states and 13 transitions. [2019-01-14 02:33:04,111 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-14 02:33:04,111 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-14 02:33:04,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2019-01-14 02:33:04,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:33:04,113 INFO L706 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-14 02:33:04,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2019-01-14 02:33:04,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-01-14 02:33:04,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-14 02:33:04,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-01-14 02:33:04,142 INFO L729 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-14 02:33:04,142 INFO L609 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-14 02:33:04,143 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:33:04,143 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2019-01-14 02:33:04,144 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:33:04,144 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:33:04,144 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:33:04,145 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:33:04,145 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 02:33:04,145 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.allocOnStack(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.allocOnStack(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.allocOnStack(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 [2019-01-14 02:33:04,145 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 [2019-01-14 02:33:04,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:33:04,148 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 2 times [2019-01-14 02:33:04,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:33:04,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:33:04,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:04,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:33:04,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:04,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:04,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:04,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:33:04,208 INFO L82 PathProgramCache]: Analyzing trace with hash 46919933, now seen corresponding path program 1 times [2019-01-14 02:33:04,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:33:04,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:33:04,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:04,210 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:33:04,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:04,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:04,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:04,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:33:04,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1985425099, now seen corresponding path program 1 times [2019-01-14 02:33:04,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:33:04,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:33:04,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:04,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:33:04,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:04,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:04,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:04,545 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-01-14 02:33:04,751 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-01-14 02:33:05,756 WARN L181 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 107 DAG size of output: 95 [2019-01-14 02:33:05,905 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-01-14 02:33:05,918 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:33:05,919 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:33:05,919 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:33:05,919 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:33:05,920 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:33:05,920 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:33:05,920 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:33:05,920 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:33:05,920 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd1-alloca_true-termination.c.i_Iteration2_Lasso [2019-01-14 02:33:05,921 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:33:05,921 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:33:05,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:05,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:05,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:05,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:05,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:05,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:05,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:05,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:06,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:06,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:06,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:06,551 WARN L181 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 77 [2019-01-14 02:33:06,706 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-01-14 02:33:06,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:06,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:06,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:06,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:06,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:06,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:06,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:06,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:06,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:06,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:06,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:06,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:06,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:08,102 WARN L181 SmtUtils]: Spent 725.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-01-14 02:33:08,285 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:33:08,290 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:33:08,293 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:08,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:08,298 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:08,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:08,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:08,299 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:08,302 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:08,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:08,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:08,305 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:08,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:08,309 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:08,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:08,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:08,310 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:08,310 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:08,310 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:08,313 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:08,314 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:08,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:08,315 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:08,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:08,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:08,315 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:08,316 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:08,316 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:08,317 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:08,317 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:08,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:08,318 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:08,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:08,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:08,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:08,319 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:08,319 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:08,319 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:08,320 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:08,320 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:08,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:08,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:08,321 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:08,325 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:08,325 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:08,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:08,330 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:08,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:08,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:08,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:08,331 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:08,334 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:08,334 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:08,339 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:08,340 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:08,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:08,341 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:08,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:08,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:08,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:08,342 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:08,343 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:08,345 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:08,345 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:08,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:08,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:08,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:08,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:08,350 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:08,350 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:08,353 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:08,354 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:08,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:08,355 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:08,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:08,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:08,355 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:08,355 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:08,356 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:08,356 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:08,357 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:08,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:08,360 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:08,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:08,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:08,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:08,360 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:08,362 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:08,363 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:08,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 [2019-01-14 02:33:08,365 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:08,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:08,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:08,365 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:08,368 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:08,369 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:08,372 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:08,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 [2019-01-14 02:33:08,373 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:08,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:08,373 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:08,373 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:08,381 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:08,381 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:08,395 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:08,395 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:08,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:08,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:08,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:08,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:08,404 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:08,404 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:08,434 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:33:08,460 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:33:08,460 INFO L444 ModelExtractionUtils]: 28 out of 31 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:33:08,465 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:33:08,468 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:33:08,469 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:33:08,469 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 [] [2019-01-14 02:33:08,617 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2019-01-14 02:33:08,626 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:33:08,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:33:08,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:33:08,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:33:08,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:08,783 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 [2019-01-14 02:33:08,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:08,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:08,830 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 [2019-01-14 02:33:08,832 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:08,841 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:33:08,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:33:08,852 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2019-01-14 02:33:08,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:33:08,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:33:09,033 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 [2019-01-14 02:33:09,045 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 [2019-01-14 02:33:09,046 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:09,118 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 [2019-01-14 02:33:09,120 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-14 02:33:09,154 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:33:09,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:33:09,191 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:34, output treesize:56 [2019-01-14 02:33:09,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:33:09,319 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 [2019-01-14 02:33:09,320 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 7 states. [2019-01-14 02:33:09,508 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. [2019-01-14 02:33:09,509 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 [2019-01-14 02:33:09,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 02:33:09,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2019-01-14 02:33:09,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 5 letters. Loop has 5 letters. [2019-01-14 02:33:09,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:33:09,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 10 letters. Loop has 5 letters. [2019-01-14 02:33:09,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:33:09,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 5 letters. Loop has 10 letters. [2019-01-14 02:33:09,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:33:09,514 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2019-01-14 02:33:09,516 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-14 02:33:09,517 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 27 states and 34 transitions. [2019-01-14 02:33:09,517 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-01-14 02:33:09,518 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-01-14 02:33:09,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 34 transitions. [2019-01-14 02:33:09,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:33:09,518 INFO L706 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-01-14 02:33:09,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 34 transitions. [2019-01-14 02:33:09,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 19. [2019-01-14 02:33:09,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-14 02:33:09,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2019-01-14 02:33:09,521 INFO L729 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-01-14 02:33:09,521 INFO L609 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-01-14 02:33:09,521 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:33:09,521 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2019-01-14 02:33:09,523 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:33:09,523 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:33:09,523 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:33:09,523 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:33:09,524 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 02:33:09,524 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.allocOnStack(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.allocOnStack(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.allocOnStack(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 [2019-01-14 02:33:09,524 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 [2019-01-14 02:33:09,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:33:09,524 INFO L82 PathProgramCache]: Analyzing trace with hash 28695751, now seen corresponding path program 1 times [2019-01-14 02:33:09,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:33:09,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:33:09,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:09,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:33:09,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:09,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:09,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:09,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:33:09,557 INFO L82 PathProgramCache]: Analyzing trace with hash 46919933, now seen corresponding path program 2 times [2019-01-14 02:33:09,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:33:09,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:33:09,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:09,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:33:09,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:09,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:09,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:09,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:33:09,579 INFO L82 PathProgramCache]: Analyzing trace with hash -2042683401, now seen corresponding path program 1 times [2019-01-14 02:33:09,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:33:09,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:33:09,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:09,581 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:33:09,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:09,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:09,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:09,801 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-01-14 02:33:10,196 WARN L181 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 99 [2019-01-14 02:33:10,315 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-01-14 02:33:10,319 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:33:10,319 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:33:10,319 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:33:10,319 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:33:10,319 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:33:10,319 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:33:10,319 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:33:10,320 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:33:10,320 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd1-alloca_true-termination.c.i_Iteration3_Lasso [2019-01-14 02:33:10,320 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:33:10,320 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:33:10,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:10,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:10,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:10,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:10,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:10,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:10,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:10,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:10,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:10,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:10,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:10,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:10,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:10,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:10,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:10,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:10,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:10,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:10,755 WARN L181 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2019-01-14 02:33:11,101 WARN L181 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-01-14 02:33:11,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:11,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:11,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:11,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:11,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:11,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:12,064 WARN L181 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-01-14 02:33:12,284 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:33:12,285 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:33:12,285 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:12,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:12,287 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:12,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:12,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:12,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:12,288 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:12,289 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:12,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:12,291 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:12,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:12,292 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:12,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:12,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:12,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:12,292 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:12,293 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:12,294 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:12,294 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:12,294 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:12,295 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:12,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:12,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:12,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:12,295 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:12,295 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:12,297 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:12,297 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:12,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:12,298 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:12,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:12,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:12,298 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:12,299 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:12,299 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:12,299 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:12,299 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:12,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:12,300 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:12,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:12,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:12,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:12,301 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:12,303 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:12,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:12,304 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:12,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:12,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:12,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:12,305 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:12,309 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:12,310 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:12,318 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:12,320 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:12,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:12,321 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:12,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:12,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:12,321 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:12,321 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:12,322 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:12,322 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:12,323 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:12,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:12,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:12,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:12,327 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:12,330 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:12,330 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:12,339 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:12,340 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:12,340 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:12,340 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:12,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:12,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:12,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:12,343 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:12,343 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:12,346 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:12,348 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:12,351 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:12,351 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:12,351 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:12,351 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:12,351 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:12,351 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:12,352 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:12,352 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:12,353 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:12,361 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:12,361 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:12,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:12,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:12,361 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:12,362 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:12,362 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:12,363 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:12,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 [2019-01-14 02:33:12,364 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:12,365 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:12,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:12,366 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:12,366 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:12,366 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:12,366 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:12,367 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:12,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 [2019-01-14 02:33:12,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:12,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:12,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:12,368 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:12,369 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:12,371 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:12,375 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:12,376 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:12,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:12,376 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:12,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:12,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:12,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:12,377 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:12,377 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:12,378 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:12,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 [2019-01-14 02:33:12,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:12,380 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:12,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:12,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:12,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:12,380 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:12,381 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:12,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:12,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:12,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:12,383 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:12,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:12,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:12,383 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:12,383 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:12,383 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:12,384 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:12,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 [2019-01-14 02:33:12,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:12,385 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:12,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:12,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:12,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:12,386 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:12,386 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:12,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:12,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 [2019-01-14 02:33:12,388 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:12,388 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2019-01-14 02:33:12,388 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:12,388 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:12,393 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-01-14 02:33:12,393 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:12,460 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:12,461 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:12,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:12,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:12,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:12,462 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:12,463 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:12,465 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:12,467 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:12,467 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:12,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:12,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:12,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:12,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:12,472 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:12,472 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:12,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:12,481 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:12,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:12,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:12,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:12,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:12,482 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:12,482 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:12,485 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:12,485 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:12,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:12,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:12,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:12,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:12,487 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:12,487 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:12,488 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:12,489 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:12,489 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:12,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:12,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:12,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:12,494 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:12,494 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:12,515 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:12,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 [2019-01-14 02:33:12,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:12,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:12,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:12,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:12,520 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:12,520 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:12,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:12,530 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:12,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:12,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:12,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:12,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:12,536 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:12,537 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:12,543 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:12,543 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:12,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:12,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:12,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:12,546 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:12,548 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:12,548 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:12,577 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:33:12,592 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:33:12,594 INFO L444 ModelExtractionUtils]: 28 out of 31 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:33:12,595 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:33:12,596 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:33:12,596 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:33:12,596 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 [] [2019-01-14 02:33:12,758 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2019-01-14 02:33:12,760 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:33:12,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:33:12,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:33:12,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:33:12,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:12,820 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 [2019-01-14 02:33:12,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:12,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:12,879 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 [2019-01-14 02:33:12,880 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:12,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:33:12,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:33:12,900 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2019-01-14 02:33:12,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:33:12,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:33:13,101 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 [2019-01-14 02:33:13,119 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 [2019-01-14 02:33:13,122 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 02:33:13,216 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 [2019-01-14 02:33:13,217 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:13,240 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:33:13,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:33:13,263 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:34, output treesize:56 [2019-01-14 02:33:13,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:33:13,398 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 [2019-01-14 02:33:13,398 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 7 Second operand 7 states. [2019-01-14 02:33:13,516 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. [2019-01-14 02:33:13,517 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 [2019-01-14 02:33:13,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 02:33:13,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2019-01-14 02:33:13,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 5 letters. Loop has 5 letters. [2019-01-14 02:33:13,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:33:13,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 10 letters. Loop has 5 letters. [2019-01-14 02:33:13,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:33:13,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 5 letters. Loop has 10 letters. [2019-01-14 02:33:13,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:33:13,520 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 49 transitions. [2019-01-14 02:33:13,522 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-14 02:33:13,523 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 36 states and 45 transitions. [2019-01-14 02:33:13,523 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-01-14 02:33:13,523 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-01-14 02:33:13,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 45 transitions. [2019-01-14 02:33:13,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:33:13,524 INFO L706 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2019-01-14 02:33:13,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 45 transitions. [2019-01-14 02:33:13,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 19. [2019-01-14 02:33:13,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-14 02:33:13,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2019-01-14 02:33:13,527 INFO L729 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-01-14 02:33:13,527 INFO L609 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-01-14 02:33:13,527 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:33:13,527 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2019-01-14 02:33:13,528 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:33:13,528 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:33:13,528 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:33:13,528 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:33:13,528 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:33:13,529 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.allocOnStack(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.allocOnStack(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.allocOnStack(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~mem13;havoc gcd_#t~mem14; 489#L557-3 [2019-01-14 02:33:13,529 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~mem13;havoc gcd_#t~mem14; 489#L557-3 [2019-01-14 02:33:13,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:33:13,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1182880019, now seen corresponding path program 1 times [2019-01-14 02:33:13,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:33:13,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:33:13,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:13,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:33:13,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:13,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:13,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:13,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:33:13,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1894, now seen corresponding path program 1 times [2019-01-14 02:33:13,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:33:13,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:33:13,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:13,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:33:13,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:13,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:13,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:13,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:33:13,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1418634248, now seen corresponding path program 2 times [2019-01-14 02:33:13,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:33:13,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:33:13,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:13,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:33:13,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:13,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:13,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:13,783 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-01-14 02:33:14,484 WARN L181 SmtUtils]: Spent 651.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 115 [2019-01-14 02:33:14,630 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-01-14 02:33:14,633 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:33:14,633 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:33:14,633 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:33:14,633 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:33:14,634 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:33:14,634 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:33:14,634 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:33:14,634 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:33:14,634 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd1-alloca_true-termination.c.i_Iteration4_Lasso [2019-01-14 02:33:14,634 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:33:14,634 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:33:14,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:14,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:14,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:14,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:14,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:14,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:14,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:14,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:14,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:14,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:14,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:14,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:14,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:15,060 WARN L181 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2019-01-14 02:33:15,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:15,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:15,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:15,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:15,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:15,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:15,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:15,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:15,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:15,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:15,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:16,066 WARN L181 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-01-14 02:33:16,154 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:33:16,155 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:33:16,155 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:16,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:16,156 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:16,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:16,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:16,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:16,160 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:16,160 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:16,161 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:16,161 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:16,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:16,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:16,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:16,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:16,165 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:16,166 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:16,167 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:16,167 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:16,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:16,168 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:16,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:16,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:16,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:16,168 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:16,168 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:16,169 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:16,169 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:16,169 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:16,169 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:16,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:16,170 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:16,170 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:16,170 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:16,170 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:16,170 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:16,171 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:16,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:16,171 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:16,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:16,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:16,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:16,172 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:16,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:16,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:16,173 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:16,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:16,173 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:16,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:16,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:16,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:16,174 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:16,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:16,174 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:16,174 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:16,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:16,175 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:16,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:16,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:16,175 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:16,175 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:16,175 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:16,176 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:16,176 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:16,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:16,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:16,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:16,177 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:16,177 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:16,177 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:16,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:16,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:16,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:16,180 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:16,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:16,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:16,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:16,181 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:16,181 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:16,181 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:16,181 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:16,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:16,182 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:16,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:16,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:16,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:16,182 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:16,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:16,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:16,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:16,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:16,184 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:16,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:16,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:16,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:16,184 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:16,184 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:16,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:16,185 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:16,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:16,185 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:16,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:16,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:16,186 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:16,186 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:16,186 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:16,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:16,187 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:16,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:16,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:16,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:16,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:16,190 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:16,190 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:16,199 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:16,200 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:16,200 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:16,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:16,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:16,201 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:16,201 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:16,201 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:16,205 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:16,206 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:16,206 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:16,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:16,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:16,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:16,207 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:16,207 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:16,209 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:16,209 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:16,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:16,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:16,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:16,210 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:16,210 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:16,210 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:16,211 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:16,212 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:16,212 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:16,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:16,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:16,213 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:16,214 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:16,214 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:16,225 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:33:16,235 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:33:16,235 INFO L444 ModelExtractionUtils]: 23 out of 31 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:33:16,236 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:33:16,237 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2019-01-14 02:33:16,237 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:33:16,237 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_gcd_~r~0.base) ULTIMATE.start_gcd_~r~0.offset)_3, v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_3, ULTIMATE.start_gcd_#in~y) = 2*v_rep(select (select #memory_int ULTIMATE.start_gcd_~r~0.base) ULTIMATE.start_gcd_~r~0.offset)_3 - 2*v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_3 + 1*ULTIMATE.start_gcd_#in~y Supporting invariants [1*ULTIMATE.start_gcd_#in~y - 1 >= 0, 1*v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_3 - 1 >= 0] [2019-01-14 02:33:16,815 INFO L297 tatePredicateManager]: 17 out of 22 supporting invariants were superfluous and have been removed [2019-01-14 02:33:16,832 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:33:16,833 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:33:16,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:33:16,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:33:16,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:33:16,900 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 [2019-01-14 02:33:16,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:16,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:16,915 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 [2019-01-14 02:33:16,915 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:16,921 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:33:16,949 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 [2019-01-14 02:33:16,953 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 [2019-01-14 02:33:16,953 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:16,983 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 [2019-01-14 02:33:16,991 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 [2019-01-14 02:33:16,991 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:17,029 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 [2019-01-14 02:33:17,030 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2019-01-14 02:33:17,048 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:33:17,063 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:33:17,092 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. [2019-01-14 02:33:17,092 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:49, output treesize:45 [2019-01-14 02:33:17,294 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 30 treesize of output 59 [2019-01-14 02:33:17,313 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 45 treesize of output 44 [2019-01-14 02:33:17,314 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:17,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-01-14 02:33:17,379 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:17,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:33:17,419 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. [2019-01-14 02:33:17,420 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:41, output treesize:37 [2019-01-14 02:33:17,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:33:17,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:33:17,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:33:17,562 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 [2019-01-14 02:33:17,562 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 7 Second operand 6 states. [2019-01-14 02:33:17,768 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 7. Second operand 6 states. Result 37 states and 47 transitions. Complement of second has 11 states. [2019-01-14 02:33:17,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 2 non-accepting loop states 2 accepting loop states [2019-01-14 02:33:17,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 02:33:17,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 25 transitions. [2019-01-14 02:33:17,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 25 transitions. Stem has 9 letters. Loop has 2 letters. [2019-01-14 02:33:17,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:33:17,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 25 transitions. Stem has 11 letters. Loop has 2 letters. [2019-01-14 02:33:17,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:33:17,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 25 transitions. Stem has 9 letters. Loop has 4 letters. [2019-01-14 02:33:17,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:33:17,773 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 47 transitions. [2019-01-14 02:33:17,774 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:33:17,775 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 36 states and 46 transitions. [2019-01-14 02:33:17,775 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-01-14 02:33:17,775 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-01-14 02:33:17,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 46 transitions. [2019-01-14 02:33:17,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:33:17,776 INFO L706 BuchiCegarLoop]: Abstraction has 36 states and 46 transitions. [2019-01-14 02:33:17,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 46 transitions. [2019-01-14 02:33:17,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 29. [2019-01-14 02:33:17,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-14 02:33:17,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2019-01-14 02:33:17,779 INFO L729 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2019-01-14 02:33:17,779 INFO L609 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2019-01-14 02:33:17,779 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:33:17,780 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 38 transitions. [2019-01-14 02:33:17,780 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:33:17,781 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:33:17,781 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:33:17,785 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:33:17,785 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:33:17,785 INFO L794 eck$LassoCheckResult]: Stem: 707#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 696#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.allocOnStack(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.allocOnStack(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.allocOnStack(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); 697#L553 assume gcd_#t~mem5 < 0;havoc gcd_#t~mem5;call gcd_#t~mem6 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(-gcd_#t~mem6, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);havoc gcd_#t~mem6; 698#L553-2 call gcd_#t~mem7 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 708#L554 assume !(gcd_#t~mem7 < 0);havoc gcd_#t~mem7; 714#L555-2 call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 704#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; 719#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); 709#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~mem13;havoc gcd_#t~mem14; 710#L557-3 [2019-01-14 02:33:17,785 INFO L796 eck$LassoCheckResult]: Loop: 710#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); 715#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~mem13;havoc gcd_#t~mem14; 710#L557-3 [2019-01-14 02:33:17,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:33:17,786 INFO L82 PathProgramCache]: Analyzing trace with hash -592127343, now seen corresponding path program 1 times [2019-01-14 02:33:17,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:33:17,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:33:17,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:17,792 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:33:17,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:17,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:17,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:17,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:33:17,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1894, now seen corresponding path program 2 times [2019-01-14 02:33:17,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:33:17,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:33:17,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:17,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:33:17,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:17,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:17,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:17,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:33:17,842 INFO L82 PathProgramCache]: Analyzing trace with hash -2098692618, now seen corresponding path program 2 times [2019-01-14 02:33:17,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:33:17,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:33:17,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:17,845 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:33:17,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:17,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:17,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:18,054 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-01-14 02:33:18,642 WARN L181 SmtUtils]: Spent 568.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 125 [2019-01-14 02:33:18,869 WARN L181 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2019-01-14 02:33:18,872 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:33:18,872 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:33:18,872 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:33:18,873 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:33:18,873 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:33:18,873 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:33:18,873 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:33:18,873 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:33:18,873 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd1-alloca_true-termination.c.i_Iteration5_Lasso [2019-01-14 02:33:18,873 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:33:18,873 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:33:18,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:18,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:18,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:18,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:18,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:18,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:18,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:18,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:18,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:18,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:18,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:19,276 WARN L181 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 76 [2019-01-14 02:33:19,382 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-01-14 02:33:19,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:19,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:19,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:19,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:19,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:19,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:19,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:19,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:19,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:19,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:19,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:19,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:19,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:19,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:20,132 WARN L181 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-01-14 02:33:20,287 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:33:20,287 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:33:20,288 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:20,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:20,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:20,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:20,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:20,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:20,293 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:20,293 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:20,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:20,294 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:20,294 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:20,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:20,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:20,297 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:20,298 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:20,298 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:20,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:20,301 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:20,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:20,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:20,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:20,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:20,303 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:20,303 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:20,307 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:20,307 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:20,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:20,308 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:20,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:20,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:20,308 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:20,308 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:20,308 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:20,309 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:20,309 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:20,309 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:20,309 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:20,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:20,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:20,315 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:20,315 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:20,315 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:20,316 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:20,316 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:20,317 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:20,317 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:20,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:20,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:20,317 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:20,317 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:20,317 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:20,318 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:20,318 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:20,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:20,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:20,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:20,319 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:20,319 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:20,319 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:20,323 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:20,324 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:20,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:20,324 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:20,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:20,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:20,325 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:20,325 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:20,325 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:20,326 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:20,330 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:20,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:20,331 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:20,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:20,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:20,331 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:20,331 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:20,331 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:20,332 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:20,332 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:20,332 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:20,332 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:20,332 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:20,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:20,333 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:20,335 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:20,335 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:20,336 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:20,336 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:20,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:20,336 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:20,336 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:20,337 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:20,339 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:20,340 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:20,346 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:20,349 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:20,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:20,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:20,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:20,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:20,350 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:20,350 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:20,352 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:20,355 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:20,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:20,356 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2019-01-14 02:33:20,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:20,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:20,364 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-01-14 02:33:20,364 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:20,397 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:20,397 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:20,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:20,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:20,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:20,401 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:20,402 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:20,402 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:20,403 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:20,403 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:20,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:20,404 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:20,404 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:20,404 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:20,405 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:20,407 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:20,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:20,409 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:20,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:20,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:20,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:20,410 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:20,414 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:20,414 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:20,431 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:20,431 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:20,436 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:20,436 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:20,436 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:20,436 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:20,437 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:20,437 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:20,444 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:20,445 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:20,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:20,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:20,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:20,448 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:20,453 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:20,453 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:20,466 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:33:20,476 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:33:20,478 INFO L444 ModelExtractionUtils]: 25 out of 31 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:33:20,479 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:33:20,480 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-14 02:33:20,481 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:33:20,482 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, v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_4) = 2*v_rep(select (select #memory_int ULTIMATE.start_gcd_~r~0.base) ULTIMATE.start_gcd_~r~0.offset)_4 - 2*v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_4 + 1 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_4 - 1 >= 0] [2019-01-14 02:33:20,712 INFO L297 tatePredicateManager]: 17 out of 21 supporting invariants were superfluous and have been removed [2019-01-14 02:33:20,721 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:33:20,722 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:33:20,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:33:20,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:33:20,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:33:20,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:20,800 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 [2019-01-14 02:33:20,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:20,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:20,826 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 [2019-01-14 02:33:20,827 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:20,837 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:33:20,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 [2019-01-14 02:33:20,861 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 [2019-01-14 02:33:20,861 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:20,875 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 19 treesize of output 20 [2019-01-14 02:33:20,879 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 [2019-01-14 02:33:20,879 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:20,886 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:33:20,899 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:33:20,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:33:20,914 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:54, output treesize:20 [2019-01-14 02:33:20,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 16 treesize of output 11 [2019-01-14 02:33:20,942 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 11 treesize of output 8 [2019-01-14 02:33:20,943 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:20,945 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:33:20,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:33:20,954 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:20 [2019-01-14 02:33:20,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 32 [2019-01-14 02:33:20,995 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 [2019-01-14 02:33:20,995 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:21,003 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:33:21,021 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. [2019-01-14 02:33:21,021 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:38 [2019-01-14 02:33:21,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:33:21,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:33:21,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:33:21,091 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 [2019-01-14 02:33:21,091 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 38 transitions. cyclomatic complexity: 12 Second operand 6 states. [2019-01-14 02:33:21,412 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 38 transitions. cyclomatic complexity: 12. Second operand 6 states. Result 37 states and 51 transitions. Complement of second has 10 states. [2019-01-14 02:33:21,413 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 [2019-01-14 02:33:21,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 02:33:21,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2019-01-14 02:33:21,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 9 letters. Loop has 2 letters. [2019-01-14 02:33:21,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:33:21,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 11 letters. Loop has 2 letters. [2019-01-14 02:33:21,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:33:21,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 9 letters. Loop has 4 letters. [2019-01-14 02:33:21,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:33:21,415 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 51 transitions. [2019-01-14 02:33:21,420 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:33:21,420 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 34 states and 45 transitions. [2019-01-14 02:33:21,420 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-01-14 02:33:21,421 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-01-14 02:33:21,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 45 transitions. [2019-01-14 02:33:21,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:33:21,421 INFO L706 BuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2019-01-14 02:33:21,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 45 transitions. [2019-01-14 02:33:21,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 23. [2019-01-14 02:33:21,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-14 02:33:21,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2019-01-14 02:33:21,426 INFO L729 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2019-01-14 02:33:21,427 INFO L609 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2019-01-14 02:33:21,427 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 02:33:21,427 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2019-01-14 02:33:21,427 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:33:21,427 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:33:21,427 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:33:21,432 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:33:21,432 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 02:33:21,432 INFO L794 eck$LassoCheckResult]: Stem: 928#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 918#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.allocOnStack(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.allocOnStack(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.allocOnStack(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); 919#L553 assume !(gcd_#t~mem5 < 0);havoc gcd_#t~mem5; 927#L553-2 call gcd_#t~mem7 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 929#L554 assume !(gcd_#t~mem7 < 0);havoc gcd_#t~mem7; 937#L555-2 call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 923#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; 933#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); 940#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~mem13;havoc gcd_#t~mem14; 939#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); 930#L557-1 assume !(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem11;havoc gcd_#t~mem12; 925#L557-4 [2019-01-14 02:33:21,432 INFO L796 eck$LassoCheckResult]: Loop: 925#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; 920#L555-2 call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 921#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; 935#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); 936#L557-1 assume !(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem11;havoc gcd_#t~mem12; 925#L557-4 [2019-01-14 02:33:21,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:33:21,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1418634250, now seen corresponding path program 1 times [2019-01-14 02:33:21,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:33:21,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:33:21,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:21,436 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:33:21,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:21,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:21,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:21,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:33:21,464 INFO L82 PathProgramCache]: Analyzing trace with hash 64312973, now seen corresponding path program 3 times [2019-01-14 02:33:21,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:33:21,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:33:21,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:21,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:33:21,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:21,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:21,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:21,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:33:21,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1038603336, now seen corresponding path program 1 times [2019-01-14 02:33:21,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:33:21,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:33:21,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:21,479 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:33:21,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:21,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:33:22,031 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 02:33:22,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:33:22,031 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 02:33:22,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:33:22,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:33:22,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:33:22,114 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 [2019-01-14 02:33:22,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:22,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:22,150 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 [2019-01-14 02:33:22,151 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:22,155 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:33:22,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:33:22,166 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2019-01-14 02:33:22,220 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 23 treesize of output 23 [2019-01-14 02:33:22,227 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 [2019-01-14 02:33:22,228 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:22,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:33:22,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:33:22,243 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:14 [2019-01-14 02:33:22,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:22,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:22,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:22,423 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 56 treesize of output 62 [2019-01-14 02:33:22,447 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 40 treesize of output 59 [2019-01-14 02:33:22,451 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-14 02:33:22,486 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 27 treesize of output 24 [2019-01-14 02:33:22,490 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 [2019-01-14 02:33:22,490 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:22,495 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:33:22,503 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:33:22,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:22,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:22,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:22,538 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 79 [2019-01-14 02:33:22,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 68 [2019-01-14 02:33:22,562 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:22,669 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 40 treesize of output 38 [2019-01-14 02:33:22,670 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:22,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:22,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:22,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:22,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:22,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:22,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:22,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 82 [2019-01-14 02:33:22,750 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 76 [2019-01-14 02:33:22,754 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-14 02:33:22,817 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:33:22,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:22,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:22,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:22,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 47 [2019-01-14 02:33:22,885 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 40 treesize of output 59 [2019-01-14 02:33:22,890 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-14 02:33:22,906 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:33:22,941 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:33:22,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:33:22,974 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 1 variables, input treesize:74, output treesize:95 [2019-01-14 02:33:23,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:23,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:23,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:23,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:23,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:23,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:23,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 88 [2019-01-14 02:33:23,104 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 76 [2019-01-14 02:33:23,107 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-14 02:33:23,141 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:33:23,192 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:33:23,194 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 37 treesize of output 32 [2019-01-14 02:33:23,197 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 [2019-01-14 02:33:23,198 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:23,207 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:33:23,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 02:33:23,267 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:125, output treesize:58 [2019-01-14 02:33:23,312 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 30 treesize of output 26 [2019-01-14 02:33:23,314 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 [2019-01-14 02:33:23,314 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:23,358 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 11 treesize of output 7 [2019-01-14 02:33:23,358 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:23,364 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:33:23,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:23,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:23,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:23,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:23,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 47 [2019-01-14 02:33:23,408 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 22 [2019-01-14 02:33:23,410 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 02:33:23,430 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 [2019-01-14 02:33:23,431 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:23,444 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 [2019-01-14 02:33:23,445 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:23,452 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:33:23,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:33:23,585 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:74, output treesize:9 [2019-01-14 02:33:23,614 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 02:33:23,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:33:23,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2019-01-14 02:33:23,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-14 02:33:23,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-01-14 02:33:23,775 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. cyclomatic complexity: 10 Second operand 15 states. [2019-01-14 02:33:24,466 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 27 [2019-01-14 02:33:24,635 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 29 [2019-01-14 02:33:24,983 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 41 [2019-01-14 02:33:25,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:33:25,025 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2019-01-14 02:33:25,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 02:33:25,027 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 37 transitions. [2019-01-14 02:33:25,029 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 02:33:25,029 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 28 states and 34 transitions. [2019-01-14 02:33:25,029 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-01-14 02:33:25,030 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-01-14 02:33:25,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 34 transitions. [2019-01-14 02:33:25,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:33:25,030 INFO L706 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2019-01-14 02:33:25,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 34 transitions. [2019-01-14 02:33:25,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2019-01-14 02:33:25,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-14 02:33:25,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2019-01-14 02:33:25,036 INFO L729 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2019-01-14 02:33:25,037 INFO L609 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2019-01-14 02:33:25,037 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 02:33:25,037 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2019-01-14 02:33:25,038 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 02:33:25,038 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:33:25,038 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:33:25,038 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:33:25,038 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2019-01-14 02:33:25,039 INFO L794 eck$LassoCheckResult]: Stem: 1059#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1053#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.allocOnStack(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.allocOnStack(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.allocOnStack(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); 1054#L553 assume !(gcd_#t~mem5 < 0);havoc gcd_#t~mem5; 1058#L553-2 call gcd_#t~mem7 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 1060#L554 assume !(gcd_#t~mem7 < 0);havoc gcd_#t~mem7; 1069#L555-2 call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 1073#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; 1072#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); 1071#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~mem13;havoc gcd_#t~mem14; 1070#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); 1068#L557-1 assume !(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem11;havoc gcd_#t~mem12; 1055#L557-4 [2019-01-14 02:33:25,041 INFO L796 eck$LassoCheckResult]: Loop: 1055#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; 1056#L555-2 call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 1057#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; 1075#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); 1061#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~mem13;havoc gcd_#t~mem14; 1062#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); 1067#L557-1 assume !(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem11;havoc gcd_#t~mem12; 1055#L557-4 [2019-01-14 02:33:25,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:33:25,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1418634250, now seen corresponding path program 2 times [2019-01-14 02:33:25,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:33:25,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:33:25,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:25,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:33:25,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:25,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:25,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:25,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:33:25,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1675227762, now seen corresponding path program 1 times [2019-01-14 02:33:25,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:33:25,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:33:25,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:25,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:33:25,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:25,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:25,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:25,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:33:25,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1665390371, now seen corresponding path program 2 times [2019-01-14 02:33:25,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:33:25,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:33:25,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:25,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:33:25,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:25,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:25,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:25,420 WARN L181 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 80 [2019-01-14 02:33:26,058 WARN L181 SmtUtils]: Spent 587.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 130 [2019-01-14 02:33:26,224 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2019-01-14 02:33:26,229 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:33:26,229 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:33:26,229 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:33:26,230 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:33:26,230 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:33:26,230 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:33:26,230 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:33:26,230 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:33:26,230 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd1-alloca_true-termination.c.i_Iteration7_Lasso [2019-01-14 02:33:26,231 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:33:26,231 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:33:26,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:26,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:26,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:26,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:26,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:26,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:26,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:26,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:26,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:26,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:26,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:26,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:26,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:26,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:26,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:26,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:26,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:26,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:26,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:26,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:26,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:26,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:26,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:26,740 WARN L181 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2019-01-14 02:33:26,891 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-01-14 02:33:26,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:26,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:27,689 WARN L181 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-01-14 02:33:27,834 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:33:27,835 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:33:27,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 [2019-01-14 02:33:27,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:27,836 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:27,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:27,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:27,836 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:27,837 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:27,843 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:27,844 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:27,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 [2019-01-14 02:33:27,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:27,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:27,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:27,845 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:27,849 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:27,849 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:27,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:27,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 [2019-01-14 02:33:27,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:27,851 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:27,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:27,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:27,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:27,854 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:27,854 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:27,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:27,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 [2019-01-14 02:33:27,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:27,859 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:27,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:27,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:27,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:27,860 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:27,860 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:27,860 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:27,861 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:27,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:27,861 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:27,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:27,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:27,861 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:27,865 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:27,865 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:27,866 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:27,866 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:27,866 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:27,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:27,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:27,867 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:27,867 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:27,867 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:27,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:27,869 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:27,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:27,869 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:27,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:27,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:27,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:27,873 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:27,873 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:27,874 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:27,874 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:27,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:27,874 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:27,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:27,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:27,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:27,878 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:27,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:27,879 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:27,879 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:27,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:27,879 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:27,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:27,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:27,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:27,883 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:27,883 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:27,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:27,884 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:27,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:27,884 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:27,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:27,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:27,885 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:27,885 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:27,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:27,885 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:27,886 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:27,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:27,886 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:27,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:27,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:27,886 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:27,886 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:27,887 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:27,890 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:27,890 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:27,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:27,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:27,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:27,891 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:27,892 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:27,892 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:27,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:27,897 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:27,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:27,898 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:27,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:27,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:27,898 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:27,898 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:27,898 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:27,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:27,899 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:27,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:27,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:27,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:27,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:27,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:27,903 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:27,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:27,904 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:27,904 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:27,904 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:27,904 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:27,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:27,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:27,905 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:27,905 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:27,905 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:27,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:27,906 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:27,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:27,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:27,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:27,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:27,907 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:27,910 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:27,911 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:27,911 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:27,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:27,914 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:27,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:27,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:27,914 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:27,915 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:27,915 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:27,915 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:27,916 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:27,916 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:27,916 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:27,916 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:27,916 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:27,916 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:27,919 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:27,919 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:27,919 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:27,920 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:27,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:27,922 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:27,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:27,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:27,922 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:27,923 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:27,923 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:27,923 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:27,923 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:27,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:27,927 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:27,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:27,927 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:27,928 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:27,928 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:27,928 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:27,928 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:27,929 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:27,929 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:27,929 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:27,929 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:27,929 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:27,929 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:27,930 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:27,932 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:27,932 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:27,933 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:27,933 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:27,933 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:27,933 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:27,933 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:27,934 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:27,934 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:27,940 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:27,941 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:27,941 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:27,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:27,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:27,942 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:27,943 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:27,943 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:27,966 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:33:27,987 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:33:27,987 INFO L444 ModelExtractionUtils]: 28 out of 31 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:33:27,988 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:33:27,988 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:33:27,992 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:33:27,992 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 [] [2019-01-14 02:33:28,254 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2019-01-14 02:33:28,256 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:33:28,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:33:28,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:33:28,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:33:28,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:28,312 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 [2019-01-14 02:33:28,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:28,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:28,336 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 [2019-01-14 02:33:28,337 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:28,342 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:33:28,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:33:28,350 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2019-01-14 02:33:28,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:33:28,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:33:28,423 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 [2019-01-14 02:33:28,431 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 40 treesize of output 44 [2019-01-14 02:33:28,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:28,481 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 39 treesize of output 38 [2019-01-14 02:33:28,481 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:28,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 50 [2019-01-14 02:33:28,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 41 treesize of output 31 [2019-01-14 02:33:28,551 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:28,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 33 [2019-01-14 02:33:28,605 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2019-01-14 02:33:28,641 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:33:28,717 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 34 [2019-01-14 02:33:28,735 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 [2019-01-14 02:33:28,737 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2019-01-14 02:33:28,749 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:33:28,836 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:33:28,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:33:28,866 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 1 variables, input treesize:63, output treesize:95 [2019-01-14 02:33:28,978 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 [2019-01-14 02:33:28,986 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 [2019-01-14 02:33:28,987 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:28,999 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:33:29,058 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:33:29,059 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 59 treesize of output 54 [2019-01-14 02:33:29,064 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 36 treesize of output 30 [2019-01-14 02:33:29,065 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:29,077 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:33:29,134 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 [2019-01-14 02:33:29,137 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 [2019-01-14 02:33:29,138 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:29,159 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:33:29,200 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2019-01-14 02:33:29,201 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:161, output treesize:116 [2019-01-14 02:33:29,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:29,367 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 [2019-01-14 02:33:29,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:29,423 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 [2019-01-14 02:33:29,425 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:29,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:29,563 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 [2019-01-14 02:33:29,565 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2019-01-14 02:33:29,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:33:29,694 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. [2019-01-14 02:33:29,694 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:53, output treesize:118 [2019-01-14 02:33:29,857 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:33:29,858 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 [2019-01-14 02:33:29,858 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 8 Second operand 8 states. [2019-01-14 02:33:30,186 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-01-14 02:33:30,205 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. [2019-01-14 02:33:30,207 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 [2019-01-14 02:33:30,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-14 02:33:30,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 19 transitions. [2019-01-14 02:33:30,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 19 transitions. Stem has 11 letters. Loop has 7 letters. [2019-01-14 02:33:30,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:33:30,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 19 transitions. Stem has 18 letters. Loop has 7 letters. [2019-01-14 02:33:30,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:33:30,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 19 transitions. Stem has 11 letters. Loop has 14 letters. [2019-01-14 02:33:30,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:33:30,210 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 65 transitions. [2019-01-14 02:33:30,213 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 02:33:30,213 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 53 states and 63 transitions. [2019-01-14 02:33:30,214 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2019-01-14 02:33:30,214 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2019-01-14 02:33:30,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 63 transitions. [2019-01-14 02:33:30,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:33:30,214 INFO L706 BuchiCegarLoop]: Abstraction has 53 states and 63 transitions. [2019-01-14 02:33:30,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 63 transitions. [2019-01-14 02:33:30,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2019-01-14 02:33:30,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-14 02:33:30,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2019-01-14 02:33:30,218 INFO L729 BuchiCegarLoop]: Abstraction has 44 states and 54 transitions. [2019-01-14 02:33:30,218 INFO L609 BuchiCegarLoop]: Abstraction has 44 states and 54 transitions. [2019-01-14 02:33:30,218 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-14 02:33:30,218 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 54 transitions. [2019-01-14 02:33:30,219 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 02:33:30,219 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:33:30,219 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:33:30,220 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:33:30,220 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2019-01-14 02:33:30,220 INFO L794 eck$LassoCheckResult]: Stem: 1338#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1328#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.allocOnStack(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.allocOnStack(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.allocOnStack(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); 1329#L553 assume !(gcd_#t~mem5 < 0);havoc gcd_#t~mem5; 1337#L553-2 call gcd_#t~mem7 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 1339#L554 assume !(gcd_#t~mem7 < 0);havoc gcd_#t~mem7; 1349#L555-2 call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 1362#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; 1361#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); 1360#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~mem13;havoc gcd_#t~mem14; 1359#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); 1354#L557-1 assume !(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem11;havoc gcd_#t~mem12; 1351#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; 1330#L555-2 call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 1331#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; 1364#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); 1365#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~mem13;havoc gcd_#t~mem14; 1363#L557-3 [2019-01-14 02:33:30,220 INFO L796 eck$LassoCheckResult]: Loop: 1363#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); 1358#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~mem13;havoc gcd_#t~mem14; 1356#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); 1357#L557-1 assume !(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem11;havoc gcd_#t~mem12; 1334#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; 1335#L555-2 call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 1366#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; 1363#L557-3 [2019-01-14 02:33:30,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:33:30,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1038603334, now seen corresponding path program 3 times [2019-01-14 02:33:30,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:33:30,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:33:30,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:30,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:33:30,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:30,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:30,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:30,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:33:30,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1583190302, now seen corresponding path program 2 times [2019-01-14 02:33:30,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:33:30,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:33:30,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:30,257 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:33:30,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:30,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:30,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:30,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:33:30,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1194503927, now seen corresponding path program 4 times [2019-01-14 02:33:30,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:33:30,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:33:30,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:30,272 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:33:30,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:30,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:30,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:30,545 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-01-14 02:33:32,026 WARN L181 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 184 DAG size of output: 159 [2019-01-14 02:33:32,320 WARN L181 SmtUtils]: Spent 291.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-01-14 02:33:32,323 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:33:32,323 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:33:32,323 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:33:32,324 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:33:32,324 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:33:32,324 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:33:32,324 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:33:32,324 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:33:32,324 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd1-alloca_true-termination.c.i_Iteration8_Lasso [2019-01-14 02:33:32,324 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:33:32,324 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:33:32,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:33,205 WARN L181 SmtUtils]: Spent 720.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 83 [2019-01-14 02:33:33,335 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-01-14 02:33:33,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:33,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:33,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:33,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:33,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:33,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:33,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:33,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:33,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:33,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:33,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:33,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:33,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:33,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:33,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:33,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:33,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:33,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:33,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:33,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:33,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:33,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:33,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:33,785 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-14 02:33:34,359 WARN L181 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-01-14 02:33:34,636 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:33:34,636 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:33:34,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:34,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:34,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:34,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:34,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:34,643 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:34,643 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:34,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:34,648 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:34,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:34,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:34,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:34,648 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:34,653 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:34,653 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:34,659 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:34,660 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:34,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:34,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:34,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:34,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:34,662 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:34,662 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:34,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:34,671 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:34,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:34,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:34,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:34,672 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:34,677 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:34,677 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:34,712 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:33:34,721 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:33:34,721 INFO L444 ModelExtractionUtils]: 28 out of 31 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:33:34,722 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:33:34,724 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:33:34,725 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:33:34,725 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) = 1*v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_6 Supporting invariants [] [2019-01-14 02:33:35,324 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2019-01-14 02:33:35,352 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:33:35,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:33:35,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:33:35,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:33:35,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:35,742 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 [2019-01-14 02:33:35,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:35,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:35,769 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 [2019-01-14 02:33:35,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:35,773 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:33:35,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:33:35,780 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2019-01-14 02:33:35,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:33:35,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:33:35,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 [2019-01-14 02:33:35,831 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 [2019-01-14 02:33:35,831 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:35,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, 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 [2019-01-14 02:33:35,881 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2019-01-14 02:33:35,922 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:33:35,948 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:33:35,948 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:35, output treesize:54 [2019-01-14 02:33:36,150 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 [2019-01-14 02:33:36,154 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 [2019-01-14 02:33:36,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:36,219 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 [2019-01-14 02:33:36,220 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:36,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:36,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 67 [2019-01-14 02:33:36,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 [2019-01-14 02:33:36,304 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:36,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:36,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:36,352 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 [2019-01-14 02:33:36,353 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:36,381 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:33:36,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:36,460 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 [2019-01-14 02:33:36,473 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 [2019-01-14 02:33:36,476 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2019-01-14 02:33:36,501 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:33:36,582 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:33:36,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:33:36,624 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 1 variables, input treesize:76, output treesize:115 [2019-01-14 02:33:37,038 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-14 02:33:37,039 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:33:37,040 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 [2019-01-14 02:33:37,040 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44 states and 54 transitions. cyclomatic complexity: 14 Second operand 9 states. [2019-01-14 02:33:37,261 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 44 states and 54 transitions. cyclomatic complexity: 14. Second operand 9 states. Result 105 states and 126 transitions. Complement of second has 16 states. [2019-01-14 02:33:37,263 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 [2019-01-14 02:33:37,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-14 02:33:37,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 22 transitions. [2019-01-14 02:33:37,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 22 transitions. Stem has 16 letters. Loop has 7 letters. [2019-01-14 02:33:37,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:33:37,264 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:33:37,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:33:37,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:33:37,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:33:37,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:37,326 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 [2019-01-14 02:33:37,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:37,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:37,350 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 [2019-01-14 02:33:37,350 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:37,357 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:33:37,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:33:37,365 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2019-01-14 02:33:37,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:33:37,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:33:37,429 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 [2019-01-14 02:33:37,449 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 [2019-01-14 02:33:37,450 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:37,497 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 [2019-01-14 02:33:37,499 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2019-01-14 02:33:37,529 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:33:37,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:33:37,556 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:35, output treesize:54 [2019-01-14 02:33:37,785 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 [2019-01-14 02:33:37,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 55 [2019-01-14 02:33:37,808 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:37,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, 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 [2019-01-14 02:33:37,874 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:37,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:37,939 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 [2019-01-14 02:33:38,002 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 [2019-01-14 02:33:38,004 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2019-01-14 02:33:38,054 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:33:38,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:38,171 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 [2019-01-14 02:33:38,194 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 [2019-01-14 02:33:38,195 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:38,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:38,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:38,337 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 [2019-01-14 02:33:38,337 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:38,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:38,414 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 [2019-01-14 02:33:38,416 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2019-01-14 02:33:38,501 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:33:38,590 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:33:38,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:33:38,630 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 1 variables, input treesize:76, output treesize:115 [2019-01-14 02:33:38,754 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:33:38,756 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 [2019-01-14 02:33:38,756 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44 states and 54 transitions. cyclomatic complexity: 14 Second operand 9 states. [2019-01-14 02:33:38,970 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 44 states and 54 transitions. cyclomatic complexity: 14. Second operand 9 states. Result 105 states and 126 transitions. Complement of second has 16 states. [2019-01-14 02:33:38,973 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 [2019-01-14 02:33:38,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-14 02:33:38,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 22 transitions. [2019-01-14 02:33:38,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 22 transitions. Stem has 16 letters. Loop has 7 letters. [2019-01-14 02:33:38,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:33:38,974 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:33:38,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:33:39,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:33:39,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:33:39,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:39,028 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 [2019-01-14 02:33:39,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:39,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:39,051 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 [2019-01-14 02:33:39,052 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:39,055 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:33:39,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:33:39,062 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2019-01-14 02:33:39,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:33:39,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:33:39,109 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 [2019-01-14 02:33:39,132 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 [2019-01-14 02:33:39,134 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-01-14 02:33:39,175 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 [2019-01-14 02:33:39,175 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:39,198 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:33:39,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:33:39,222 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:35, output treesize:54 [2019-01-14 02:33:39,428 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 [2019-01-14 02:33:39,433 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 [2019-01-14 02:33:39,433 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:39,495 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 [2019-01-14 02:33:39,496 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:39,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:39,583 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 [2019-01-14 02:33:39,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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 [2019-01-14 02:33:39,604 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2019-01-14 02:33:39,963 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:33:40,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:40,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:40,130 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 [2019-01-14 02:33:40,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 66 [2019-01-14 02:33:40,200 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:40,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:40,470 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 [2019-01-14 02:33:40,472 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2019-01-14 02:33:40,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:40,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:40,584 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 [2019-01-14 02:33:40,585 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2019-01-14 02:33:40,710 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-01-14 02:33:40,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:40,873 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 [2019-01-14 02:33:40,973 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 57 treesize of output 57 [2019-01-14 02:33:40,974 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2019-01-14 02:33:41,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:41,152 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 [2019-01-14 02:33:41,152 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:41,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:41,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:41,256 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 [2019-01-14 02:33:41,256 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:41,331 INFO L267 ElimStorePlain]: Start of recursive call 11: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:33:41,395 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:33:41,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:33:41,434 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 1 variables, input treesize:76, output treesize:115 [2019-01-14 02:33:41,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:33:41,562 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 [2019-01-14 02:33:41,562 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44 states and 54 transitions. cyclomatic complexity: 14 Second operand 9 states. [2019-01-14 02:33:41,765 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 44 states and 54 transitions. cyclomatic complexity: 14. Second operand 9 states. Result 102 states and 123 transitions. Complement of second has 17 states. [2019-01-14 02:33:41,767 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 [2019-01-14 02:33:41,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-14 02:33:41,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2019-01-14 02:33:41,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 23 transitions. Stem has 16 letters. Loop has 7 letters. [2019-01-14 02:33:41,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:33:41,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 23 transitions. Stem has 23 letters. Loop has 7 letters. [2019-01-14 02:33:41,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:33:41,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 23 transitions. Stem has 16 letters. Loop has 14 letters. [2019-01-14 02:33:41,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:33:41,770 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 102 states and 123 transitions. [2019-01-14 02:33:41,771 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:33:41,772 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 102 states to 68 states and 83 transitions. [2019-01-14 02:33:41,772 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-01-14 02:33:41,772 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2019-01-14 02:33:41,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 83 transitions. [2019-01-14 02:33:41,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:33:41,773 INFO L706 BuchiCegarLoop]: Abstraction has 68 states and 83 transitions. [2019-01-14 02:33:41,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 83 transitions. [2019-01-14 02:33:41,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 59. [2019-01-14 02:33:41,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-14 02:33:41,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2019-01-14 02:33:41,779 INFO L729 BuchiCegarLoop]: Abstraction has 59 states and 73 transitions. [2019-01-14 02:33:41,779 INFO L609 BuchiCegarLoop]: Abstraction has 59 states and 73 transitions. [2019-01-14 02:33:41,779 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-14 02:33:41,779 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 73 transitions. [2019-01-14 02:33:41,780 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:33:41,780 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:33:41,780 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:33:41,782 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:33:41,782 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:33:41,782 INFO L794 eck$LassoCheckResult]: Stem: 2104#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2093#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.allocOnStack(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.allocOnStack(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.allocOnStack(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); 2094#L553 assume !(gcd_#t~mem5 < 0);havoc gcd_#t~mem5; 2103#L553-2 call gcd_#t~mem7 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 2105#L554 assume !(gcd_#t~mem7 < 0);havoc gcd_#t~mem7; 2113#L555-2 call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 2120#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; 2119#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); 2116#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~mem13;havoc gcd_#t~mem14; 2117#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); 2146#L557-1 assume !(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem11;havoc gcd_#t~mem12; 2144#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; 2122#L555-2 call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 2142#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; 2140#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); 2137#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~mem13;havoc gcd_#t~mem14; 2136#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); 2106#L557-1 [2019-01-14 02:33:41,782 INFO L796 eck$LassoCheckResult]: Loop: 2106#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~mem13;havoc gcd_#t~mem14; 2107#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); 2106#L557-1 [2019-01-14 02:33:41,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:33:41,783 INFO L82 PathProgramCache]: Analyzing trace with hash -2131932253, now seen corresponding path program 5 times [2019-01-14 02:33:41,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:33:41,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:33:41,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:41,784 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:33:41,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:41,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:41,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:41,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:33:41,816 INFO L82 PathProgramCache]: Analyzing trace with hash 2044, now seen corresponding path program 3 times [2019-01-14 02:33:41,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:33:41,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:33:41,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:41,817 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:33:41,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:41,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:41,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:41,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:33:41,821 INFO L82 PathProgramCache]: Analyzing trace with hash -87493858, now seen corresponding path program 6 times [2019-01-14 02:33:41,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:33:41,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:33:41,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:41,822 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:33:41,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:41,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:41,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:42,123 WARN L181 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-01-14 02:33:42,384 WARN L181 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-01-14 02:33:44,546 WARN L181 SmtUtils]: Spent 2.16 s on a formula simplification. DAG size of input: 192 DAG size of output: 176 [2019-01-14 02:33:45,034 WARN L181 SmtUtils]: Spent 484.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2019-01-14 02:33:45,038 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:33:45,038 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:33:45,039 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:33:45,039 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:33:45,039 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:33:45,039 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:33:45,039 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:33:45,039 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:33:45,039 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd1-alloca_true-termination.c.i_Iteration9_Lasso [2019-01-14 02:33:45,039 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:33:45,039 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:33:45,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:45,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:45,490 WARN L181 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 84 [2019-01-14 02:33:45,595 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-01-14 02:33:45,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:45,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:45,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:45,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:45,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:45,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:45,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:45,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:45,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:45,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:45,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:45,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:45,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:45,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:45,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:45,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:45,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:45,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:45,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:45,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:45,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:45,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:46,442 WARN L181 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-01-14 02:33:46,596 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:33:46,597 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:33:46,597 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:46,597 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:46,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:46,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:46,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:46,598 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:46,598 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:46,606 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:46,606 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:46,607 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:46,607 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:46,607 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:46,607 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:46,608 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:46,608 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:46,621 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:46,622 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:46,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:46,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:46,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:46,623 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:46,629 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:46,629 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:46,642 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:46,643 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:46,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:46,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:46,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:46,644 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:46,650 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:46,650 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:46,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:46,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 [2019-01-14 02:33:46,652 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:46,653 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2019-01-14 02:33:46,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:46,653 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:46,658 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-01-14 02:33:46,658 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:46,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:46,684 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:46,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:46,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:46,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:46,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:46,695 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:46,695 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:46,715 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:33:46,731 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:33:46,732 INFO L444 ModelExtractionUtils]: 27 out of 37 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:33:46,732 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:33:46,733 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2019-01-14 02:33:46,733 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:33:46,733 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, v_rep(select (select #memory_int ULTIMATE.start_gcd_~r~0.base) ULTIMATE.start_gcd_~r~0.offset)_7) = -2*v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_7 + 2*v_rep(select (select #memory_int ULTIMATE.start_gcd_~r~0.base) ULTIMATE.start_gcd_~r~0.offset)_7 + 1 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_7 - 1 >= 0, 1*v_rep(select (select #memory_int ULTIMATE.start_gcd_~r~0.base) ULTIMATE.start_gcd_~r~0.offset)_7 + 1*ULTIMATE.start_gcd_#t~mem12 - 1*ULTIMATE.start_gcd_#t~mem11 - 1*v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_7 >= 0] [2019-01-14 02:33:47,275 INFO L297 tatePredicateManager]: 20 out of 25 supporting invariants were superfluous and have been removed [2019-01-14 02:33:47,286 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:33:47,286 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:33:47,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:33:47,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:33:47,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:33:47,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:47,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 [2019-01-14 02:33:47,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:47,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:47,391 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 [2019-01-14 02:33:47,392 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:47,400 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:33:47,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:33:47,411 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:12 [2019-01-14 02:33:47,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 51 [2019-01-14 02:33:47,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 39 [2019-01-14 02:33:47,497 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:47,544 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 [2019-01-14 02:33:47,545 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:47,594 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 [2019-01-14 02:33:47,611 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 [2019-01-14 02:33:47,611 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2019-01-14 02:33:47,622 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:33:47,688 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 [2019-01-14 02:33:47,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 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 [2019-01-14 02:33:47,700 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:47,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 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2019-01-14 02:33:47,765 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2019-01-14 02:33:47,790 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:33:47,848 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 [2019-01-14 02:33:47,864 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 [2019-01-14 02:33:47,866 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2019-01-14 02:33:47,918 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 [2019-01-14 02:33:47,919 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:47,930 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:33:47,943 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:33:47,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:47,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, 2 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 [2019-01-14 02:33:47,982 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 [2019-01-14 02:33:47,982 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:47,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:47,997 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:33:47,998 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 [2019-01-14 02:33:48,001 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 [2019-01-14 02:33:48,001 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:48,006 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:33:48,013 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:33:48,237 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 [2019-01-14 02:33:48,246 WARN L307 Elim1Store]: Array PQE input equivalent to false [2019-01-14 02:33:48,246 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:48,491 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 [2019-01-14 02:33:48,494 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:48,727 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 [2019-01-14 02:33:48,727 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:48,951 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 [2019-01-14 02:33:48,951 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:49,201 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 45 [2019-01-14 02:33:49,206 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 [2019-01-14 02:33:49,206 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:49,215 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:33:49,441 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 [2019-01-14 02:33:49,456 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 [2019-01-14 02:33:49,458 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 2 xjuncts. [2019-01-14 02:33:49,520 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 31 treesize of output 34 [2019-01-14 02:33:49,521 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:49,545 INFO L267 ElimStorePlain]: Start of recursive call 24: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:33:49,685 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 [2019-01-14 02:33:49,692 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 [2019-01-14 02:33:49,692 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:49,702 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:33:49,778 INFO L267 ElimStorePlain]: Start of recursive call 17: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:33:49,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:33:49,814 INFO L202 ElimStorePlain]: Needed 28 recursive calls to eliminate 1 variables, input treesize:63, output treesize:23 [2019-01-14 02:33:50,087 INFO L303 Elim1Store]: Index analysis took 195 ms [2019-01-14 02:33:50,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, 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 [2019-01-14 02:33:50,145 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 [2019-01-14 02:33:50,145 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:50,231 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 [2019-01-14 02:33:50,232 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-14 02:33:50,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 [2019-01-14 02:33:50,286 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:50,317 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:33:50,357 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. [2019-01-14 02:33:50,357 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:113 [2019-01-14 02:33:53,279 WARN L181 SmtUtils]: Spent 2.90 s on a formula simplification. DAG size of input: 48 DAG size of output: 37 [2019-01-14 02:33:53,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:53,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 66 [2019-01-14 02:33:53,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:53,324 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 44 treesize of output 40 [2019-01-14 02:33:53,324 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:53,339 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:33:53,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:53,396 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 64 [2019-01-14 02:33:53,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:53,406 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 42 treesize of output 55 [2019-01-14 02:33:53,406 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:53,420 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:33:53,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-14 02:33:53,459 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:115, output treesize:79 [2019-01-14 02:33:54,177 WARN L181 SmtUtils]: Spent 494.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-01-14 02:33:54,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:33:54,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:33:54,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:54,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:54,314 INFO L303 Elim1Store]: Index analysis took 110 ms [2019-01-14 02:33:54,315 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 [2019-01-14 02:33:54,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:54,353 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 [2019-01-14 02:33:54,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:54,504 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:33:54,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:33:54,673 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:71, output treesize:36 [2019-01-14 02:33:55,048 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-14 02:33:55,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:33:55,049 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2019-01-14 02:33:55,049 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 59 states and 73 transitions. cyclomatic complexity: 20 Second operand 8 states. [2019-01-14 02:33:55,331 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 59 states and 73 transitions. cyclomatic complexity: 20. Second operand 8 states. Result 59 states and 73 transitions. Complement of second has 4 states. [2019-01-14 02:33:55,332 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 [2019-01-14 02:33:55,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-14 02:33:55,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2019-01-14 02:33:55,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 17 letters. Loop has 2 letters. [2019-01-14 02:33:55,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:33:55,334 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:33:55,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:33:55,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:33:55,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:33:55,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:55,414 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 [2019-01-14 02:33:55,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:55,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:55,440 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 [2019-01-14 02:33:55,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:55,446 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:33:55,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:33:55,457 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:12 [2019-01-14 02:33:55,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:55,515 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 38 [2019-01-14 02:33:55,518 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 [2019-01-14 02:33:55,518 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:55,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:33:55,532 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:33:55,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 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 [2019-01-14 02:33:55,537 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 [2019-01-14 02:33:55,537 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:55,541 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:33:55,547 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:33:55,577 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 [2019-01-14 02:33:55,582 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 [2019-01-14 02:33:55,582 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:55,627 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 [2019-01-14 02:33:55,628 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:55,681 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 45 [2019-01-14 02:33:55,685 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 [2019-01-14 02:33:55,685 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:55,693 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:33:55,772 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 [2019-01-14 02:33:55,789 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 [2019-01-14 02:33:55,789 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2019-01-14 02:33:55,798 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:33:55,819 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:33:55,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 66 [2019-01-14 02:33:55,883 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 [2019-01-14 02:33:55,883 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:56,155 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 [2019-01-14 02:33:56,155 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:56,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, 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 [2019-01-14 02:33:56,378 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:57,077 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 40 [2019-01-14 02:33:57,083 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 25 treesize of output 22 [2019-01-14 02:33:57,084 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 02:33:57,103 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 02:33:57,324 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 [2019-01-14 02:33:57,328 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 [2019-01-14 02:33:57,328 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:57,335 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:33:57,485 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 [2019-01-14 02:33:57,486 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:57,612 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 41 [2019-01-14 02:33:57,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 11 [2019-01-14 02:33:57,617 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:57,625 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:33:57,812 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 [2019-01-14 02:33:57,816 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 [2019-01-14 02:33:57,816 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:57,899 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 [2019-01-14 02:33:57,899 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:57,952 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 [2019-01-14 02:33:57,953 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 2 xjuncts. [2019-01-14 02:33:57,979 INFO L267 ElimStorePlain]: Start of recursive call 24: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:33:58,004 INFO L267 ElimStorePlain]: Start of recursive call 13: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:33:58,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:33:58,032 INFO L202 ElimStorePlain]: Needed 27 recursive calls to eliminate 1 variables, input treesize:63, output treesize:53 [2019-01-14 02:33:58,128 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 [2019-01-14 02:33:58,134 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 [2019-01-14 02:33:58,134 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:58,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, 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 [2019-01-14 02:33:58,215 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:58,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 30 treesize of output 37 [2019-01-14 02:33:58,275 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-01-14 02:33:58,310 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:33:58,352 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. [2019-01-14 02:33:58,352 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:113 [2019-01-14 02:34:01,301 WARN L181 SmtUtils]: Spent 2.92 s on a formula simplification. DAG size of input: 48 DAG size of output: 37 [2019-01-14 02:34:01,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:34:01,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 74 [2019-01-14 02:34:01,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:34:01,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2019-01-14 02:34:01,355 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:01,372 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:01,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:34:01,432 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 68 [2019-01-14 02:34:01,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:34:01,437 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 42 treesize of output 39 [2019-01-14 02:34:01,437 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:01,452 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:01,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-14 02:34:01,491 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:115, output treesize:79 [2019-01-14 02:34:01,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:34:01,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:34:01,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:34:01,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:34:01,595 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 [2019-01-14 02:34:01,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:34:01,599 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 [2019-01-14 02:34:01,600 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:01,608 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:01,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:01,619 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:71, output treesize:36 [2019-01-14 02:34:01,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:34:01,646 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.6 stem predicates 2 loop predicates [2019-01-14 02:34:01,646 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 59 states and 73 transitions. cyclomatic complexity: 20 Second operand 8 states. [2019-01-14 02:34:01,706 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 59 states and 73 transitions. cyclomatic complexity: 20. Second operand 8 states. Result 59 states and 73 transitions. Complement of second has 4 states. [2019-01-14 02:34:01,707 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 [2019-01-14 02:34:01,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-14 02:34:01,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2019-01-14 02:34:01,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 17 letters. Loop has 2 letters. [2019-01-14 02:34:01,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:34:01,708 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:34:01,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:34:01,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:34:01,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:34:01,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:34:01,782 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 [2019-01-14 02:34:01,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:34:01,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:34:01,807 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 [2019-01-14 02:34:01,807 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:01,815 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:01,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:01,824 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:12 [2019-01-14 02:34:01,908 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 [2019-01-14 02:34:01,913 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 [2019-01-14 02:34:01,913 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:01,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2019-01-14 02:34:01,964 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:02,037 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 [2019-01-14 02:34:02,045 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 [2019-01-14 02:34:02,046 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:02,103 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 [2019-01-14 02:34:02,104 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2019-01-14 02:34:02,123 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:34:02,210 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 [2019-01-14 02:34:02,225 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 [2019-01-14 02:34:02,226 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2019-01-14 02:34:02,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-01-14 02:34:02,273 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:02,285 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:02,301 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:02,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 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 [2019-01-14 02:34:02,355 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 [2019-01-14 02:34:02,355 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:02,863 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 [2019-01-14 02:34:02,864 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:03,095 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 [2019-01-14 02:34:03,095 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:03,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 39 [2019-01-14 02:34:03,337 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:03,542 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 [2019-01-14 02:34:03,546 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 [2019-01-14 02:34:03,546 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:03,555 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:03,723 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:34:03,742 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 54 [2019-01-14 02:34:03,744 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 3 xjuncts. [2019-01-14 02:34:03,963 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 [2019-01-14 02:34:03,984 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 [2019-01-14 02:34:03,985 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2019-01-14 02:34:03,998 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:04,111 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 [2019-01-14 02:34:04,116 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 02:34:04,225 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 02:34:04,334 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 34 [2019-01-14 02:34:04,335 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 02:34:04,471 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 02:34:04,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2019-01-14 02:34:04,587 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:04,683 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 02:34:04,803 INFO L267 ElimStorePlain]: Start of recursive call 21: 6 dim-1 vars, End of recursive call: 5 dim-0 vars, and 6 xjuncts. [2019-01-14 02:34:05,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 34 treesize of output 59 [2019-01-14 02:34:05,081 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 [2019-01-14 02:34:05,082 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:05,222 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 [2019-01-14 02:34:05,223 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 2 xjuncts. [2019-01-14 02:34:05,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-01-14 02:34:05,294 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:05,329 INFO L267 ElimStorePlain]: Start of recursive call 28: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:34:05,467 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 [2019-01-14 02:34:05,476 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 [2019-01-14 02:34:05,476 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:05,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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 [2019-01-14 02:34:05,577 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 2 xjuncts. [2019-01-14 02:34:05,621 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 [2019-01-14 02:34:05,622 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:05,638 INFO L267 ElimStorePlain]: Start of recursive call 32: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:05,656 INFO L267 ElimStorePlain]: Start of recursive call 11: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:05,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:34:05,666 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 38 [2019-01-14 02:34:05,669 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 [2019-01-14 02:34:05,669 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:05,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:34:05,686 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:34:05,688 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 [2019-01-14 02:34:05,692 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 [2019-01-14 02:34:05,692 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:05,699 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:05,706 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:05,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:05,729 INFO L202 ElimStorePlain]: Needed 39 recursive calls to eliminate 1 variables, input treesize:63, output treesize:23 [2019-01-14 02:34:05,799 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 [2019-01-14 02:34:05,808 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 [2019-01-14 02:34:05,809 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:05,893 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 [2019-01-14 02:34:05,894 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-14 02:34:05,945 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 [2019-01-14 02:34:05,946 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:05,978 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:34:06,019 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. [2019-01-14 02:34:06,019 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:113 [2019-01-14 02:34:08,973 WARN L181 SmtUtils]: Spent 2.92 s on a formula simplification. DAG size of input: 48 DAG size of output: 37 [2019-01-14 02:34:09,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:34:09,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 74 [2019-01-14 02:34:09,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:34:09,078 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 44 treesize of output 40 [2019-01-14 02:34:09,078 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:09,097 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:09,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:34:09,155 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 68 [2019-01-14 02:34:09,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:34:09,160 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 42 treesize of output 55 [2019-01-14 02:34:09,161 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:09,294 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:09,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-14 02:34:09,329 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:115, output treesize:79 [2019-01-14 02:34:09,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:34:09,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:34:09,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:34:09,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:34:09,409 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 [2019-01-14 02:34:09,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:34:09,414 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 [2019-01-14 02:34:09,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:09,423 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:09,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:09,435 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:71, output treesize:36 [2019-01-14 02:34:09,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:34:09,463 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2019-01-14 02:34:09,463 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 59 states and 73 transitions. cyclomatic complexity: 20 Second operand 8 states. [2019-01-14 02:34:09,690 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 59 states and 73 transitions. cyclomatic complexity: 20. Second operand 8 states. Result 78 states and 96 transitions. Complement of second has 11 states. [2019-01-14 02:34:09,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 6 stem states 0 non-accepting loop states 2 accepting loop states [2019-01-14 02:34:09,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-14 02:34:09,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 25 transitions. [2019-01-14 02:34:09,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 25 transitions. Stem has 17 letters. Loop has 2 letters. [2019-01-14 02:34:09,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:34:09,696 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:34:09,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:34:09,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:34:09,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:34:09,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:34:09,776 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 [2019-01-14 02:34:09,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:34:09,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:34:09,798 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 [2019-01-14 02:34:09,798 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:09,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:09,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:09,814 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:12 [2019-01-14 02:34:09,914 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 [2019-01-14 02:34:09,938 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 [2019-01-14 02:34:09,939 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:10,225 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 [2019-01-14 02:34:10,225 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:10,718 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 [2019-01-14 02:34:10,720 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:10,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 40 [2019-01-14 02:34:10,966 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 25 treesize of output 22 [2019-01-14 02:34:10,967 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 02:34:10,977 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 02:34:11,201 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:34:11,222 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 54 [2019-01-14 02:34:11,223 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 3 xjuncts. [2019-01-14 02:34:11,452 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 [2019-01-14 02:34:11,453 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:11,635 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 [2019-01-14 02:34:11,650 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 [2019-01-14 02:34:11,651 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2019-01-14 02:34:11,663 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:11,814 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 [2019-01-14 02:34:11,831 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 [2019-01-14 02:34:11,832 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2019-01-14 02:34:11,885 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 31 treesize of output 34 [2019-01-14 02:34:11,885 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:11,910 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:34:12,021 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 [2019-01-14 02:34:12,034 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 [2019-01-14 02:34:12,035 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:12,046 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:12,149 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 [2019-01-14 02:34:12,198 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 [2019-01-14 02:34:12,200 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2019-01-14 02:34:12,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2019-01-14 02:34:12,254 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:12,269 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:12,328 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 [2019-01-14 02:34:12,333 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 [2019-01-14 02:34:12,333 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:12,342 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:12,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:12,423 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 [2019-01-14 02:34:12,428 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 [2019-01-14 02:34:12,429 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:12,473 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 [2019-01-14 02:34:12,473 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:12,540 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 [2019-01-14 02:34:12,547 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 [2019-01-14 02:34:12,548 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:12,597 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 [2019-01-14 02:34:12,598 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 2 xjuncts. [2019-01-14 02:34:12,615 INFO L267 ElimStorePlain]: Start of recursive call 25: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:34:12,673 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 [2019-01-14 02:34:12,689 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 [2019-01-14 02:34:12,690 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 2 xjuncts. [2019-01-14 02:34:12,736 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 [2019-01-14 02:34:12,736 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:12,749 INFO L267 ElimStorePlain]: Start of recursive call 28: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:12,766 INFO L267 ElimStorePlain]: Start of recursive call 22: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:12,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:34:12,777 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 38 [2019-01-14 02:34:12,781 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 [2019-01-14 02:34:12,781 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:12,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:34:12,801 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:34:12,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2019-01-14 02:34:12,807 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 [2019-01-14 02:34:12,807 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:12,816 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:12,823 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:12,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:12,844 INFO L202 ElimStorePlain]: Needed 34 recursive calls to eliminate 1 variables, input treesize:63, output treesize:23 [2019-01-14 02:34:12,924 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 [2019-01-14 02:34:12,929 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 [2019-01-14 02:34:12,929 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:13,019 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 [2019-01-14 02:34:13,020 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-14 02:34:13,068 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 [2019-01-14 02:34:13,069 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:13,099 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:34:13,140 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. [2019-01-14 02:34:13,140 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:113 [2019-01-14 02:34:14,944 WARN L181 SmtUtils]: Spent 1.79 s on a formula simplification. DAG size of input: 48 DAG size of output: 37 [2019-01-14 02:34:15,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:34:15,253 INFO L303 Elim1Store]: Index analysis took 303 ms [2019-01-14 02:34:15,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 74 [2019-01-14 02:34:15,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:34:15,260 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 44 treesize of output 40 [2019-01-14 02:34:15,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:15,297 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:15,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:34:15,370 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 64 [2019-01-14 02:34:15,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:34:15,376 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 42 treesize of output 55 [2019-01-14 02:34:15,377 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:15,399 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:15,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-14 02:34:15,453 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:115, output treesize:79 [2019-01-14 02:34:15,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:34:15,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:34:15,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:34:15,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:34:15,625 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 [2019-01-14 02:34:15,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:34:15,629 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 [2019-01-14 02:34:15,629 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:15,648 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:15,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:15,664 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:71, output treesize:36 [2019-01-14 02:34:15,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:34:15,731 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.6 stem predicates 2 loop predicates [2019-01-14 02:34:15,731 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 59 states and 73 transitions. cyclomatic complexity: 20 Second operand 8 states. [2019-01-14 02:34:16,073 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 59 states and 73 transitions. cyclomatic complexity: 20. Second operand 8 states. Result 84 states and 106 transitions. Complement of second has 14 states. [2019-01-14 02:34:16,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 6 stem states 1 non-accepting loop states 2 accepting loop states [2019-01-14 02:34:16,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-14 02:34:16,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 26 transitions. [2019-01-14 02:34:16,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 26 transitions. Stem has 17 letters. Loop has 2 letters. [2019-01-14 02:34:16,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:34:16,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 26 transitions. Stem has 19 letters. Loop has 2 letters. [2019-01-14 02:34:16,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:34:16,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 26 transitions. Stem has 17 letters. Loop has 4 letters. [2019-01-14 02:34:16,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:34:16,076 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 106 transitions. [2019-01-14 02:34:16,077 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:34:16,078 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 0 states and 0 transitions. [2019-01-14 02:34:16,078 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:34:16,078 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:34:16,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:34:16,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:34:16,078 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:34:16,078 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:34:16,078 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:34:16,078 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-14 02:34:16,078 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:34:16,078 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:34:16,079 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:34:16,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:34:16 BoogieIcfgContainer [2019-01-14 02:34:16,085 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:34:16,086 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:34:16,086 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:34:16,086 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:34:16,087 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:33:03" (3/4) ... [2019-01-14 02:34:16,090 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:34:16,090 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:34:16,091 INFO L168 Benchmark]: Toolchain (without parser) took 73622.52 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 535.8 MB). Free memory was 951.4 MB in the beginning and 1.3 GB in the end (delta: -371.6 MB). Peak memory consumption was 164.2 MB. Max. memory is 11.5 GB. [2019-01-14 02:34:16,092 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:34:16,092 INFO L168 Benchmark]: CACSL2BoogieTranslator took 592.28 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 924.5 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-01-14 02:34:16,092 INFO L168 Benchmark]: Boogie Procedure Inliner took 120.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 924.5 MB in the beginning and 1.1 GB in the end (delta: -212.7 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2019-01-14 02:34:16,093 INFO L168 Benchmark]: Boogie Preprocessor took 26.35 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. [2019-01-14 02:34:16,093 INFO L168 Benchmark]: RCFGBuilder took 508.75 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: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-01-14 02:34:16,093 INFO L168 Benchmark]: BuchiAutomizer took 72365.04 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 386.9 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -204.3 MB). Peak memory consumption was 182.6 MB. Max. memory is 11.5 GB. [2019-01-14 02:34:16,094 INFO L168 Benchmark]: Witness Printer took 4.56 ms. Allocated memory is still 1.6 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:34:16,096 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 592.28 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 924.5 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 120.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 924.5 MB in the beginning and 1.1 GB in the end (delta: -212.7 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.35 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 508.75 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: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 72365.04 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 386.9 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -204.3 MB). Peak memory consumption was 182.6 MB. Max. memory is 11.5 GB. * Witness Printer took 4.56 ms. Allocated memory is still 1.6 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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, 5 deterministic, 2 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 8 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 8 locations. One deterministic module has affine ranking function 2 * unknown-#memory_int-unknown[r][r] + -2 * unknown-#memory_int-unknown[y_ref][y_ref] + \old(y) and consists of 8 locations. One deterministic module has affine ranking function 2 * unknown-#memory_int-unknown[r][r] + -2 * unknown-#memory_int-unknown[y_ref][y_ref] + 1 and consists of 7 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[r][r] and consists of 8 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 9 locations. One nondeterministic module has affine ranking function -2 * unknown-#memory_int-unknown[y_ref][y_ref] + 2 * unknown-#memory_int-unknown[r][r] + 1 and consists of 9 locations. 2 modules have a trivial ranking function, the largest among these consists of 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 72.3s and 10 iterations. TraceHistogramMax:4. Analysis of lassos took 30.3s. Construction of modules took 1.5s. Büchi inclusion checks took 40.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, 64 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 59 states and ocurred in iteration 8. Nontrivial modules had stage [5, 0, 1, 1, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/4 HoareTripleCheckerStatistics: 121 SDtfs, 233 SDslu, 105 SDs, 0 SdLazy, 664 SolverSat, 105 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 1.5s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso7 LassoPreprocessingBenchmarks: Lassos: inital3701 mio100 ax102 hnf100 lsp96 ukn23 mio100 lsp33 div100 bol100 ite100 ukn100 eq195 hnf87 smp100 dnf314 smp92 tf100 neg92 sie127 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 73ms VariablesStem: 7 VariablesLoop: 6 DisjunctsStem: 8 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 20 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...