./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/min_rf-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/min_rf-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 e3ac7e4caefab280af1b902717cbfa5c070462d8 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:34:10,393 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:34:10,395 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:34:10,410 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:34:10,411 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:34:10,414 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:34:10,416 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:34:10,419 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:34:10,421 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:34:10,423 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:34:10,424 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:34:10,424 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:34:10,427 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:34:10,428 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:34:10,430 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:34:10,437 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:34:10,438 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:34:10,443 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:34:10,444 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:34:10,448 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:34:10,450 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:34:10,451 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:34:10,456 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:34:10,456 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:34:10,456 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:34:10,457 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:34:10,460 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:34:10,461 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:34:10,462 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:34:10,463 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:34:10,463 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:34:10,465 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:34:10,465 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:34:10,466 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:34:10,467 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:34:10,468 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:34:10,468 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:34:10,498 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:34:10,499 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:34:10,500 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:34:10,501 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:34:10,502 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:34:10,502 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:34:10,502 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:34:10,502 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:34:10,502 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:34:10,503 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:34:10,503 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:34:10,503 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:34:10,503 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:34:10,503 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:34:10,503 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:34:10,504 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:34:10,505 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:34:10,506 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:34:10,506 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:34:10,506 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:34:10,507 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:34:10,507 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:34:10,507 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:34:10,507 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:34:10,507 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:34:10,507 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:34:10,508 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:34:10,509 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:34:10,510 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:34:10,511 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 -> e3ac7e4caefab280af1b902717cbfa5c070462d8 [2019-01-14 02:34:10,570 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:34:10,593 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:34:10,599 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:34:10,601 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:34:10,602 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:34:10,603 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/min_rf-alloca_true-termination.c.i [2019-01-14 02:34:10,652 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22e6b5a86/c7e550b84684467ab14ee0943579d25f/FLAGe94f397b4 [2019-01-14 02:34:11,141 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:34:11,142 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/min_rf-alloca_true-termination.c.i [2019-01-14 02:34:11,159 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22e6b5a86/c7e550b84684467ab14ee0943579d25f/FLAGe94f397b4 [2019-01-14 02:34:11,458 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22e6b5a86/c7e550b84684467ab14ee0943579d25f [2019-01-14 02:34:11,462 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:34:11,464 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:34:11,465 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:34:11,465 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:34:11,469 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:34:11,470 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:34:11" (1/1) ... [2019-01-14 02:34:11,474 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b1e3915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:34:11, skipping insertion in model container [2019-01-14 02:34:11,474 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:34:11" (1/1) ... [2019-01-14 02:34:11,484 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:34:11,539 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:34:11,958 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:34:11,975 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:34:12,019 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:34:12,161 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:34:12,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:34:12 WrapperNode [2019-01-14 02:34:12,162 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:34:12,163 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:34:12,163 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:34:12,163 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:34:12,177 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:34:12" (1/1) ... [2019-01-14 02:34:12,210 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:34:12" (1/1) ... [2019-01-14 02:34:12,245 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:34:12,247 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:34:12,247 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:34:12,248 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:34:12,259 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:34:12" (1/1) ... [2019-01-14 02:34:12,260 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:34:12" (1/1) ... [2019-01-14 02:34:12,273 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:34:12" (1/1) ... [2019-01-14 02:34:12,273 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:34:12" (1/1) ... [2019-01-14 02:34:12,283 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:34:12" (1/1) ... [2019-01-14 02:34:12,293 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:34:12" (1/1) ... [2019-01-14 02:34:12,300 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:34:12" (1/1) ... [2019-01-14 02:34:12,303 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:34:12,304 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:34:12,304 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:34:12,304 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:34:12,305 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:34:12" (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:34:12,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:34:12,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:34:12,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 02:34:12,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:34:12,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:34:12,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:34:12,978 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:34:12,978 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-14 02:34:12,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:34:12 BoogieIcfgContainer [2019-01-14 02:34:12,980 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:34:12,980 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:34:12,980 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:34:12,983 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:34:12,984 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:34:12,984 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:34:11" (1/3) ... [2019-01-14 02:34:12,985 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7e2fe066 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:34:12, skipping insertion in model container [2019-01-14 02:34:12,986 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:34:12,986 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:34:12" (2/3) ... [2019-01-14 02:34:12,986 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7e2fe066 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:34:12, skipping insertion in model container [2019-01-14 02:34:12,986 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:34:12,986 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:34:12" (3/3) ... [2019-01-14 02:34:12,988 INFO L375 chiAutomizerObserver]: Analyzing ICFG min_rf-alloca_true-termination.c.i [2019-01-14 02:34:13,043 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:34:13,044 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:34:13,044 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:34:13,044 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:34:13,044 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:34:13,044 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:34:13,045 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:34:13,045 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:34:13,045 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:34:13,057 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-01-14 02:34:13,076 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:34:13,076 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:34:13,076 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:34:13,083 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:34:13,084 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 02:34:13,084 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:34:13,084 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-01-14 02:34:13,085 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:34:13,085 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:34:13,086 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:34:13,086 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:34:13,086 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 02:34:13,093 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem20, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~mem24, main_#t~mem7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6; 11#L556-1true [2019-01-14 02:34:13,094 INFO L796 eck$LassoCheckResult]: Loop: 11#L556-1true call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 7#L553-1true assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 10#L553-3true assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 13#L554true assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 8#L554-2true assume 0 != main_#t~nondet14;havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;havoc main_#t~mem19; 11#L556-1true [2019-01-14 02:34:13,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:34:13,105 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-01-14 02:34:13,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:34:13,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:34:13,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:13,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:34:13,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:13,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:34:13,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:34:13,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:34:13,273 INFO L82 PathProgramCache]: Analyzing trace with hash 35409684, now seen corresponding path program 1 times [2019-01-14 02:34:13,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:34:13,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:34:13,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:13,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:34:13,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:13,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:34:13,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:34:13,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:34:13,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1806849170, now seen corresponding path program 1 times [2019-01-14 02:34:13,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:34:13,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:34:13,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:13,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:34:13,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:13,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:34:13,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:34:14,218 WARN L181 SmtUtils]: Spent 720.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2019-01-14 02:34:14,465 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-01-14 02:34:15,218 WARN L181 SmtUtils]: Spent 750.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 74 [2019-01-14 02:34:15,387 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-01-14 02:34:15,400 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:34:15,402 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:34:15,402 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:34:15,402 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:34:15,402 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:34:15,403 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:34:15,403 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:34:15,403 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:34:15,403 INFO L131 ssoRankerPreferences]: Filename of dumped script: min_rf-alloca_true-termination.c.i_Iteration1_Lasso [2019-01-14 02:34:15,403 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:34:15,405 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:34:15,431 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:34:15,463 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:34:15,470 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:34:15,474 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:34:15,477 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:34:15,480 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:34:15,484 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:34:15,487 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:34:15,489 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:34:15,497 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:34:15,501 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:34:15,503 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:34:15,506 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:34:15,513 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:34:15,519 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:34:15,527 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:34:15,530 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:34:15,537 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:34:15,548 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:34:15,551 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:34:15,554 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:34:15,561 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:34:15,565 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:34:15,572 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:34:15,574 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:34:16,152 WARN L181 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-01-14 02:34:16,336 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-01-14 02:34:16,336 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:34:16,339 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:34:16,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:34:16,671 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2019-01-14 02:34:17,959 WARN L181 SmtUtils]: Spent 794.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-01-14 02:34:17,996 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:34:18,002 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:34:18,005 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:34:18,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:18,007 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:18,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:18,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:18,009 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:18,011 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:18,012 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:18,014 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:18,015 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:34:18,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:18,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:18,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:18,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:18,016 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:18,018 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:18,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:18,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:18,020 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:34:18,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:18,021 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:18,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:18,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:18,022 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:18,022 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:18,022 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:18,025 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:18,026 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:34:18,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:18,027 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:18,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:18,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:18,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:18,029 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:18,030 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:18,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:18,032 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:34:18,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:18,032 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:18,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:18,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:18,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:18,035 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:18,035 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:18,037 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:18,037 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:34:18,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:18,038 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:18,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:18,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:18,039 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:18,041 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:18,041 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:18,043 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:18,043 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:18,044 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:18,044 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:18,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:18,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:18,045 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:18,047 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:18,047 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:18,048 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:18,049 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:18,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:18,051 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:18,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:18,051 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:18,051 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:18,052 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:18,052 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:18,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:18,055 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:34:18,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:18,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:18,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:18,057 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:18,060 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:34:18,060 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:34:18,066 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:18,067 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:34:18,068 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:18,068 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:18,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:18,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:18,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:18,072 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:18,072 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:18,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:18,078 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:34:18,081 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:18,081 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:18,081 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:18,081 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:18,081 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:18,082 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:18,082 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:18,083 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:18,084 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:18,084 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:18,085 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:18,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:18,089 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:18,089 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:18,090 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:18,092 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:18,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:18,094 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:34:18,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:18,094 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:18,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:18,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:18,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:18,098 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:18,098 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:18,099 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:18,101 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:18,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:18,103 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:18,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:18,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:18,103 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:18,106 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:18,106 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:18,108 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:18,109 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:18,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:18,113 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:18,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:18,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:18,114 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:18,114 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:18,114 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:18,117 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:18,118 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:18,121 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:18,125 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:18,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:18,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:18,126 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:18,127 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:18,127 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:18,132 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:18,132 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:18,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:18,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:18,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:18,133 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:18,138 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:34:18,138 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:34:18,148 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:18,148 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:34:18,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:18,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:18,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:18,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:18,157 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:34:18,157 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:34:18,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:18,164 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:34:18,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:18,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:18,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:18,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:18,170 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:34:18,172 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:34:18,175 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:18,177 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:18,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:18,180 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:18,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:18,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:18,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:18,181 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:18,181 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:18,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:18,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:34:18,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:18,189 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:18,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:18,189 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:34:18,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:18,193 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:34:18,193 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:18,196 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:18,197 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:18,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:18,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:18,198 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:18,205 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:18,206 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:34:18,207 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:34:18,212 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:18,215 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:18,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:18,218 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:18,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:18,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:18,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:18,219 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:18,220 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:18,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:18,225 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:18,226 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:18,228 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:18,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:18,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:18,228 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:18,229 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:18,230 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:18,231 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:18,231 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:18,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:18,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:18,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:18,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:18,244 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:34:18,244 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:34:18,263 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:18,264 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:34:18,264 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:18,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:18,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:18,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:18,269 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:34:18,269 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:34:18,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:18,286 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:18,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:18,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:18,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:18,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:18,293 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:34:18,298 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:34:18,300 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:18,302 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:18,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:18,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:18,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:18,305 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:18,311 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:34:18,312 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:34:18,354 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:18,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:34:18,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:18,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:18,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:18,358 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:18,359 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:34:18,359 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:34:18,367 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:18,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:34:18,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:18,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:18,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:18,368 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:18,372 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:34:18,372 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:34:18,386 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:34:18,400 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:34:18,401 INFO L444 ModelExtractionUtils]: 9 out of 13 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-14 02:34:18,403 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:34:18,404 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:34:18,405 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:34:18,405 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 Supporting invariants [] [2019-01-14 02:34:18,727 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2019-01-14 02:34:18,738 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:34:18,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:34:18,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:34:18,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:34:18,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:34:18,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:34:19,243 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 43 treesize of output 48 [2019-01-14 02:34:19,250 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:19,250 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:19,273 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:19,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:19,292 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2019-01-14 02:34:19,358 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:19,372 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2019-01-14 02:34:19,373 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 6 states. [2019-01-14 02:34:19,579 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states.. Second operand 6 states. Result 45 states and 56 transitions. Complement of second has 14 states. [2019-01-14 02:34:19,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2019-01-14 02:34:19,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 02:34:19,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2019-01-14 02:34:19,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 22 transitions. Stem has 2 letters. Loop has 5 letters. [2019-01-14 02:34:19,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:34:19,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 22 transitions. Stem has 7 letters. Loop has 5 letters. [2019-01-14 02:34:19,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:34:19,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 22 transitions. Stem has 2 letters. Loop has 10 letters. [2019-01-14 02:34:19,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:34:19,595 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 56 transitions. [2019-01-14 02:34:19,600 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:34:19,606 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 20 states and 29 transitions. [2019-01-14 02:34:19,607 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-01-14 02:34:19,608 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-01-14 02:34:19,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 29 transitions. [2019-01-14 02:34:19,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:34:19,609 INFO L706 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-01-14 02:34:19,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 29 transitions. [2019-01-14 02:34:19,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2019-01-14 02:34:19,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-14 02:34:19,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2019-01-14 02:34:19,633 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2019-01-14 02:34:19,634 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2019-01-14 02:34:19,634 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:34:19,634 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 25 transitions. [2019-01-14 02:34:19,635 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:34:19,635 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:34:19,635 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:34:19,635 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:34:19,635 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 02:34:19,636 INFO L794 eck$LassoCheckResult]: Stem: 220#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 218#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem20, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~mem24, main_#t~mem7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6; 219#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 221#L553-1 assume !main_#t~short9; 222#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 229#L554 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem13; 233#L554-2 [2019-01-14 02:34:19,636 INFO L796 eck$LassoCheckResult]: Loop: 233#L554-2 assume 0 != main_#t~nondet14;havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;havoc main_#t~mem19; 226#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 231#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 234#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 232#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 233#L554-2 [2019-01-14 02:34:19,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:34:19,636 INFO L82 PathProgramCache]: Analyzing trace with hash 889571373, now seen corresponding path program 1 times [2019-01-14 02:34:19,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:34:19,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:34:19,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:19,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:34:19,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:19,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:34:19,699 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:19,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:34:19,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:34:19,703 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:34:19,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:34:19,704 INFO L82 PathProgramCache]: Analyzing trace with hash 53782944, now seen corresponding path program 2 times [2019-01-14 02:34:19,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:34:19,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:34:19,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:19,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:34:19,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:19,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:34:19,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:34:20,424 WARN L181 SmtUtils]: Spent 640.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2019-01-14 02:34:20,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:34:20,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:34:20,514 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-01-14 02:34:20,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:34:20,527 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2019-01-14 02:34:20,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:34:20,530 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 25 transitions. [2019-01-14 02:34:20,532 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:34:20,533 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 17 states and 22 transitions. [2019-01-14 02:34:20,533 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-01-14 02:34:20,533 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-01-14 02:34:20,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2019-01-14 02:34:20,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:34:20,534 INFO L706 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2019-01-14 02:34:20,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2019-01-14 02:34:20,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-14 02:34:20,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-14 02:34:20,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2019-01-14 02:34:20,536 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2019-01-14 02:34:20,536 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2019-01-14 02:34:20,536 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:34:20,536 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 22 transitions. [2019-01-14 02:34:20,537 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:34:20,537 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:34:20,537 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:34:20,538 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:34:20,538 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 02:34:20,538 INFO L794 eck$LassoCheckResult]: Stem: 263#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 261#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem20, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~mem24, main_#t~mem7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6; 262#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 264#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 265#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 272#L554 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem13; 275#L554-2 [2019-01-14 02:34:20,538 INFO L796 eck$LassoCheckResult]: Loop: 275#L554-2 assume 0 != main_#t~nondet14;havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;havoc main_#t~mem19; 269#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 274#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 277#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 276#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 275#L554-2 [2019-01-14 02:34:20,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:34:20,538 INFO L82 PathProgramCache]: Analyzing trace with hash 889569451, now seen corresponding path program 1 times [2019-01-14 02:34:20,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:34:20,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:34:20,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:20,540 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:34:20,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:20,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:34:20,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:34:20,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:34:20,562 INFO L82 PathProgramCache]: Analyzing trace with hash 53782944, now seen corresponding path program 3 times [2019-01-14 02:34:20,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:34:20,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:34:20,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:20,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:34:20,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:20,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:34:20,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:34:20,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:34:20,587 INFO L82 PathProgramCache]: Analyzing trace with hash -304168138, now seen corresponding path program 1 times [2019-01-14 02:34:20,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:34:20,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:34:20,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:20,588 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:34:20,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:20,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:34:20,849 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 10 [2019-01-14 02:34:21,173 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:34:21,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:34:21,174 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:34:21,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:34:21,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:34:21,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:34:21,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:34:21,295 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:21,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:34:21,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:34:21,322 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:21,323 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:21,333 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:21,357 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:34:21,360 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:34:21,361 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:21,422 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:34:21,439 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:34:21,439 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:21,500 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:21,526 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:34:21,565 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:34:21,566 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:53, output treesize:19 [2019-01-14 02:34:21,779 INFO L303 Elim1Store]: Index analysis took 114 ms [2019-01-14 02:34:21,781 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 27 treesize of output 36 [2019-01-14 02:34:21,785 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:21,786 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:21,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:21,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:21,814 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2019-01-14 02:34:21,967 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 42 [2019-01-14 02:34:21,995 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 244 treesize of output 126 [2019-01-14 02:34:22,098 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 26 treesize of output 21 [2019-01-14 02:34:22,099 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:22,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:34:22,147 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 80 [2019-01-14 02:34:22,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 47 treesize of output 41 [2019-01-14 02:34:22,152 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:22,190 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 48 treesize of output 51 [2019-01-14 02:34:22,195 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 39 treesize of output 34 [2019-01-14 02:34:22,196 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:22,212 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:22,216 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:34:22,222 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:34:22,237 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:34:22,238 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:334, output treesize:52 [2019-01-14 02:34:22,686 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2019-01-14 02:34:22,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:34:22,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:34:22,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 55 [2019-01-14 02:34:22,811 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 33 treesize of output 44 [2019-01-14 02:34:22,813 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 02:34:22,843 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 22 treesize of output 18 [2019-01-14 02:34:22,845 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 02:34:22,860 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 28 treesize of output 20 [2019-01-14 02:34:22,862 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 02:34:22,874 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 02:34:22,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 02:34:22,889 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:63, output treesize:20 [2019-01-14 02:34:22,918 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:34:22,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:34:22,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2019-01-14 02:34:23,202 WARN L181 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2019-01-14 02:34:23,322 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-01-14 02:34:23,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-14 02:34:23,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2019-01-14 02:34:23,324 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. cyclomatic complexity: 7 Second operand 16 states. [2019-01-14 02:34:23,820 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-01-14 02:34:24,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:34:24,089 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2019-01-14 02:34:24,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 02:34:24,090 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2019-01-14 02:34:24,091 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-01-14 02:34:24,092 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 30 transitions. [2019-01-14 02:34:24,092 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-01-14 02:34:24,092 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-01-14 02:34:24,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 30 transitions. [2019-01-14 02:34:24,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:34:24,092 INFO L706 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2019-01-14 02:34:24,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 30 transitions. [2019-01-14 02:34:24,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-01-14 02:34:24,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-14 02:34:24,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2019-01-14 02:34:24,097 INFO L729 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2019-01-14 02:34:24,097 INFO L609 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2019-01-14 02:34:24,097 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:34:24,098 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. [2019-01-14 02:34:24,098 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-01-14 02:34:24,098 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:34:24,098 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:34:24,101 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:34:24,101 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 02:34:24,101 INFO L794 eck$LassoCheckResult]: Stem: 364#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 362#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem20, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~mem24, main_#t~mem7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6; 363#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 376#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 382#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 380#L554 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem13; 377#L554-2 [2019-01-14 02:34:24,101 INFO L796 eck$LassoCheckResult]: Loop: 377#L554-2 assume 0 != main_#t~nondet14;havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;havoc main_#t~mem19; 375#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 369#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 370#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 373#L554 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem13; 377#L554-2 [2019-01-14 02:34:24,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:34:24,102 INFO L82 PathProgramCache]: Analyzing trace with hash 889569451, now seen corresponding path program 2 times [2019-01-14 02:34:24,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:34:24,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:34:24,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:24,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:34:24,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:24,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:34:24,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:34:24,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:34:24,130 INFO L82 PathProgramCache]: Analyzing trace with hash 53782946, now seen corresponding path program 1 times [2019-01-14 02:34:24,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:34:24,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:34:24,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:24,131 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:34:24,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:24,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:34:24,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:34:24,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:34:24,149 INFO L82 PathProgramCache]: Analyzing trace with hash -304168136, now seen corresponding path program 1 times [2019-01-14 02:34:24,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:34:24,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:34:24,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:24,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:34:24,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:24,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:34:24,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:34:24,485 WARN L181 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2019-01-14 02:34:24,864 WARN L181 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 93 [2019-01-14 02:34:24,990 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-01-14 02:34:24,993 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:34:24,994 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:34:24,994 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:34:24,994 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:34:24,994 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:34:24,994 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:34:24,994 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:34:24,994 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:34:24,994 INFO L131 ssoRankerPreferences]: Filename of dumped script: min_rf-alloca_true-termination.c.i_Iteration4_Lasso [2019-01-14 02:34:24,994 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:34:24,994 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:34:24,999 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:34:25,005 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:34:25,006 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:34:25,009 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:34:25,010 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:34:25,012 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:34:25,013 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:34:25,014 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:34:25,016 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:34:25,024 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:34:25,025 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:34:25,027 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:34:25,029 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:34:25,030 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:34:25,032 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:34:25,033 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:34:25,385 WARN L181 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 71 [2019-01-14 02:34:25,543 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-01-14 02:34:25,544 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:34:25,546 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:34:25,548 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:34:25,550 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:34:25,553 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:34:25,556 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:34:25,558 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:34:25,561 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:34:25,565 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:34:25,566 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:34:25,572 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:34:26,626 WARN L181 SmtUtils]: Spent 660.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-01-14 02:34:26,832 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:34:26,832 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:34:26,832 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:26,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:26,833 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:26,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:26,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:26,833 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:26,834 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:26,834 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:26,834 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:26,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:34:26,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:26,835 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:26,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:26,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:26,836 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:26,836 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:26,836 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:26,836 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:26,837 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:34:26,837 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:26,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:26,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:26,837 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:26,838 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:34:26,838 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:34:26,839 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:26,840 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:34:26,840 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:26,840 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:26,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:26,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:26,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:26,841 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:26,841 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:26,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:26,842 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:34:26,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:26,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:26,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:26,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:26,843 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:26,843 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:26,843 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:26,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:26,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:34:26,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:26,850 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:26,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:26,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:26,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:26,851 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:26,851 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:26,851 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:26,852 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:34:26,852 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:26,852 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:26,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:26,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:26,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:26,853 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:26,853 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:26,853 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:26,854 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:34:26,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:26,854 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:26,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:26,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:26,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:26,855 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:26,855 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:26,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:26,856 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:34:26,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:26,856 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:26,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:26,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:26,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:26,857 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:26,857 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:26,858 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:26,858 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:34:26,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:26,858 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:26,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:26,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:26,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:26,859 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:26,859 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:26,860 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:26,860 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:34:26,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:26,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:26,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:26,861 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:26,861 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:34:26,861 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:34:26,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:26,863 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:34:26,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:26,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:26,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:26,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:26,864 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:26,865 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:26,865 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:26,865 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:26,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:34:26,866 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:26,866 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:26,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:26,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:26,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:26,867 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:26,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:26,867 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:26,868 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:34:26,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:26,868 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:26,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:26,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:26,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:26,869 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:26,869 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:26,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:26,870 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:34:26,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:26,870 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:26,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:26,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:26,870 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:26,871 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:26,871 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:26,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:26,872 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:26,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:26,873 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2019-01-14 02:34:26,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:26,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:26,877 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-01-14 02:34:26,877 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:34:26,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:26,898 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:26,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:26,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:26,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:26,899 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:26,900 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:34:26,901 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:34:26,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:26,905 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:26,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:26,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:26,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:26,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:26,908 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:34:26,908 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:34:26,937 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:34:26,961 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:34:26,962 INFO L444 ModelExtractionUtils]: 9 out of 13 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-14 02:34:26,962 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:34:26,963 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:34:26,964 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:34:26,964 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_2 Supporting invariants [] [2019-01-14 02:34:27,163 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2019-01-14 02:34:27,170 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:34:27,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:34:27,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:34:27,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:34:27,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:34:27,325 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:27,471 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-01-14 02:34:27,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:34:27,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:34:27,478 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:27,479 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:27,487 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:27,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:27,496 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2019-01-14 02:34:27,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:34:27,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:34:27,643 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 229 treesize of output 124 [2019-01-14 02:34:30,050 WARN L181 SmtUtils]: Spent 2.40 s on a formula simplification. DAG size of input: 155 DAG size of output: 101 [2019-01-14 02:34:30,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 82 [2019-01-14 02:34:30,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:30,583 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 78 treesize of output 77 [2019-01-14 02:34:30,584 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:30,592 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 0 case distinctions, treesize of input 75 treesize of output 70 [2019-01-14 02:34:30,594 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 02:34:31,072 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 0 case distinctions, treesize of input 81 treesize of output 62 [2019-01-14 02:34:31,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 17 [2019-01-14 02:34:31,083 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:31,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2019-01-14 02:34:31,117 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 31 treesize of output 25 [2019-01-14 02:34:31,118 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:31,130 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:31,140 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:31,158 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 81 treesize of output 69 [2019-01-14 02:34:31,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 29 treesize of output 53 [2019-01-14 02:34:31,203 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2019-01-14 02:34:31,306 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 63 treesize of output 66 [2019-01-14 02:34:31,311 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 28 [2019-01-14 02:34:31,312 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:31,326 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:31,339 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 54 treesize of output 57 [2019-01-14 02:34:31,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 28 [2019-01-14 02:34:31,345 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:31,359 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:31,373 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 66 treesize of output 69 [2019-01-14 02:34:31,378 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 28 [2019-01-14 02:34:31,378 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:31,396 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:31,443 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2019-01-14 02:34:31,478 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 81 treesize of output 82 [2019-01-14 02:34:31,510 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 80 [2019-01-14 02:34:31,511 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:31,651 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:34:31,654 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 92 [2019-01-14 02:34:31,655 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:31,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 49 [2019-01-14 02:34:31,733 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:31,819 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 72 treesize of output 71 [2019-01-14 02:34:31,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-01-14 02:34:31,831 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:31,848 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:31,964 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 68 treesize of output 67 [2019-01-14 02:34:31,971 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 38 treesize of output 33 [2019-01-14 02:34:31,972 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:31,983 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:32,036 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 49 treesize of output 44 [2019-01-14 02:34:32,042 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 28 [2019-01-14 02:34:32,043 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:32,054 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:32,079 INFO L267 ElimStorePlain]: Start of recursive call 18: 3 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:34:32,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 55 [2019-01-14 02:34:32,412 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 14 treesize of output 13 [2019-01-14 02:34:32,412 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:32,443 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 42 treesize of output 45 [2019-01-14 02:34:32,448 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 28 [2019-01-14 02:34:32,448 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:32,458 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:32,467 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:32,494 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:32,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 02:34:32,504 INFO L202 ElimStorePlain]: Needed 31 recursive calls to eliminate 2 variables, input treesize:309, output treesize:36 [2019-01-14 02:34:32,665 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:32,665 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2019-01-14 02:34:32,665 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 8 Second operand 6 states. [2019-01-14 02:34:32,854 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 8. Second operand 6 states. Result 38 states and 49 transitions. Complement of second has 10 states. [2019-01-14 02:34:32,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 02:34:32,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 02:34:32,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2019-01-14 02:34:32,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 6 letters. Loop has 5 letters. [2019-01-14 02:34:32,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:34:32,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 11 letters. Loop has 5 letters. [2019-01-14 02:34:32,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:34:32,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 6 letters. Loop has 10 letters. [2019-01-14 02:34:32,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:34:32,857 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 49 transitions. [2019-01-14 02:34:32,863 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2019-01-14 02:34:32,865 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 34 states and 44 transitions. [2019-01-14 02:34:32,865 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-01-14 02:34:32,865 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-01-14 02:34:32,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 44 transitions. [2019-01-14 02:34:32,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:34:32,865 INFO L706 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2019-01-14 02:34:32,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 44 transitions. [2019-01-14 02:34:32,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-01-14 02:34:32,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-14 02:34:32,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2019-01-14 02:34:32,873 INFO L729 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2019-01-14 02:34:32,873 INFO L609 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2019-01-14 02:34:32,873 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:34:32,874 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 43 transitions. [2019-01-14 02:34:32,874 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2019-01-14 02:34:32,874 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:34:32,875 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:34:32,876 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:34:32,876 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 02:34:32,877 INFO L794 eck$LassoCheckResult]: Stem: 590#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 588#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem20, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~mem24, main_#t~mem7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6; 589#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 603#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 614#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 610#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 611#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~mem20;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 615#L556-1 [2019-01-14 02:34:32,877 INFO L796 eck$LassoCheckResult]: Loop: 615#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 616#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 612#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 613#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 617#L554-2 assume 0 != main_#t~nondet14;havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;havoc main_#t~mem19; 615#L556-1 [2019-01-14 02:34:32,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:34:32,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1806849172, now seen corresponding path program 1 times [2019-01-14 02:34:32,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:34:32,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:34:32,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:32,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:34:32,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:32,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:34:32,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:34:32,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:34:32,915 INFO L82 PathProgramCache]: Analyzing trace with hash 35409684, now seen corresponding path program 4 times [2019-01-14 02:34:32,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:34:32,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:34:32,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:32,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:34:32,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:32,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:34:32,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:34:32,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:34:32,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1737940577, now seen corresponding path program 1 times [2019-01-14 02:34:32,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:34:32,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:34:32,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:32,943 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:34:32,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:32,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:34:32,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:34:33,721 WARN L181 SmtUtils]: Spent 707.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2019-01-14 02:34:34,828 WARN L181 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 146 DAG size of output: 126 [2019-01-14 02:34:35,262 WARN L181 SmtUtils]: Spent 406.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2019-01-14 02:34:35,266 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:34:35,266 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:34:35,266 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:34:35,267 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:34:35,267 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:34:35,267 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:34:35,267 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:34:35,267 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:34:35,267 INFO L131 ssoRankerPreferences]: Filename of dumped script: min_rf-alloca_true-termination.c.i_Iteration5_Lasso [2019-01-14 02:34:35,267 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:34:35,267 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:34:35,271 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:34:35,276 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:34:35,278 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:34:35,280 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:34:35,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:34:35,283 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:34:35,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:34:35,286 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:34:35,321 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:34:35,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:34:35,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:34:35,376 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:34:35,377 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:34:35,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:34:35,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:34:35,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:34:35,399 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:34:35,408 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:34:35,413 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:34:35,415 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:34:35,441 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:34:35,484 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:34:36,020 WARN L181 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 74 [2019-01-14 02:34:36,193 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-01-14 02:34:36,194 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:34:36,196 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:34:36,200 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:34:36,203 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:34:36,205 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:34:36,207 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:34:36,211 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:34:37,077 WARN L181 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-01-14 02:34:37,209 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:34:37,209 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:34:37,211 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:37,212 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:37,212 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:37,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:37,212 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:37,212 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:37,213 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:37,216 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:37,217 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:37,217 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:37,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:37,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:37,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:37,221 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:37,222 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:34:37,222 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:34:37,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:37,226 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:37,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:37,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:37,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:37,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:37,228 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:34:37,228 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:34:37,234 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:37,235 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:37,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:37,235 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:37,235 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:37,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:37,236 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:37,236 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:37,236 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:37,241 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:37,241 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:37,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:37,242 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:37,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:37,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:37,242 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:37,243 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:37,243 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:37,243 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:37,244 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:37,246 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:37,246 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:37,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:37,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:37,247 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:37,247 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:37,247 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:37,248 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:37,248 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:37,248 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:37,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:37,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:37,254 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:37,254 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:34:37,255 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:34:37,256 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:37,257 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:37,257 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:37,257 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:37,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:37,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:37,258 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:37,258 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:37,258 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:37,258 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:37,263 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:37,263 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:37,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:37,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:37,264 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:37,264 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:34:37,265 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:34:37,266 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:37,269 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:34:37,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:37,270 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:37,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:37,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:37,270 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:37,270 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:37,271 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:37,271 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:37,271 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:34:37,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:37,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:37,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:37,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:37,273 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:34:37,273 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:34:37,274 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:37,274 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:34:37,275 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:37,275 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:37,275 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:37,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:37,275 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:37,275 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:37,275 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:37,276 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:37,276 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:34:37,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:37,277 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:37,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:37,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:37,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:37,277 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:37,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:37,278 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:37,278 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:34:37,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:37,278 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:37,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:37,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:37,279 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:37,279 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:37,279 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:37,279 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:37,280 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:37,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:37,280 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:37,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:37,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:37,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:37,281 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:37,281 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:37,281 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:37,282 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:37,282 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:37,282 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:37,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:37,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:37,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:37,283 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:37,283 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:37,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:37,284 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:34:37,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:37,284 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:37,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:37,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:37,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:37,285 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:37,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:37,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:37,286 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:37,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:37,286 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:37,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:37,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:37,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:37,287 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:37,287 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:37,287 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:37,287 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:34:37,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:37,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:37,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:37,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:37,289 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:34:37,289 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:34:37,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:37,290 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:37,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:37,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:37,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:37,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:37,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:37,291 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:37,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:37,292 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:37,292 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:37,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:37,293 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:37,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:37,293 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:34:37,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:37,294 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:34:37,294 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:37,295 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:37,295 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:34:37,296 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:37,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:37,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:37,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:37,298 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:34:37,298 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:34:37,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:37,302 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:37,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:37,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:37,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:37,303 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:37,304 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:34:37,304 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:34:37,307 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:37,308 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:37,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:37,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:37,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:37,308 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:37,310 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:34:37,310 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:34:37,336 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:34:37,384 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-14 02:34:37,384 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-14 02:34:37,385 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:34:37,385 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:34:37,386 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:34:37,386 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3 Supporting invariants [] [2019-01-14 02:34:38,043 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2019-01-14 02:34:38,106 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:34:38,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:34:38,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:34:38,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:34:38,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:34:38,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:38,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:34:38,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:34:38,246 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:38,246 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:38,251 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:38,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:38,257 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2019-01-14 02:34:38,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:34:38,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:34:38,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 48 [2019-01-14 02:34:38,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-14 02:34:38,379 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:38,392 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:38,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:38,407 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2019-01-14 02:34:38,435 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:38,435 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:34:38,435 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 43 transitions. cyclomatic complexity: 14 Second operand 7 states. [2019-01-14 02:34:38,653 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 43 transitions. cyclomatic complexity: 14. Second operand 7 states. Result 63 states and 83 transitions. Complement of second has 12 states. [2019-01-14 02:34:38,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-01-14 02:34:38,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 02:34:38,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2019-01-14 02:34:38,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 7 letters. Loop has 5 letters. [2019-01-14 02:34:38,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:34:38,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 12 letters. Loop has 5 letters. [2019-01-14 02:34:38,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:34:38,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 7 letters. Loop has 10 letters. [2019-01-14 02:34:38,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:34:38,659 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 83 transitions. [2019-01-14 02:34:38,663 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2019-01-14 02:34:38,664 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 61 states and 81 transitions. [2019-01-14 02:34:38,664 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2019-01-14 02:34:38,665 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2019-01-14 02:34:38,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 81 transitions. [2019-01-14 02:34:38,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:34:38,665 INFO L706 BuchiCegarLoop]: Abstraction has 61 states and 81 transitions. [2019-01-14 02:34:38,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 81 transitions. [2019-01-14 02:34:38,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-01-14 02:34:38,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-14 02:34:38,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 77 transitions. [2019-01-14 02:34:38,674 INFO L729 BuchiCegarLoop]: Abstraction has 59 states and 77 transitions. [2019-01-14 02:34:38,674 INFO L609 BuchiCegarLoop]: Abstraction has 59 states and 77 transitions. [2019-01-14 02:34:38,674 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 02:34:38,674 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 77 transitions. [2019-01-14 02:34:38,675 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2019-01-14 02:34:38,676 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:34:38,676 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:34:38,676 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1] [2019-01-14 02:34:38,676 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 02:34:38,676 INFO L794 eck$LassoCheckResult]: Stem: 859#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 857#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem20, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~mem24, main_#t~mem7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6; 858#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 884#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 883#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 882#L554 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem13; 881#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~mem20;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 873#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 870#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 912#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 911#L554 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem13; 872#L554-2 [2019-01-14 02:34:38,677 INFO L796 eck$LassoCheckResult]: Loop: 872#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~mem20;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 865#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 860#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 861#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 868#L554 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem13; 872#L554-2 [2019-01-14 02:34:38,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:34:38,677 INFO L82 PathProgramCache]: Analyzing trace with hash -302321094, now seen corresponding path program 1 times [2019-01-14 02:34:38,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:34:38,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:34:38,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:38,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:34:38,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:38,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:34:38,990 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 14 [2019-01-14 02:34:39,268 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:34:39,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:34:39,269 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:34:39,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:34:39,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:34:39,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:34:39,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:34:39,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, 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:39,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:34:39,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:34:39,361 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:39,361 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:39,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:39,387 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:34:39,392 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:34:39,392 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:39,401 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:34:39,404 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:34:39,405 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:39,410 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:39,414 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:34:39,425 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:34:39,425 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:47, output treesize:13 [2019-01-14 02:34:39,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 36 [2019-01-14 02:34:39,480 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:39,481 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:39,491 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:39,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:39,502 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2019-01-14 02:34:39,611 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 244 treesize of output 124 [2019-01-14 02:34:39,702 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 35 treesize of output 29 [2019-01-14 02:34:39,702 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:39,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:34:39,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 84 [2019-01-14 02:34:39,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2019-01-14 02:34:39,744 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:39,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 51 [2019-01-14 02:34:39,778 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 39 treesize of output 34 [2019-01-14 02:34:39,778 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:39,788 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:39,794 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:34:39,802 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:34:39,816 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:34:39,816 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:328, output treesize:46 [2019-01-14 02:34:39,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2019-01-14 02:34:39,987 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 12 treesize of output 1 [2019-01-14 02:34:39,988 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:40,158 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 17 treesize of output 13 [2019-01-14 02:34:40,159 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:40,170 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 20 treesize of output 14 [2019-01-14 02:34:40,171 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 02:34:40,180 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 02:34:40,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 02:34:40,192 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:67, output treesize:14 [2019-01-14 02:34:40,216 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:34:40,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:34:40,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2019-01-14 02:34:40,235 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:34:40,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:34:40,236 INFO L82 PathProgramCache]: Analyzing trace with hash 55629988, now seen corresponding path program 1 times [2019-01-14 02:34:40,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:34:40,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:34:40,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:40,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:34:40,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:40,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:34:40,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:34:40,541 WARN L181 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2019-01-14 02:34:40,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-14 02:34:40,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-01-14 02:34:40,604 INFO L87 Difference]: Start difference. First operand 59 states and 77 transitions. cyclomatic complexity: 25 Second operand 16 states. [2019-01-14 02:34:41,149 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 34 [2019-01-14 02:34:41,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:34:41,290 INFO L93 Difference]: Finished difference Result 72 states and 91 transitions. [2019-01-14 02:34:41,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 02:34:41,295 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 91 transitions. [2019-01-14 02:34:41,297 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-01-14 02:34:41,298 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 72 states and 91 transitions. [2019-01-14 02:34:41,298 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2019-01-14 02:34:41,298 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2019-01-14 02:34:41,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 91 transitions. [2019-01-14 02:34:41,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:34:41,302 INFO L706 BuchiCegarLoop]: Abstraction has 72 states and 91 transitions. [2019-01-14 02:34:41,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 91 transitions. [2019-01-14 02:34:41,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2019-01-14 02:34:41,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-14 02:34:41,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 87 transitions. [2019-01-14 02:34:41,310 INFO L729 BuchiCegarLoop]: Abstraction has 68 states and 87 transitions. [2019-01-14 02:34:41,310 INFO L609 BuchiCegarLoop]: Abstraction has 68 states and 87 transitions. [2019-01-14 02:34:41,311 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 02:34:41,311 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 87 transitions. [2019-01-14 02:34:41,311 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-01-14 02:34:41,312 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:34:41,316 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:34:41,316 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1] [2019-01-14 02:34:41,316 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 02:34:41,317 INFO L794 eck$LassoCheckResult]: Stem: 1049#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1047#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem20, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~mem24, main_#t~mem7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6; 1048#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 1073#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 1074#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 1068#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 1069#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~mem20;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 1085#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 1079#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 1071#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 1072#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 1087#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~mem20;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 1075#L556-1 [2019-01-14 02:34:41,317 INFO L796 eck$LassoCheckResult]: Loop: 1075#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 1076#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 1089#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 1088#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 1086#L554-2 assume 0 != main_#t~nondet14;havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;havoc main_#t~mem19; 1075#L556-1 [2019-01-14 02:34:41,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:34:41,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1737940579, now seen corresponding path program 2 times [2019-01-14 02:34:41,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:34:41,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:34:41,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:41,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:34:41,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:41,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:34:41,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:34:41,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:34:41,355 INFO L82 PathProgramCache]: Analyzing trace with hash 35409684, now seen corresponding path program 5 times [2019-01-14 02:34:41,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:34:41,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:34:41,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:41,356 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:34:41,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:41,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:34:41,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:34:41,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:34:41,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1666915826, now seen corresponding path program 2 times [2019-01-14 02:34:41,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:34:41,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:34:41,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:41,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:34:41,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:41,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:34:41,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:34:41,722 WARN L181 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2019-01-14 02:34:45,750 WARN L181 SmtUtils]: Spent 3.96 s on a formula simplification. DAG size of input: 202 DAG size of output: 160 [2019-01-14 02:34:46,666 WARN L181 SmtUtils]: Spent 910.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2019-01-14 02:34:46,671 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:34:46,672 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:34:46,672 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:34:46,672 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:34:46,672 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:34:46,672 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:34:46,672 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:34:46,672 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:34:46,672 INFO L131 ssoRankerPreferences]: Filename of dumped script: min_rf-alloca_true-termination.c.i_Iteration7_Lasso [2019-01-14 02:34:46,672 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:34:46,673 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:34:46,678 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:34:46,682 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:34:46,686 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:34:46,689 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:34:46,690 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:34:46,692 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:34:46,694 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:34:46,698 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:34:46,699 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:34:46,701 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:34:46,702 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:34:46,704 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:34:47,984 WARN L181 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 77 [2019-01-14 02:34:48,128 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-01-14 02:34:48,129 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:34:48,131 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:34:48,133 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:34:48,134 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:34:48,136 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:34:48,137 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:34:48,139 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:34:48,140 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:34:48,141 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:34:48,143 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:34:48,146 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:34:48,147 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:34:48,148 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:34:48,150 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:34:48,151 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:34:49,033 WARN L181 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-01-14 02:34:49,104 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:34:49,105 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:34:49,106 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:34:49,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:49,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:49,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:49,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:49,110 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:49,110 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:49,110 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:49,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:49,112 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:34:49,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:49,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:49,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:49,113 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:49,114 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:34:49,114 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:34:49,115 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:49,115 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:34:49,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:49,116 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:49,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:49,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:49,116 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:49,116 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:49,116 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:49,117 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:49,117 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:34:49,117 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:49,118 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:49,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:49,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:49,126 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:49,126 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:49,126 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:49,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:49,129 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:49,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:49,129 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:49,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:49,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:49,130 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:49,130 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:49,130 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:49,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:49,134 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:49,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:49,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:49,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:49,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:49,135 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:34:49,135 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:34:49,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:49,140 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:49,140 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:49,141 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:49,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:49,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:49,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:49,141 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:49,141 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:49,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:49,145 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:49,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:49,146 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:49,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:49,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:49,146 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:49,146 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:49,146 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:49,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:49,147 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:49,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:49,151 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:49,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:49,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:49,151 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:49,152 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:49,152 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:49,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:49,153 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:34:49,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:49,153 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:49,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:49,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:49,154 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:49,157 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:49,157 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:49,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:49,158 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:49,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:49,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:49,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:49,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:49,162 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:34:49,162 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:34:49,169 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:49,170 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:49,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:49,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:49,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:49,171 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:49,172 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:34:49,173 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:34:49,176 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:49,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:34:49,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:49,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:49,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:49,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:49,181 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:34:49,181 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:34:49,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:49,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:34:49,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:49,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:49,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:49,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:49,189 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:34:49,189 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:34:49,197 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:49,197 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:49,198 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:49,198 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:49,198 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:49,198 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:49,202 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:34:49,202 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:34:49,210 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:49,213 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:49,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:49,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:49,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:49,214 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:49,221 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:34:49,221 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:34:49,237 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:49,238 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:49,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:49,239 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2019-01-14 02:34:49,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:49,244 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:49,250 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-01-14 02:34:49,250 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:34:49,268 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:49,269 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:34:49,269 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:49,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:49,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:49,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:49,278 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:34:49,279 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:34:49,294 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:34:49,303 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:34:49,303 INFO L444 ModelExtractionUtils]: 9 out of 13 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-14 02:34:49,303 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:34:49,304 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:34:49,304 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:34:49,304 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_4 Supporting invariants [] [2019-01-14 02:34:49,569 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2019-01-14 02:34:49,572 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:34:49,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:34:49,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:34:49,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:34:49,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:34:49,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:49,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:34:49,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:34:49,652 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:49,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:49,657 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:49,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:49,664 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2019-01-14 02:34:49,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:34:49,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:34:49,807 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 43 treesize of output 48 [2019-01-14 02:34:49,809 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:49,810 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:49,820 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:49,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:49,831 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2019-01-14 02:34:49,858 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:49,858 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:34:49,859 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 68 states and 87 transitions. cyclomatic complexity: 26 Second operand 7 states. [2019-01-14 02:34:49,995 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 68 states and 87 transitions. cyclomatic complexity: 26. Second operand 7 states. Result 92 states and 116 transitions. Complement of second has 12 states. [2019-01-14 02:34:49,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-01-14 02:34:49,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 02:34:49,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2019-01-14 02:34:49,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 12 letters. Loop has 5 letters. [2019-01-14 02:34:49,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:34:49,998 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:34:50,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:34:50,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:34:50,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:34:50,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:34:50,058 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:50,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:34:50,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:34:50,080 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:50,080 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:50,086 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:50,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:50,093 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2019-01-14 02:34:50,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:34:50,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:34:50,222 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 43 treesize of output 48 [2019-01-14 02:34:50,239 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:50,239 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:50,249 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:50,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:50,259 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2019-01-14 02:34:50,292 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:50,293 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 5 loop predicates [2019-01-14 02:34:50,293 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 68 states and 87 transitions. cyclomatic complexity: 26 Second operand 7 states. [2019-01-14 02:34:50,462 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 68 states and 87 transitions. cyclomatic complexity: 26. Second operand 7 states. Result 92 states and 116 transitions. Complement of second has 12 states. [2019-01-14 02:34:50,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-01-14 02:34:50,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 02:34:50,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2019-01-14 02:34:50,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 12 letters. Loop has 5 letters. [2019-01-14 02:34:50,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:34:50,467 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:34:50,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:34:50,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:34:50,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:34:50,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:34:50,525 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:50,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:34:50,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:34:50,549 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:50,550 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:50,555 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:50,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:50,563 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2019-01-14 02:34:50,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:34:50,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:34:50,724 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 43 treesize of output 48 [2019-01-14 02:34:50,742 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:50,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:50,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:51,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:51,015 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2019-01-14 02:34:51,043 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:51,044 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 5 loop predicates [2019-01-14 02:34:51,044 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 68 states and 87 transitions. cyclomatic complexity: 26 Second operand 7 states. [2019-01-14 02:34:51,230 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 68 states and 87 transitions. cyclomatic complexity: 26. Second operand 7 states. Result 105 states and 132 transitions. Complement of second has 11 states. [2019-01-14 02:34:51,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-01-14 02:34:51,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 02:34:51,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2019-01-14 02:34:51,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 12 letters. Loop has 5 letters. [2019-01-14 02:34:51,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:34:51,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 17 letters. Loop has 5 letters. [2019-01-14 02:34:51,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:34:51,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 12 letters. Loop has 10 letters. [2019-01-14 02:34:51,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:34:51,236 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 132 transitions. [2019-01-14 02:34:51,243 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 35 [2019-01-14 02:34:51,248 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 83 states and 105 transitions. [2019-01-14 02:34:51,248 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2019-01-14 02:34:51,249 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2019-01-14 02:34:51,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 105 transitions. [2019-01-14 02:34:51,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:34:51,250 INFO L706 BuchiCegarLoop]: Abstraction has 83 states and 105 transitions. [2019-01-14 02:34:51,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 105 transitions. [2019-01-14 02:34:51,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 38. [2019-01-14 02:34:51,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-14 02:34:51,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2019-01-14 02:34:51,255 INFO L729 BuchiCegarLoop]: Abstraction has 38 states and 48 transitions. [2019-01-14 02:34:51,255 INFO L609 BuchiCegarLoop]: Abstraction has 38 states and 48 transitions. [2019-01-14 02:34:51,255 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-14 02:34:51,255 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 48 transitions. [2019-01-14 02:34:51,257 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2019-01-14 02:34:51,257 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:34:51,257 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:34:51,257 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:34:51,257 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 02:34:51,258 INFO L794 eck$LassoCheckResult]: Stem: 1741#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1739#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem20, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~mem24, main_#t~mem7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6; 1740#L556-1 [2019-01-14 02:34:51,258 INFO L796 eck$LassoCheckResult]: Loop: 1740#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 1745#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 1746#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 1749#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 1742#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~mem20;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 1740#L556-1 [2019-01-14 02:34:51,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:34:51,258 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-01-14 02:34:51,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:34:51,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:34:51,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:51,259 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:34:51,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:51,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:34:51,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:34:51,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:34:51,270 INFO L82 PathProgramCache]: Analyzing trace with hash 35409686, now seen corresponding path program 1 times [2019-01-14 02:34:51,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:34:51,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:34:51,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:51,272 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:34:51,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:51,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:34:51,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:34:51,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:34:51,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1806849172, now seen corresponding path program 3 times [2019-01-14 02:34:51,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:34:51,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:34:51,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:51,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:34:51,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:51,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:34:51,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:34:51,675 WARN L181 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 77 [2019-01-14 02:34:51,977 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-01-14 02:34:52,065 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:34:52,066 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:34:52,066 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:34:52,066 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:34:52,066 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:34:52,066 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:34:52,066 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:34:52,066 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:34:52,066 INFO L131 ssoRankerPreferences]: Filename of dumped script: min_rf-alloca_true-termination.c.i_Iteration8_Lasso [2019-01-14 02:34:52,066 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:34:52,066 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:34:52,070 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:34:52,084 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:34:52,086 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:34:52,088 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:34:52,089 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:34:52,091 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:34:52,093 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:34:52,095 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:34:52,096 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:34:52,097 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:34:52,099 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:34:52,101 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:34:52,103 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:34:52,111 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:34:52,435 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-01-14 02:34:52,710 WARN L181 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-01-14 02:34:52,711 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:34:52,719 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:34:52,721 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:34:52,732 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:34:52,734 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:34:52,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:34:52,740 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:34:52,742 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:34:52,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:34:52,747 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:34:52,750 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:34:52,752 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:34:52,755 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:34:53,848 WARN L181 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-01-14 02:34:54,033 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:34:54,034 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:34:54,034 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:34:54,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:54,034 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:54,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:54,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:54,035 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:54,035 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:54,035 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:54,036 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:54,036 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:34:54,036 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:54,037 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:54,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:54,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:54,037 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:54,037 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:54,037 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:54,038 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:54,038 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:54,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:54,038 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:54,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:54,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:54,039 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:54,039 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:54,039 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:54,039 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:54,040 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:34:54,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:54,040 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:54,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:54,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:54,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:54,041 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:54,041 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:54,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:54,042 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:54,042 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:54,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:54,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:54,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:54,042 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:54,042 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:54,043 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:54,043 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:54,043 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:54,044 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:54,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:54,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:54,044 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:54,045 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:34:54,045 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:34:54,046 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:54,046 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:34:54,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:54,047 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:54,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:54,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:54,047 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:54,047 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:54,047 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:54,048 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:54,048 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:34:54,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:54,049 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:54,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:54,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:54,049 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:54,049 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:54,049 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:54,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:54,050 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:54,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:54,050 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:54,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:54,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:54,050 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:54,051 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:54,051 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:54,051 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:54,051 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:34:54,052 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:54,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:54,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:54,052 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:54,052 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:34:54,053 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:34:54,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:54,054 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:54,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:54,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:54,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:54,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:54,055 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:54,055 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:54,055 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:54,056 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:54,056 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:54,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:54,057 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:54,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:54,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:54,057 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:54,057 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:54,057 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:54,058 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:54,058 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:54,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:54,058 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:54,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:54,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:54,059 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:54,059 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:54,059 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:54,059 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:54,059 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:34:54,060 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:54,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:54,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:54,060 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:54,061 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:34:54,061 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:34:54,062 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:54,062 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:34:54,062 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:54,062 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2019-01-14 02:34:54,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:54,063 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:54,065 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-01-14 02:34:54,065 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:34:54,078 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:54,079 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:34:54,079 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:54,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:54,079 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:54,079 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:54,080 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:34:54,080 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:34:54,083 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:54,083 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:34:54,083 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:54,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:54,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:54,084 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:54,084 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:34:54,084 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:34:54,085 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:54,085 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:34:54,086 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:54,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:54,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:54,086 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:54,087 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:34:54,087 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:34:54,089 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:54,090 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:54,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:54,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:54,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:54,091 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:54,092 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:34:54,093 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:34:54,101 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:54,101 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:54,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:54,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:54,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:54,102 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:54,102 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:34:54,102 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:34:54,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:54,107 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:54,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:54,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:54,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:54,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:54,113 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:34:54,113 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:34:54,120 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:34:54,122 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:34:54,123 INFO L444 ModelExtractionUtils]: 10 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:34:54,123 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:34:54,124 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:34:54,124 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:34:54,124 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_5) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_5 Supporting invariants [] [2019-01-14 02:34:54,396 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2019-01-14 02:34:54,401 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:34:54,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:34:54,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:34:54,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:34:54,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:34:54,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:34:54,570 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 30 treesize of output 31 [2019-01-14 02:34:54,573 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:54,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:54,579 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:54,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:54,589 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2019-01-14 02:34:54,620 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:54,621 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-01-14 02:34:54,621 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 48 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-01-14 02:34:54,718 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 48 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 58 states and 74 transitions. Complement of second has 9 states. [2019-01-14 02:34:54,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 02:34:54,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:34:54,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 8 transitions. [2019-01-14 02:34:54,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 2 letters. Loop has 5 letters. [2019-01-14 02:34:54,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:34:54,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 7 letters. Loop has 5 letters. [2019-01-14 02:34:54,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:34:54,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 2 letters. Loop has 10 letters. [2019-01-14 02:34:54,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:34:54,721 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 74 transitions. [2019-01-14 02:34:54,722 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2019-01-14 02:34:54,723 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 52 states and 67 transitions. [2019-01-14 02:34:54,723 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-01-14 02:34:54,723 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-01-14 02:34:54,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 67 transitions. [2019-01-14 02:34:54,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:34:54,724 INFO L706 BuchiCegarLoop]: Abstraction has 52 states and 67 transitions. [2019-01-14 02:34:54,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 67 transitions. [2019-01-14 02:34:54,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 47. [2019-01-14 02:34:54,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-14 02:34:54,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2019-01-14 02:34:54,727 INFO L729 BuchiCegarLoop]: Abstraction has 47 states and 61 transitions. [2019-01-14 02:34:54,727 INFO L609 BuchiCegarLoop]: Abstraction has 47 states and 61 transitions. [2019-01-14 02:34:54,727 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-14 02:34:54,727 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 61 transitions. [2019-01-14 02:34:54,728 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2019-01-14 02:34:54,728 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:34:54,728 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:34:54,729 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:34:54,729 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 02:34:54,729 INFO L794 eck$LassoCheckResult]: Stem: 1988#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1986#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem20, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~mem24, main_#t~mem7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6; 1987#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 2012#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 2011#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 2010#L554 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem13; 2007#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~mem20;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 2009#L556-1 [2019-01-14 02:34:54,729 INFO L796 eck$LassoCheckResult]: Loop: 2009#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 1989#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 1990#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 1997#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 2004#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~mem20;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 2009#L556-1 [2019-01-14 02:34:54,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:34:54,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1806849234, now seen corresponding path program 2 times [2019-01-14 02:34:54,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:34:54,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:34:54,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:54,730 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:34:54,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:54,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:34:54,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:34:54,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:34:54,750 INFO L82 PathProgramCache]: Analyzing trace with hash 35409686, now seen corresponding path program 2 times [2019-01-14 02:34:54,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:34:54,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:34:54,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:54,751 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:34:54,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:54,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:34:54,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:34:54,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:34:54,761 INFO L82 PathProgramCache]: Analyzing trace with hash -782019355, now seen corresponding path program 1 times [2019-01-14 02:34:54,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:34:54,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:34:54,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:54,762 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:34:54,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:54,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:34:54,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:34:55,106 WARN L181 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 77 [2019-01-14 02:34:55,935 WARN L181 SmtUtils]: Spent 763.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 124 [2019-01-14 02:34:56,261 WARN L181 SmtUtils]: Spent 323.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-01-14 02:34:56,266 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:34:56,266 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:34:56,266 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:34:56,266 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:34:56,266 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:34:56,266 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:34:56,266 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:34:56,267 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:34:56,267 INFO L131 ssoRankerPreferences]: Filename of dumped script: min_rf-alloca_true-termination.c.i_Iteration9_Lasso [2019-01-14 02:34:56,267 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:34:56,267 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:34:56,271 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:34:56,313 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:34:56,331 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:34:56,358 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:34:56,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:34:56,376 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:34:56,377 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:34:56,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:34:56,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:34:56,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:34:56,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:34:56,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:34:56,388 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:34:56,842 WARN L181 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 74 [2019-01-14 02:34:56,976 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-01-14 02:34:56,976 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:34:56,980 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:34:56,981 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:34:56,983 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:34:56,985 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:34:56,987 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:34:56,988 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:34:56,990 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:34:56,992 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:34:56,994 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:34:56,996 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:34:56,997 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:34:56,998 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:34:57,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:34:57,002 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:34:57,004 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:34:57,985 WARN L181 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-01-14 02:34:58,119 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:34:58,119 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:34:58,120 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:34:58,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:58,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:58,121 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:58,121 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:58,121 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:34:58,121 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:34:58,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:58,123 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:58,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:58,123 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:58,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:58,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:58,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:58,124 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:58,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:58,125 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:58,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:58,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:58,126 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:58,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:58,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:58,126 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:58,126 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:58,126 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:58,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:58,127 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:58,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:58,128 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:58,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:58,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:58,128 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:58,128 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:58,128 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:58,129 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:58,129 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:58,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:58,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:58,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:58,130 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:58,130 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:34:58,131 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:34:58,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:58,132 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:58,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:58,132 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:58,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:58,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:58,133 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:58,133 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:58,133 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:58,134 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:58,134 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:58,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:58,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:58,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:58,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:58,135 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:34:58,135 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:34:58,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:58,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:34:58,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:58,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:58,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:58,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:58,138 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:34:58,138 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:34:58,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:58,140 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:58,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:58,141 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:58,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:58,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:58,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:58,141 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:58,141 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:58,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:58,142 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:58,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:58,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:58,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:58,143 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:58,143 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:34:58,144 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:34:58,145 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:58,145 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:58,145 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:58,146 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:58,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:58,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:58,146 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:58,146 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:58,146 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:58,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:58,147 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:58,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:58,148 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:58,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:58,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:58,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:58,148 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:58,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:58,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:58,149 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:58,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:58,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:58,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:58,150 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:58,151 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:34:58,151 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:34:58,166 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:34:58,173 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:34:58,173 INFO L444 ModelExtractionUtils]: 10 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:34:58,174 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:34:58,174 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:34:58,174 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:34:58,175 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_6) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_6 Supporting invariants [] [2019-01-14 02:34:58,453 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2019-01-14 02:34:58,458 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:34:58,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:34:58,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:34:58,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:34:58,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:34:58,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:58,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:34:58,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:34:58,532 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:58,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:58,536 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:58,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:58,544 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2019-01-14 02:34:58,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:34:58,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:34:58,658 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 30 treesize of output 31 [2019-01-14 02:34:58,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:58,667 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:34:58,676 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:58,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:34:58,689 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2019-01-14 02:34:58,711 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:58,711 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2019-01-14 02:34:58,712 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 47 states and 61 transitions. cyclomatic complexity: 18 Second operand 6 states. [2019-01-14 02:34:58,819 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 47 states and 61 transitions. cyclomatic complexity: 18. Second operand 6 states. Result 119 states and 148 transitions. Complement of second has 10 states. [2019-01-14 02:34:58,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 02:34:58,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 02:34:58,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2019-01-14 02:34:58,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 7 letters. Loop has 5 letters. [2019-01-14 02:34:58,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:34:58,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 12 letters. Loop has 5 letters. [2019-01-14 02:34:58,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:34:58,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 7 letters. Loop has 10 letters. [2019-01-14 02:34:58,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:34:58,831 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 148 transitions. [2019-01-14 02:34:58,836 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2019-01-14 02:34:58,838 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 94 states and 119 transitions. [2019-01-14 02:34:58,838 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2019-01-14 02:34:58,838 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2019-01-14 02:34:58,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 119 transitions. [2019-01-14 02:34:58,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:34:58,838 INFO L706 BuchiCegarLoop]: Abstraction has 94 states and 119 transitions. [2019-01-14 02:34:58,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 119 transitions. [2019-01-14 02:34:58,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 72. [2019-01-14 02:34:58,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-14 02:34:58,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 94 transitions. [2019-01-14 02:34:58,851 INFO L729 BuchiCegarLoop]: Abstraction has 72 states and 94 transitions. [2019-01-14 02:34:58,852 INFO L609 BuchiCegarLoop]: Abstraction has 72 states and 94 transitions. [2019-01-14 02:34:58,852 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-14 02:34:58,852 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 94 transitions. [2019-01-14 02:34:58,852 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2019-01-14 02:34:58,852 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:34:58,853 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:34:58,853 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1] [2019-01-14 02:34:58,853 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 02:34:58,853 INFO L794 eck$LassoCheckResult]: Stem: 2323#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2321#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem20, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~mem24, main_#t~mem7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6; 2322#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 2330#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 2331#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 2333#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 2326#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~mem20;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 2327#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 2328#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 2329#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 2332#L554 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem13; 2336#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~mem20;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 2339#L556-1 [2019-01-14 02:34:58,854 INFO L796 eck$LassoCheckResult]: Loop: 2339#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 2362#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 2373#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 2371#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 2370#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~mem20;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 2339#L556-1 [2019-01-14 02:34:58,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:34:58,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1737940641, now seen corresponding path program 2 times [2019-01-14 02:34:58,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:34:58,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:34:58,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:58,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:34:58,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:58,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:34:59,307 WARN L181 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 14 [2019-01-14 02:34:59,567 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 24 [2019-01-14 02:34:59,964 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:34:59,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:34:59,964 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:34:59,979 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 02:35:00,013 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 02:35:00,013 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:35:00,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:35:00,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:00,052 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:35:00,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:00,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:00,084 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:35:00,084 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:00,091 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:00,104 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:35:00,107 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:35:00,107 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:00,120 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:35:00,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:35:00,123 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:00,128 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:00,133 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:35:00,143 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:35:00,143 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:47, output treesize:13 [2019-01-14 02:35:00,202 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 29 treesize of output 38 [2019-01-14 02:35:00,205 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:35:00,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:00,213 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:00,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:00,224 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2019-01-14 02:35:00,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, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 246 treesize of output 128 [2019-01-14 02:35:00,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-01-14 02:35:00,430 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:00,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:00,462 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 82 [2019-01-14 02:35:00,467 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 49 treesize of output 43 [2019-01-14 02:35:00,468 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:00,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 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:35:00,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2019-01-14 02:35:00,504 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:00,517 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:00,525 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:35:00,533 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:35:00,548 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:35:00,548 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:330, output treesize:46 [2019-01-14 02:35:00,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2019-01-14 02:35:00,735 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 34 treesize of output 33 [2019-01-14 02:35:00,736 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:00,753 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 33 treesize of output 27 [2019-01-14 02:35:00,754 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 02:35:00,766 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 32 treesize of output 24 [2019-01-14 02:35:00,768 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 02:35:00,779 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 02:35:00,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 02:35:00,796 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:67, output treesize:24 [2019-01-14 02:35:00,826 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:35:00,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:35:00,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2019-01-14 02:35:00,846 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:35:00,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:35:00,847 INFO L82 PathProgramCache]: Analyzing trace with hash 35409686, now seen corresponding path program 3 times [2019-01-14 02:35:00,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:35:00,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:35:00,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:35:00,848 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:35:00,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:35:00,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:35:00,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:35:01,157 WARN L181 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 77 [2019-01-14 02:35:01,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-14 02:35:01,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2019-01-14 02:35:01,222 INFO L87 Difference]: Start difference. First operand 72 states and 94 transitions. cyclomatic complexity: 29 Second operand 18 states. [2019-01-14 02:35:01,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:35:01,993 INFO L93 Difference]: Finished difference Result 101 states and 123 transitions. [2019-01-14 02:35:01,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 02:35:01,998 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 123 transitions. [2019-01-14 02:35:01,999 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2019-01-14 02:35:02,000 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 98 states and 119 transitions. [2019-01-14 02:35:02,000 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2019-01-14 02:35:02,000 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2019-01-14 02:35:02,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 119 transitions. [2019-01-14 02:35:02,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:35:02,000 INFO L706 BuchiCegarLoop]: Abstraction has 98 states and 119 transitions. [2019-01-14 02:35:02,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states and 119 transitions. [2019-01-14 02:35:02,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 70. [2019-01-14 02:35:02,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-01-14 02:35:02,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 89 transitions. [2019-01-14 02:35:02,014 INFO L729 BuchiCegarLoop]: Abstraction has 70 states and 89 transitions. [2019-01-14 02:35:02,015 INFO L609 BuchiCegarLoop]: Abstraction has 70 states and 89 transitions. [2019-01-14 02:35:02,015 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-14 02:35:02,015 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 89 transitions. [2019-01-14 02:35:02,015 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 31 [2019-01-14 02:35:02,015 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:35:02,015 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:35:02,029 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1] [2019-01-14 02:35:02,029 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1] [2019-01-14 02:35:02,029 INFO L794 eck$LassoCheckResult]: Stem: 2560#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2558#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem20, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~mem24, main_#t~mem7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6; 2559#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 2584#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 2609#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 2598#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 2595#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~mem20;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 2593#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 2592#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 2591#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 2590#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 2588#L554-2 assume 0 != main_#t~nondet14;havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;havoc main_#t~mem19; 2589#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 2582#L553-1 [2019-01-14 02:35:02,030 INFO L796 eck$LassoCheckResult]: Loop: 2582#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 2580#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 2581#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 2596#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~mem20;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 2597#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 2592#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 2591#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 2590#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 2588#L554-2 assume 0 != main_#t~nondet14;havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;havoc main_#t~mem19; 2589#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 2582#L553-1 [2019-01-14 02:35:02,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:35:02,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1958416954, now seen corresponding path program 3 times [2019-01-14 02:35:02,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:35:02,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:35:02,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:35:02,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:35:02,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:35:02,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:35:02,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:35:02,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:35:02,071 INFO L82 PathProgramCache]: Analyzing trace with hash 480749795, now seen corresponding path program 1 times [2019-01-14 02:35:02,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:35:02,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:35:02,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:35:02,072 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:35:02,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:35:02,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:35:02,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:35:02,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:35:02,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1335499672, now seen corresponding path program 4 times [2019-01-14 02:35:02,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:35:02,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:35:02,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:35:02,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:35:02,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:35:02,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:35:02,559 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-01-14 02:35:02,742 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-14 02:35:03,109 WARN L181 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 27 [2019-01-14 02:35:03,335 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-14 02:35:03,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:35:03,335 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:35:03,351 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 02:35:03,395 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 02:35:03,395 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:35:03,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:35:03,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:03,426 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:35:03,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:03,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:03,448 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:35:03,448 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:03,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:03,475 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:35:03,479 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:35:03,479 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:03,490 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:35:03,493 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:35:03,494 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:03,507 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:03,578 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:35:03,798 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:35:03,799 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:56, output treesize:22 [2019-01-14 02:35:04,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:04,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:04,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-14 02:35:04,207 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 26 treesize of output 20 [2019-01-14 02:35:04,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:04,227 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:04,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:04,245 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:45 [2019-01-14 02:35:04,381 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2019-01-14 02:35:04,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:04,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:04,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:04,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:04,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:04,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:04,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:04,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 253 treesize of output 195 [2019-01-14 02:35:04,523 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 44 [2019-01-14 02:35:04,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:04,586 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 74 treesize of output 103 [2019-01-14 02:35:04,595 INFO L267 ElimStorePlain]: Start of recursive call 3: 12 dim-0 vars, End of recursive call: 12 dim-0 vars, and 9 xjuncts. [2019-01-14 02:35:04,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:04,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:04,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:04,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:04,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:04,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:04,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:04,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 131 [2019-01-14 02:35:04,748 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 90 treesize of output 97 [2019-01-14 02:35:04,751 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-14 02:35:04,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:04,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:04,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:04,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:04,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:04,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:04,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:04,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:04,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 126 [2019-01-14 02:35:04,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:04,881 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 106 treesize of output 144 [2019-01-14 02:35:04,888 INFO L267 ElimStorePlain]: Start of recursive call 7: 12 dim-0 vars, End of recursive call: 12 dim-0 vars, and 9 xjuncts. [2019-01-14 02:35:04,962 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:04,969 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:35:04,976 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:35:04,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:04,992 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:338, output treesize:50 [2019-01-14 02:35:05,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:05,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:05,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:05,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:05,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:05,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:05,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:05,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:05,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 119 [2019-01-14 02:35:05,130 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 64 treesize of output 115 [2019-01-14 02:35:05,136 INFO L267 ElimStorePlain]: Start of recursive call 3: 12 dim-0 vars, End of recursive call: 12 dim-0 vars, and 9 xjuncts. [2019-01-14 02:35:05,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:05,254 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:05,254 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:78, output treesize:47 [2019-01-14 02:35:05,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:05,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:05,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:05,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:05,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:05,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:05,404 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 255 treesize of output 178 [2019-01-14 02:35:05,511 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 45 [2019-01-14 02:35:05,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:05,538 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 67 treesize of output 97 [2019-01-14 02:35:05,540 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:35:05,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:05,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:05,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:05,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:05,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:05,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:05,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 139 [2019-01-14 02:35:05,635 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 91 treesize of output 104 [2019-01-14 02:35:05,638 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-14 02:35:05,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:05,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:05,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:05,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:05,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:05,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:05,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 109 [2019-01-14 02:35:05,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:05,760 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 89 treesize of output 138 [2019-01-14 02:35:05,765 INFO L267 ElimStorePlain]: Start of recursive call 7: 12 dim-0 vars, End of recursive call: 12 dim-0 vars, and 9 xjuncts. [2019-01-14 02:35:05,836 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:05,843 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:35:05,853 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:35:05,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:05,870 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:340, output treesize:56 [2019-01-14 02:35:05,960 WARN L307 Elim1Store]: Array PQE input equivalent to false [2019-01-14 02:35:05,960 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:05,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:05,963 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:84, output treesize:1 [2019-01-14 02:35:05,967 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 24 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 02:35:05,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:35:05,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12] total 18 [2019-01-14 02:35:07,214 WARN L181 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 148 DAG size of output: 125 [2019-01-14 02:35:07,515 WARN L181 SmtUtils]: Spent 297.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-01-14 02:35:07,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-14 02:35:07,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2019-01-14 02:35:07,516 INFO L87 Difference]: Start difference. First operand 70 states and 89 transitions. cyclomatic complexity: 26 Second operand 18 states. [2019-01-14 02:35:08,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:35:08,701 INFO L93 Difference]: Finished difference Result 97 states and 110 transitions. [2019-01-14 02:35:08,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-14 02:35:08,703 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97 states and 110 transitions. [2019-01-14 02:35:08,704 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 31 [2019-01-14 02:35:08,705 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97 states to 85 states and 98 transitions. [2019-01-14 02:35:08,705 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2019-01-14 02:35:08,709 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2019-01-14 02:35:08,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 98 transitions. [2019-01-14 02:35:08,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:35:08,710 INFO L706 BuchiCegarLoop]: Abstraction has 85 states and 98 transitions. [2019-01-14 02:35:08,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 98 transitions. [2019-01-14 02:35:08,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 56. [2019-01-14 02:35:08,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-14 02:35:08,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2019-01-14 02:35:08,715 INFO L729 BuchiCegarLoop]: Abstraction has 56 states and 67 transitions. [2019-01-14 02:35:08,715 INFO L609 BuchiCegarLoop]: Abstraction has 56 states and 67 transitions. [2019-01-14 02:35:08,715 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2019-01-14 02:35:08,715 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 67 transitions. [2019-01-14 02:35:08,716 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-14 02:35:08,716 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:35:08,716 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:35:08,716 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-14 02:35:08,716 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1] [2019-01-14 02:35:08,717 INFO L794 eck$LassoCheckResult]: Stem: 2848#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2846#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem20, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~mem24, main_#t~mem7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6; 2847#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 2877#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 2876#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 2874#L554 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem13; 2875#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~mem20;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 2888#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 2861#L553-1 [2019-01-14 02:35:08,717 INFO L796 eck$LassoCheckResult]: Loop: 2861#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 2901#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 2896#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 2897#L554-2 assume 0 != main_#t~nondet14;havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;havoc main_#t~mem19; 2900#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 2899#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 2857#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 2858#L554 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem13; 2864#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~mem20;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 2850#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 2861#L553-1 [2019-01-14 02:35:08,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:35:08,717 INFO L82 PathProgramCache]: Analyzing trace with hash 177751413, now seen corresponding path program 3 times [2019-01-14 02:35:08,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:35:08,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:35:08,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:35:08,721 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:35:08,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:35:08,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:35:08,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:35:08,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:35:08,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1294255583, now seen corresponding path program 1 times [2019-01-14 02:35:08,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:35:08,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:35:08,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:35:08,754 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:35:08,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:35:08,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:35:08,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:35:08,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:35:08,784 INFO L82 PathProgramCache]: Analyzing trace with hash 2067938965, now seen corresponding path program 1 times [2019-01-14 02:35:08,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:35:08,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:35:08,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:35:08,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:35:08,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:35:08,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:35:08,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:35:10,193 WARN L181 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 149 DAG size of output: 132 [2019-01-14 02:35:11,487 WARN L181 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 104 DAG size of output: 104 [2019-01-14 02:35:12,503 WARN L181 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 158 DAG size of output: 129 [2019-01-14 02:35:15,336 WARN L181 SmtUtils]: Spent 2.78 s on a formula simplification. DAG size of input: 107 DAG size of output: 107 [2019-01-14 02:35:15,343 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:35:15,343 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:35:15,343 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:35:15,343 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:35:15,343 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:35:15,343 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:35:15,344 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:35:15,344 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:35:15,344 INFO L131 ssoRankerPreferences]: Filename of dumped script: min_rf-alloca_true-termination.c.i_Iteration12_Lasso [2019-01-14 02:35:15,344 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:35:15,344 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:35:15,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:35:15,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:35:15,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:35:15,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:35:15,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:35:15,375 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:35:15,377 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:35:15,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:35:15,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:35:15,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:35:15,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:35:15,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:35:15,392 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:35:15,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:35:15,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:35:15,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:35:15,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:35:15,401 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:35:15,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:35:16,443 WARN L181 SmtUtils]: Spent 715.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 84 [2019-01-14 02:35:16,597 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-01-14 02:35:17,168 WARN L181 SmtUtils]: Spent 566.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 72 [2019-01-14 02:35:17,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:35:17,173 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:35:17,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:35:17,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:35:17,177 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:35:17,179 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:35:17,795 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-01-14 02:35:17,962 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2019-01-14 02:35:18,389 WARN L181 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-01-14 02:35:18,538 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:35:18,538 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:35:18,538 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:35:18,539 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:18,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:18,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:18,539 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:18,544 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:35:18,544 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:35:18,546 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:18,546 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:35:18,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:18,547 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:18,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:18,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:18,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:18,547 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:18,547 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:18,548 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:18,548 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:35:18,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:18,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:18,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:18,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:18,549 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:35:18,549 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:35:18,550 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:18,551 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:35:18,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:18,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:18,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:18,552 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:18,552 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:35:18,552 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:35:18,555 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:18,557 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:35:18,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:18,557 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:18,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:18,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:18,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:18,558 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:18,558 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:18,558 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:18,559 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:35:18,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:18,559 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:18,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:18,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:18,559 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:18,560 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:18,560 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:18,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:18,560 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:35:18,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:18,567 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:18,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:18,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:18,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:18,568 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:18,568 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:18,568 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:18,569 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:35:18,569 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:18,569 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:18,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:18,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:18,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:18,569 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:18,570 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:18,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:18,575 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:35:18,575 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:18,575 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:18,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:18,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:18,575 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:18,576 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:18,576 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:18,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:18,576 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:35:18,580 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:18,580 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:18,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:18,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:18,581 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:18,581 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:18,581 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:18,581 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:18,582 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:35:18,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:18,582 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:18,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:18,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:18,583 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:18,585 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:18,585 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:18,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:18,586 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:35:18,588 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:18,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:18,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:18,588 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:18,589 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:35:18,589 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:35:18,590 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:18,590 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:35:18,590 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:18,591 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:18,591 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:18,591 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:18,591 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:18,591 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:18,591 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:18,592 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:18,595 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:35:18,595 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:18,596 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:18,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:18,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:18,596 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:18,596 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:18,596 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:18,597 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:18,604 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:35:18,604 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:18,605 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:18,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:18,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:18,605 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:18,605 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:18,605 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:18,606 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:18,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:35:18,606 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:18,606 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:18,607 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:18,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:18,613 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:18,613 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:18,613 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:18,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:18,614 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:35:18,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:18,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:18,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:18,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:18,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:18,618 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:18,618 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:18,618 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:18,619 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:35:18,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:18,619 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:18,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:18,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:18,623 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:18,623 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:18,623 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:18,624 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:18,624 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:35:18,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:18,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:18,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:18,628 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:18,629 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:35:18,629 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:35:18,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:18,632 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:35:18,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:18,632 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 02:35:18,632 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:35:18,633 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:18,647 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-01-14 02:35:18,647 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 02:35:18,759 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:35:18,809 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-14 02:35:18,809 INFO L444 ModelExtractionUtils]: 27 out of 31 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-14 02:35:18,810 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:35:18,811 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2019-01-14 02:35:18,811 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:35:18,811 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_7) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_7 Supporting invariants [] [2019-01-14 02:35:19,104 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2019-01-14 02:35:19,109 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:35:19,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:35:19,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:35:19,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:35:19,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:19,191 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:35:19,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:19,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:19,215 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:35:19,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:19,221 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:19,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:19,230 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2019-01-14 02:35:19,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:35:19,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:35:19,284 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 23 treesize of output 24 [2019-01-14 02:35:19,287 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:35:19,287 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:19,296 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:19,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:19,306 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-01-14 02:35:19,433 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 240 treesize of output 131 [2019-01-14 02:35:21,771 WARN L181 SmtUtils]: Spent 2.33 s on a formula simplification. DAG size of input: 158 DAG size of output: 104 [2019-01-14 02:35:21,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 86 [2019-01-14 02:35:21,776 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:22,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 81 [2019-01-14 02:35:22,505 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:22,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 74 [2019-01-14 02:35:22,512 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:23,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 62 [2019-01-14 02:35:23,129 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 13 [2019-01-14 02:35:23,129 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:23,154 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 40 treesize of output 35 [2019-01-14 02:35:23,158 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 31 treesize of output 25 [2019-01-14 02:35:23,159 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:23,164 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:23,172 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:23,187 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 0 case distinctions, treesize of input 81 treesize of output 65 [2019-01-14 02:35:23,194 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 47 treesize of output 52 [2019-01-14 02:35:23,195 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:23,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2019-01-14 02:35:23,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 28 [2019-01-14 02:35:23,220 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:23,228 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:23,236 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:23,380 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 92 treesize of output 76 [2019-01-14 02:35:23,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:23,419 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 5 case distinctions, treesize of input 43 treesize of output 86 [2019-01-14 02:35:23,421 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 3 xjuncts. [2019-01-14 02:35:23,488 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 70 treesize of output 69 [2019-01-14 02:35:23,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 73 [2019-01-14 02:35:23,494 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:23,509 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:23,521 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 58 treesize of output 59 [2019-01-14 02:35:23,562 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 43 [2019-01-14 02:35:23,563 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:23,632 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:23,661 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:35:23,750 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 78 treesize of output 70 [2019-01-14 02:35:23,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 13 [2019-01-14 02:35:23,775 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:23,800 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 42 treesize of output 45 [2019-01-14 02:35:23,804 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 28 [2019-01-14 02:35:23,804 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:23,813 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:23,819 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:23,841 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:35:23,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:23,849 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 1 variables, input treesize:320, output treesize:36 [2019-01-14 02:35:24,106 INFO L303 Elim1Store]: Index analysis took 165 ms [2019-01-14 02:35:24,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 53 [2019-01-14 02:35:24,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 11 [2019-01-14 02:35:24,159 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:24,306 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:24,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:24,459 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:58, output treesize:36 [2019-01-14 02:35:24,822 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-14 02:35:25,343 WARN L181 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 41 [2019-01-14 02:35:25,555 INFO L303 Elim1Store]: Index analysis took 210 ms [2019-01-14 02:35:25,775 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 249 treesize of output 138 [2019-01-14 02:35:29,108 WARN L181 SmtUtils]: Spent 3.32 s on a formula simplification. DAG size of input: 165 DAG size of output: 102 [2019-01-14 02:35:29,132 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 99 treesize of output 95 [2019-01-14 02:35:29,132 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:29,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:29,509 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 97 [2019-01-14 02:35:29,510 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:29,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:29,517 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 92 treesize of output 108 [2019-01-14 02:35:29,518 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:29,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:29,793 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 0 case distinctions, treesize of input 83 treesize of output 83 [2019-01-14 02:35:29,798 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-01-14 02:35:29,798 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:29,821 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 49 treesize of output 42 [2019-01-14 02:35:29,825 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 38 treesize of output 32 [2019-01-14 02:35:29,825 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:29,834 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:29,845 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:29,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 70 [2019-01-14 02:35:29,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:29,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:29,871 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 47 treesize of output 60 [2019-01-14 02:35:29,871 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:29,897 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 51 treesize of output 44 [2019-01-14 02:35:29,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2019-01-14 02:35:29,902 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:29,910 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:29,922 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:30,053 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 97 treesize of output 92 [2019-01-14 02:35:30,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:30,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:30,105 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 5 case distinctions, treesize of input 84 treesize of output 136 [2019-01-14 02:35:30,108 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 3 xjuncts. [2019-01-14 02:35:30,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:30,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:30,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:30,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 91 [2019-01-14 02:35:30,319 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:30,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:30,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 85 [2019-01-14 02:35:30,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:30,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 44 [2019-01-14 02:35:30,477 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:30,493 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:30,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:30,602 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 65 treesize of output 74 [2019-01-14 02:35:30,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:30,607 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 51 treesize of output 53 [2019-01-14 02:35:30,607 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:30,640 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:30,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:30,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:30,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:30,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 80 [2019-01-14 02:35:30,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:30,747 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 65 [2019-01-14 02:35:30,747 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:30,767 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:30,782 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 81 treesize of output 74 [2019-01-14 02:35:30,787 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 66 treesize of output 88 [2019-01-14 02:35:30,787 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:30,804 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:30,855 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:35:30,970 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 83 treesize of output 88 [2019-01-14 02:35:31,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 63 [2019-01-14 02:35:31,015 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:31,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:31,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:31,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 79 [2019-01-14 02:35:31,104 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:31,178 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 58 treesize of output 51 [2019-01-14 02:35:31,193 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 35 [2019-01-14 02:35:31,193 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:31,206 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:31,277 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 71 treesize of output 66 [2019-01-14 02:35:31,282 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 58 treesize of output 73 [2019-01-14 02:35:31,282 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:31,298 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:31,355 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 55 treesize of output 52 [2019-01-14 02:35:31,360 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 35 [2019-01-14 02:35:31,360 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:31,372 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:31,402 INFO L267 ElimStorePlain]: Start of recursive call 25: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:35:31,441 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:35:31,461 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:35:31,462 INFO L202 ElimStorePlain]: Needed 33 recursive calls to eliminate 3 variables, input treesize:329, output treesize:43 [2019-01-14 02:35:31,490 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:35:31,490 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2019-01-14 02:35:31,491 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 67 transitions. cyclomatic complexity: 16 Second operand 10 states. [2019-01-14 02:35:31,662 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 67 transitions. cyclomatic complexity: 16. Second operand 10 states. Result 144 states and 171 transitions. Complement of second has 16 states. [2019-01-14 02:35:31,663 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:35:31,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-14 02:35:31,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 18 transitions. [2019-01-14 02:35:31,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 18 transitions. Stem has 8 letters. Loop has 10 letters. [2019-01-14 02:35:31,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:35:31,664 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:35:31,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:35:31,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:35:31,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:35:31,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:31,753 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:35:31,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:31,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:31,774 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:35:31,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:31,779 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:31,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:31,785 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2019-01-14 02:35:31,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:35:31,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:35:31,824 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 23 treesize of output 24 [2019-01-14 02:35:31,827 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:35:31,828 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:31,834 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:31,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:31,841 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-01-14 02:35:31,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 240 treesize of output 131 [2019-01-14 02:35:34,117 WARN L181 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 158 DAG size of output: 104 [2019-01-14 02:35:34,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 86 [2019-01-14 02:35:34,121 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:34,676 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 82 treesize of output 74 [2019-01-14 02:35:34,677 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:34,686 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 81 [2019-01-14 02:35:34,687 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:35,163 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 92 treesize of output 76 [2019-01-14 02:35:35,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:35,204 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 5 case distinctions, treesize of input 43 treesize of output 86 [2019-01-14 02:35:35,205 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 3 xjuncts. [2019-01-14 02:35:35,266 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 58 treesize of output 59 [2019-01-14 02:35:35,271 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 43 [2019-01-14 02:35:35,272 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:35,286 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:35,297 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 70 treesize of output 69 [2019-01-14 02:35:35,302 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 57 treesize of output 73 [2019-01-14 02:35:35,303 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:35,319 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:35,349 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:35:35,385 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 92 treesize of output 89 [2019-01-14 02:35:35,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:35,399 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 100 [2019-01-14 02:35:35,399 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:35,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:35,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 74 [2019-01-14 02:35:35,495 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:35,578 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 74 treesize of output 73 [2019-01-14 02:35:35,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2019-01-14 02:35:35,583 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:35,599 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:35,668 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 56 treesize of output 51 [2019-01-14 02:35:35,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2019-01-14 02:35:35,681 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:35,690 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:35,742 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:35:35,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:35,759 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 0 case distinctions, treesize of input 92 treesize of output 81 [2019-01-14 02:35:35,763 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 51 [2019-01-14 02:35:35,764 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:35,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:35,797 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 53 treesize of output 56 [2019-01-14 02:35:35,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:35,801 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2019-01-14 02:35:35,801 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:35,810 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:35,821 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:36,085 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 0 case distinctions, treesize of input 81 treesize of output 65 [2019-01-14 02:35:36,092 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 47 treesize of output 52 [2019-01-14 02:35:36,093 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:36,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2019-01-14 02:35:36,120 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 28 [2019-01-14 02:35:36,120 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:36,156 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:36,165 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:36,180 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 0 case distinctions, treesize of input 74 treesize of output 62 [2019-01-14 02:35:36,184 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 13 [2019-01-14 02:35:36,184 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:36,203 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 40 treesize of output 35 [2019-01-14 02:35:36,209 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 31 treesize of output 25 [2019-01-14 02:35:36,209 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:36,215 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:36,224 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:36,357 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 78 treesize of output 70 [2019-01-14 02:35:36,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2019-01-14 02:35:36,365 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:36,415 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 42 treesize of output 45 [2019-01-14 02:35:36,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-01-14 02:35:36,420 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:36,430 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:36,437 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:35:36,466 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:35:36,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:36,475 INFO L202 ElimStorePlain]: Needed 34 recursive calls to eliminate 1 variables, input treesize:320, output treesize:36 [2019-01-14 02:35:36,580 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 50 treesize of output 53 [2019-01-14 02:35:36,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 11 [2019-01-14 02:35:36,584 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:36,593 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:36,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:36,604 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:58, output treesize:36 [2019-01-14 02:35:36,743 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 249 treesize of output 138 [2019-01-14 02:35:38,976 WARN L181 SmtUtils]: Spent 2.23 s on a formula simplification. DAG size of input: 165 DAG size of output: 102 [2019-01-14 02:35:38,981 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 99 treesize of output 95 [2019-01-14 02:35:38,981 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:39,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:39,349 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 97 [2019-01-14 02:35:39,350 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:39,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:39,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 108 [2019-01-14 02:35:39,362 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:39,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:39,645 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 0 case distinctions, treesize of input 83 treesize of output 83 [2019-01-14 02:35:39,648 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-01-14 02:35:39,649 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:39,674 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 49 treesize of output 42 [2019-01-14 02:35:39,679 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 38 treesize of output 32 [2019-01-14 02:35:39,679 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:39,687 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:39,697 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:39,712 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 0 case distinctions, treesize of input 86 treesize of output 70 [2019-01-14 02:35:39,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:39,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:39,720 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 47 treesize of output 60 [2019-01-14 02:35:39,721 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:39,747 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 51 treesize of output 44 [2019-01-14 02:35:39,752 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 35 [2019-01-14 02:35:39,752 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:39,762 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:39,773 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:39,899 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 97 treesize of output 92 [2019-01-14 02:35:39,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:39,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:39,944 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 5 case distinctions, treesize of input 84 treesize of output 136 [2019-01-14 02:35:39,946 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 3 xjuncts. [2019-01-14 02:35:40,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:40,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:40,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:40,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 91 [2019-01-14 02:35:40,173 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:40,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:40,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:40,325 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:35:40,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:40,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 77 treesize of output 138 [2019-01-14 02:35:40,329 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:40,487 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 85 treesize of output 78 [2019-01-14 02:35:40,492 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 66 treesize of output 88 [2019-01-14 02:35:40,493 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:40,510 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:40,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:40,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:40,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:40,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 80 [2019-01-14 02:35:40,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:40,528 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 65 [2019-01-14 02:35:40,529 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:40,555 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:40,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:40,646 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 65 treesize of output 74 [2019-01-14 02:35:40,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:40,650 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 51 treesize of output 53 [2019-01-14 02:35:40,651 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:40,665 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:40,762 INFO L267 ElimStorePlain]: Start of recursive call 14: 3 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:35: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 3 case distinctions, treesize of input 83 treesize of output 88 [2019-01-14 02:35:40,880 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 79 treesize of output 63 [2019-01-14 02:35:40,881 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:40,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:40,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:40,965 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 66 treesize of output 79 [2019-01-14 02:35:40,965 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:41,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 66 [2019-01-14 02:35:41,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 73 [2019-01-14 02:35:41,055 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:41,070 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:41,133 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 58 treesize of output 51 [2019-01-14 02:35:41,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 40 treesize of output 35 [2019-01-14 02:35:41,138 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:41,149 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:41,208 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 55 treesize of output 52 [2019-01-14 02:35:41,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2019-01-14 02:35:41,213 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:41,225 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:41,253 INFO L267 ElimStorePlain]: Start of recursive call 24: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:35:41,285 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:35:41,306 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:35:41,307 INFO L202 ElimStorePlain]: Needed 32 recursive calls to eliminate 3 variables, input treesize:329, output treesize:43 [2019-01-14 02:35:41,337 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:35:41,337 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 7 loop predicates [2019-01-14 02:35:41,337 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 67 transitions. cyclomatic complexity: 16 Second operand 10 states. [2019-01-14 02:35:41,512 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 67 transitions. cyclomatic complexity: 16. Second operand 10 states. Result 149 states and 178 transitions. Complement of second has 18 states. [2019-01-14 02:35:41,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 2 stem states 7 non-accepting loop states 1 accepting loop states [2019-01-14 02:35:41,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-14 02:35:41,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2019-01-14 02:35:41,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 18 transitions. Stem has 8 letters. Loop has 10 letters. [2019-01-14 02:35:41,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:35:41,515 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:35:41,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:35:41,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:35:41,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:35:41,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:41,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:35:41,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:41,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:41,594 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:35:41,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:41,600 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:41,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:41,605 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2019-01-14 02:35:41,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:35:41,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:35:41,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2019-01-14 02:35:41,668 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:35:41,668 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:41,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:41,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:41,685 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-01-14 02:35:41,795 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 240 treesize of output 131 [2019-01-14 02:35:43,461 WARN L181 SmtUtils]: Spent 1.66 s on a formula simplification. DAG size of input: 158 DAG size of output: 104 [2019-01-14 02:35:43,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 85 [2019-01-14 02:35:43,470 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:43,478 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 86 treesize of output 78 [2019-01-14 02:35:43,478 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:43,979 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 84 treesize of output 78 [2019-01-14 02:35:43,980 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:44,405 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 0 case distinctions, treesize of input 81 treesize of output 65 [2019-01-14 02:35:44,412 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 47 treesize of output 52 [2019-01-14 02:35:44,413 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:44,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2019-01-14 02:35:44,435 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 28 [2019-01-14 02:35:44,436 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:44,442 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:44,449 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:44,463 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 0 case distinctions, treesize of input 74 treesize of output 62 [2019-01-14 02:35:44,468 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 13 [2019-01-14 02:35:44,468 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:44,488 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 40 treesize of output 35 [2019-01-14 02:35:44,492 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 31 treesize of output 25 [2019-01-14 02:35:44,492 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:44,499 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:44,506 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:44,661 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 92 treesize of output 76 [2019-01-14 02:35:44,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:44,700 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 5 case distinctions, treesize of input 43 treesize of output 86 [2019-01-14 02:35:44,702 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 3 xjuncts. [2019-01-14 02:35:44,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 59 [2019-01-14 02:35:44,791 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 43 [2019-01-14 02:35:44,791 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:44,806 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:44,817 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 70 treesize of output 69 [2019-01-14 02:35:44,834 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 57 treesize of output 73 [2019-01-14 02:35:44,835 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:44,852 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:44,880 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:35:44,961 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 78 treesize of output 70 [2019-01-14 02:35:44,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2019-01-14 02:35:44,966 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:44,990 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 42 treesize of output 45 [2019-01-14 02:35:44,994 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 28 [2019-01-14 02:35:44,994 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:45,004 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:45,011 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:45,044 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:35:45,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:45,061 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 1 variables, input treesize:320, output treesize:36 [2019-01-14 02:35:45,167 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 50 treesize of output 53 [2019-01-14 02:35:45,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 11 [2019-01-14 02:35:45,172 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:45,183 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:45,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:45,193 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:58, output treesize:36 [2019-01-14 02:35:45,333 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 249 treesize of output 138 [2019-01-14 02:35:47,771 WARN L181 SmtUtils]: Spent 2.43 s on a formula simplification. DAG size of input: 165 DAG size of output: 102 [2019-01-14 02:35:47,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:47,780 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 101 [2019-01-14 02:35:47,781 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:47,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:47,800 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 96 treesize of output 112 [2019-01-14 02:35:47,800 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:48,261 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 91 treesize of output 87 [2019-01-14 02:35:48,262 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:48,588 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 97 treesize of output 92 [2019-01-14 02:35:48,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:48,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:48,634 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 5 case distinctions, treesize of input 84 treesize of output 136 [2019-01-14 02:35:48,637 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 3 xjuncts. [2019-01-14 02:35:48,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:48,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:48,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:49,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 91 [2019-01-14 02:35:49,002 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:49,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:49,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:49,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:49,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 80 [2019-01-14 02:35:49,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:49,187 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 65 [2019-01-14 02:35:49,187 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:49,208 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:49,222 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 85 treesize of output 78 [2019-01-14 02:35:49,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 88 [2019-01-14 02:35:49,228 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:49,247 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:49,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:49,343 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 65 treesize of output 74 [2019-01-14 02:35:49,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:49,347 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 51 treesize of output 41 [2019-01-14 02:35:49,348 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:49,363 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:49,467 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:35:49,718 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 0 case distinctions, treesize of input 86 treesize of output 70 [2019-01-14 02:35:49,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:49,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:49,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 60 [2019-01-14 02:35:49,731 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:49,760 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 51 treesize of output 44 [2019-01-14 02:35:49,772 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 35 [2019-01-14 02:35:49,772 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:49,781 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:49,792 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:49,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:49,802 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 0 case distinctions, treesize of input 83 treesize of output 83 [2019-01-14 02:35:49,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-01-14 02:35:49,807 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:49,834 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 49 treesize of output 42 [2019-01-14 02:35:49,839 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 38 treesize of output 32 [2019-01-14 02:35:49,840 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:49,848 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:49,860 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:49,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 3 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 88 [2019-01-14 02:35:50,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 63 [2019-01-14 02:35:50,006 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:50,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:50,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:50,097 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 66 treesize of output 79 [2019-01-14 02:35:50,098 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:50,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 52 [2019-01-14 02:35:50,216 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 35 [2019-01-14 02:35:50,216 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:50,227 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:50,286 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 58 treesize of output 51 [2019-01-14 02:35:50,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2019-01-14 02:35:50,291 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:50,305 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:50,363 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:35:50,399 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:35:50,418 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:35:50,418 INFO L202 ElimStorePlain]: Needed 29 recursive calls to eliminate 3 variables, input treesize:329, output treesize:43 [2019-01-14 02:35:50,502 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:35:50,503 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2019-01-14 02:35:50,503 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 67 transitions. cyclomatic complexity: 16 Second operand 10 states. [2019-01-14 02:35:50,673 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 67 transitions. cyclomatic complexity: 16. Second operand 10 states. Result 153 states and 180 transitions. Complement of second has 23 states. [2019-01-14 02:35:50,676 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:35:50,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-14 02:35:50,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 25 transitions. [2019-01-14 02:35:50,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 25 transitions. Stem has 8 letters. Loop has 10 letters. [2019-01-14 02:35:50,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:35:50,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 25 transitions. Stem has 18 letters. Loop has 10 letters. [2019-01-14 02:35:50,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:35:50,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 25 transitions. Stem has 8 letters. Loop has 20 letters. [2019-01-14 02:35:50,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:35:50,684 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 153 states and 180 transitions. [2019-01-14 02:35:50,687 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-14 02:35:50,688 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 153 states to 100 states and 124 transitions. [2019-01-14 02:35:50,688 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-01-14 02:35:50,688 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-01-14 02:35:50,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 124 transitions. [2019-01-14 02:35:50,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:35:50,688 INFO L706 BuchiCegarLoop]: Abstraction has 100 states and 124 transitions. [2019-01-14 02:35:50,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states and 124 transitions. [2019-01-14 02:35:50,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 64. [2019-01-14 02:35:50,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-14 02:35:50,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 83 transitions. [2019-01-14 02:35:50,692 INFO L729 BuchiCegarLoop]: Abstraction has 64 states and 83 transitions. [2019-01-14 02:35:50,692 INFO L609 BuchiCegarLoop]: Abstraction has 64 states and 83 transitions. [2019-01-14 02:35:50,692 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2019-01-14 02:35:50,692 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 83 transitions. [2019-01-14 02:35:50,693 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-14 02:35:50,693 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:35:50,693 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:35:50,693 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1] [2019-01-14 02:35:50,693 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 02:35:50,694 INFO L794 eck$LassoCheckResult]: Stem: 3729#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3727#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem20, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~mem24, main_#t~mem7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6; 3728#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 3757#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 3755#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 3751#L554 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem13; 3752#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~mem20;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 3740#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 3741#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 3737#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 3738#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 3745#L554-2 [2019-01-14 02:35:50,694 INFO L796 eck$LassoCheckResult]: Loop: 3745#L554-2 assume 0 != main_#t~nondet14;havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;havoc main_#t~mem19; 3747#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 3763#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 3762#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 3744#L554 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem13; 3745#L554-2 [2019-01-14 02:35:50,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:35:50,694 INFO L82 PathProgramCache]: Analyzing trace with hash -302321096, now seen corresponding path program 3 times [2019-01-14 02:35:50,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:35:50,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:35:50,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:35:50,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:35:50,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:35:50,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:35:50,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:35:50,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:35:50,714 INFO L82 PathProgramCache]: Analyzing trace with hash 53782946, now seen corresponding path program 2 times [2019-01-14 02:35:50,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:35:50,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:35:50,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:35:50,716 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:35:50,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:35:50,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:35:50,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:35:50,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:35:50,725 INFO L82 PathProgramCache]: Analyzing trace with hash 337347019, now seen corresponding path program 2 times [2019-01-14 02:35:50,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:35:50,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:35:50,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:35:50,726 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:35:50,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:35:50,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:35:50,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:35:51,129 WARN L181 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2019-01-14 02:35:52,487 WARN L181 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 179 DAG size of output: 146 [2019-01-14 02:35:52,984 WARN L181 SmtUtils]: Spent 451.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2019-01-14 02:35:52,988 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:35:52,988 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:35:52,988 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:35:52,988 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:35:52,988 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:35:52,988 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:35:52,988 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:35:52,988 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:35:52,989 INFO L131 ssoRankerPreferences]: Filename of dumped script: min_rf-alloca_true-termination.c.i_Iteration13_Lasso [2019-01-14 02:35:52,989 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:35:52,989 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:35:52,993 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:35:53,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:35:53,009 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:35:53,014 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:35:53,019 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:35:53,022 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:35:53,027 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:35:53,029 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:35:53,033 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:35:53,035 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:35:53,036 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:35:53,038 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:35:53,041 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:35:53,043 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:35:53,045 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:35:53,047 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:35:53,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:35:53,051 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:35:53,065 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:35:53,080 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:35:53,587 WARN L181 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 71 [2019-01-14 02:35:53,734 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-01-14 02:35:53,735 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:35:53,742 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:35:53,745 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:35:53,749 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:35:53,751 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:35:53,754 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:35:53,757 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:35:53,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:35:53,763 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:35:54,547 WARN L181 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-01-14 02:35:54,714 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:35:54,714 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:35:54,714 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:35:54,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:54,715 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:54,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:54,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:54,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:54,715 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:54,716 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:54,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:54,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:35:54,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:54,718 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:54,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:54,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:54,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:54,718 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:54,718 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:54,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:54,719 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:35:54,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:54,720 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:54,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:54,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:54,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:54,720 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:54,720 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:54,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:54,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:35:54,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:54,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:54,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:54,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:54,722 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:35:54,722 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:35:54,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:54,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:35:54,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:54,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:54,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:54,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:54,724 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:35:54,725 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:35:54,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:54,726 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:35:54,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:54,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:54,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:54,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:54,727 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:35:54,728 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:35:54,729 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:54,729 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:35:54,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:54,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:54,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:54,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:54,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:54,739 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:54,739 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:54,740 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:54,740 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:35:54,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:54,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:54,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:54,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:54,741 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:35:54,742 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:35:54,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:54,744 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:35:54,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:54,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:54,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:54,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:54,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:54,745 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:54,745 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:54,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:54,745 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:35:54,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:54,757 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:54,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:54,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:54,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:54,758 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:54,758 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:54,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:54,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:35:54,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:54,762 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:54,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:54,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:54,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:54,763 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:54,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:54,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:54,763 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:35:54,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:54,764 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:54,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:54,764 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:35:54,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:54,764 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:35:54,765 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:54,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:54,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:35:54,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:54,769 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:54,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:54,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:54,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:54,770 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:54,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:54,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:54,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:35:54,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:54,774 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:54,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:54,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:54,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:54,775 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:54,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:54,776 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:54,776 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:35:54,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:54,776 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:54,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:54,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:54,777 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:54,779 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:54,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:54,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:54,780 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:35:54,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:54,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:54,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:54,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:54,781 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:35:54,781 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:35:54,787 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:54,787 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:35:54,788 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:54,788 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:54,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:54,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:54,788 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:54,788 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:54,789 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:54,789 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:54,789 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:35:54,790 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:54,793 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:54,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:54,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:54,793 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:54,793 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:54,794 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:54,794 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:54,794 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:35:54,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:54,795 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:54,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:54,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:54,795 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:54,795 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:54,795 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:54,799 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:54,799 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:35:54,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:54,800 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2019-01-14 02:35:54,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:54,800 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:54,804 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-01-14 02:35:54,805 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:35:54,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:54,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:35:54,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:54,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:54,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:54,836 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:54,837 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:35:54,837 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:35:54,844 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:54,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:35:54,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:54,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:54,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:54,845 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:54,849 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:35:54,849 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:35:54,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:54,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:35:54,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:54,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:54,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:54,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:54,852 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:35:54,852 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:35:54,877 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:35:54,896 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-14 02:35:54,896 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-14 02:35:54,896 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:35:54,897 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:35:54,897 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:35:54,897 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_8) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_8 Supporting invariants [] [2019-01-14 02:35:55,536 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2019-01-14 02:35:55,606 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:35:55,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:35:55,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:35:55,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:35:56,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:56,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-14 02:35:56,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:56,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:35:56,027 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:35:56,027 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:56,034 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:56,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:56,042 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2019-01-14 02:35:56,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:35:56,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:35:56,157 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 229 treesize of output 124 [2019-01-14 02:35:57,903 WARN L181 SmtUtils]: Spent 1.74 s on a formula simplification. DAG size of input: 155 DAG size of output: 101 [2019-01-14 02:35:57,909 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 85 treesize of output 82 [2019-01-14 02:35:57,910 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:58,353 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 0 case distinctions, treesize of input 75 treesize of output 70 [2019-01-14 02:35:58,354 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 02:35:58,364 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 78 treesize of output 77 [2019-01-14 02:35:58,367 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:58,724 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 61 treesize of output 55 [2019-01-14 02:35:58,729 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 14 treesize of output 13 [2019-01-14 02:35:58,729 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:58,755 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 42 treesize of output 45 [2019-01-14 02:35:58,760 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 28 [2019-01-14 02:35:58,760 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:58,772 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:58,780 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:59,003 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 0 case distinctions, treesize of input 70 treesize of output 58 [2019-01-14 02:35:59,010 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 13 [2019-01-14 02:35:59,010 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:59,031 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 40 treesize of output 35 [2019-01-14 02:35:59,036 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 31 treesize of output 25 [2019-01-14 02:35:59,036 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:59,043 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:59,052 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:59,087 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 61 treesize of output 70 [2019-01-14 02:35:59,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 57 [2019-01-14 02:35:59,093 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:59,163 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 51 treesize of output 50 [2019-01-14 02:35:59,163 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:59,231 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 49 treesize of output 44 [2019-01-14 02:35:59,238 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 28 [2019-01-14 02:35:59,238 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:59,252 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:59,311 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 46 treesize of output 45 [2019-01-14 02:35:59,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 28 [2019-01-14 02:35:59,316 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-01-14 02:35:59,327 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:59,351 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:35:59,411 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:35:59,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 02:35:59,421 INFO L202 ElimStorePlain]: Needed 20 recursive calls to eliminate 2 variables, input treesize:309, output treesize:36 [2019-01-14 02:35:59,548 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:35:59,548 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2019-01-14 02:35:59,549 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 83 transitions. cyclomatic complexity: 26 Second operand 6 states. [2019-01-14 02:35:59,668 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 64 states and 83 transitions. cyclomatic complexity: 26. Second operand 6 states. Result 99 states and 122 transitions. Complement of second has 10 states. [2019-01-14 02:35:59,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 02:35:59,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 02:35:59,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2019-01-14 02:35:59,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 11 letters. Loop has 5 letters. [2019-01-14 02:35:59,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:35:59,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 16 letters. Loop has 5 letters. [2019-01-14 02:35:59,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:35:59,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 11 letters. Loop has 10 letters. [2019-01-14 02:35:59,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:35:59,672 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 122 transitions. [2019-01-14 02:35:59,674 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-14 02:35:59,674 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 79 states and 98 transitions. [2019-01-14 02:35:59,675 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-01-14 02:35:59,675 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-01-14 02:35:59,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 98 transitions. [2019-01-14 02:35:59,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:35:59,675 INFO L706 BuchiCegarLoop]: Abstraction has 79 states and 98 transitions. [2019-01-14 02:35:59,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 98 transitions. [2019-01-14 02:35:59,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 63. [2019-01-14 02:35:59,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-14 02:35:59,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 81 transitions. [2019-01-14 02:35:59,684 INFO L729 BuchiCegarLoop]: Abstraction has 63 states and 81 transitions. [2019-01-14 02:35:59,684 INFO L609 BuchiCegarLoop]: Abstraction has 63 states and 81 transitions. [2019-01-14 02:35:59,684 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2019-01-14 02:35:59,685 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 81 transitions. [2019-01-14 02:35:59,687 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-14 02:35:59,687 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:35:59,687 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:35:59,687 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 1, 1, 1] [2019-01-14 02:35:59,687 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 02:35:59,688 INFO L794 eck$LassoCheckResult]: Stem: 4073#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4071#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem20, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~mem24, main_#t~mem7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6; 4072#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 4101#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 4099#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 4089#L554 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem13; 4090#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~mem20;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 4085#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 4087#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 4081#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 4084#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 4091#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~mem20;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 4114#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 4106#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 4112#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 4097#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 4093#L554-2 [2019-01-14 02:35:59,688 INFO L796 eck$LassoCheckResult]: Loop: 4093#L554-2 assume 0 != main_#t~nondet14;havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;havoc main_#t~mem19; 4094#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 4113#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 4082#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 4083#L554 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem13; 4093#L554-2 [2019-01-14 02:35:59,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:35:59,688 INFO L82 PathProgramCache]: Analyzing trace with hash 339194059, now seen corresponding path program 4 times [2019-01-14 02:35:59,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:35:59,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:35:59,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:35:59,690 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:35:59,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:35:59,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:35:59,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:35:59,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:35:59,739 INFO L82 PathProgramCache]: Analyzing trace with hash 53782946, now seen corresponding path program 3 times [2019-01-14 02:35:59,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:35:59,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:35:59,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:35:59,740 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:35:59,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:35:59,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:35:59,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:35:59,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:35:59,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1493309672, now seen corresponding path program 3 times [2019-01-14 02:35:59,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:35:59,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:35:59,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:35:59,751 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:35:59,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:35:59,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:35:59,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:36:00,317 WARN L181 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2019-01-14 02:36:06,256 WARN L181 SmtUtils]: Spent 5.87 s on a formula simplification. DAG size of input: 235 DAG size of output: 183 [2019-01-14 02:36:06,920 WARN L181 SmtUtils]: Spent 654.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-01-14 02:36:06,925 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:36:06,925 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:36:06,925 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:36:06,925 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:36:06,925 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:36:06,925 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:36:06,926 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:36:06,926 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:36:06,926 INFO L131 ssoRankerPreferences]: Filename of dumped script: min_rf-alloca_true-termination.c.i_Iteration14_Lasso [2019-01-14 02:36:06,926 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:36:06,926 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:36:06,934 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:36:06,940 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:36:06,941 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:36:06,944 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:36:06,945 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:36:06,947 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:36:06,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:36:06,951 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:36:06,954 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:36:06,955 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:36:06,957 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:36:06,959 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:36:09,738 WARN L181 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 76 [2019-01-14 02:36:09,867 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-01-14 02:36:09,868 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:36:09,871 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:36:09,873 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:36:09,875 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:36:09,876 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:36:09,879 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:36:09,881 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:36:09,883 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:36:09,885 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:36:09,886 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:36:09,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:36:09,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:36:09,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:36:09,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:36:09,903 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:36:10,065 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2019-01-14 02:36:10,765 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:36:10,841 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:36:10,841 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:36:10,841 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:36:10,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:36:10,848 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:36:10,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:36:10,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:36:10,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:36:10,848 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:36:10,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:36:10,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:36:10,849 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:36:10,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:36:10,853 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:36:10,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:36:10,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:36:10,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:36:10,853 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:36:10,854 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:36:10,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:36:10,854 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:36:10,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:36:10,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:36:10,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:36:10,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:36:10,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:36:10,855 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:36:10,855 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:36:10,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:36:10,856 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:36:10,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:36:10,856 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:36:10,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:36:10,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:36:10,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:36:10,857 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:36:10,857 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:36:10,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:36:10,858 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:36:10,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:36:10,861 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:36:10,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:36:10,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:36:10,862 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:36:10,862 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:36:10,862 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:36:10,862 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:36:10,863 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:36:10,866 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:36:10,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:36:10,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:36:10,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:36:10,867 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:36:10,867 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:36:10,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:36:10,872 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:36:10,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:36:10,872 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:36:10,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:36:10,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:36:10,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:36:10,873 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:36:10,873 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:36:10,873 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:36:10,873 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:36:10,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:36:10,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:36:10,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:36:10,877 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:36:10,878 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:36:10,878 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:36:10,878 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:36:10,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:36:10,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:36:10,879 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:36:10,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:36:10,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:36:10,880 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:36:10,880 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:36:10,880 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:36:10,880 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:36:10,881 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:36:10,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:36:10,884 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:36:10,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:36:10,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:36:10,885 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:36:10,885 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:36:10,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:36:10,885 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:36:10,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:36:10,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:36:10,887 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:36:10,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:36:10,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:36:10,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:36:10,888 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:36:10,888 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:36:10,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:36:10,888 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:36:10,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:36:10,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:36:10,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:36:10,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:36:10,893 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:36:10,893 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:36:10,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:36:10,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:36:10,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:36:10,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:36:10,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:36:10,899 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:36:10,903 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:36:10,903 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:36:10,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:36:10,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:36:10,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:36:10,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:36:10,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:36:10,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:36:10,911 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:36:10,911 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:36:10,927 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:36:10,930 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:36:10,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:36:10,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:36:10,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:36:10,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:36:10,931 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:36:10,931 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:36:10,937 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:36:10,937 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:36:10,938 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:36:10,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:36:10,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:36:10,938 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:36:10,938 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:36:10,939 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:36:10,945 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:36:10,945 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:36:10,945 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:36:10,945 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2019-01-14 02:36:10,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:36:10,946 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:36:10,948 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-01-14 02:36:10,948 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:36:10,968 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:36:10,969 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:36:10,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:36:10,969 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:36:10,969 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:36:10,970 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:36:10,970 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:36:10,971 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:36:10,980 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:36:10,986 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:36:10,986 INFO L444 ModelExtractionUtils]: 10 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:36:10,987 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:36:10,987 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:36:10,987 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:36:10,987 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_9) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_9 Supporting invariants [] [2019-01-14 02:36:11,513 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2019-01-14 02:36:11,518 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:36:11,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:36:11,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:36:11,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:36:11,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:36:11,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:36:11,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:36:11,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:36:11,671 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:36:11,671 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:36:11,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:36:11,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:36:11,683 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2019-01-14 02:36:11,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:36:11,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:36:11,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 229 treesize of output 124 [2019-01-14 02:36:13,270 WARN L181 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 155 DAG size of output: 101 [2019-01-14 02:36:13,276 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 85 treesize of output 82 [2019-01-14 02:36:13,277 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:36:13,744 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 78 treesize of output 77 [2019-01-14 02:36:13,745 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 02:36:13,753 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 0 case distinctions, treesize of input 75 treesize of output 70 [2019-01-14 02:36:13,754 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 02:36:14,199 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 81 treesize of output 82 [2019-01-14 02:36:14,214 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 75 [2019-01-14 02:36:14,215 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 02:36:14,305 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2019-01-14 02:36:14,306 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 02:36:14,382 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 67 treesize of output 66 [2019-01-14 02:36:14,401 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 28 [2019-01-14 02:36:14,401 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 02:36:14,416 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:36:14,476 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 49 treesize of output 44 [2019-01-14 02:36:14,481 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 28 [2019-01-14 02:36:14,481 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-14 02:36:14,494 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:36:14,548 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:36:14,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 62 [2019-01-14 02:36:14,569 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 26 treesize of output 17 [2019-01-14 02:36:14,569 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-14 02:36:14,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2019-01-14 02:36:14,594 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 31 treesize of output 25 [2019-01-14 02:36:14,594 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-14 02:36:14,602 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:36:14,714 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:36:14,845 INFO L303 Elim1Store]: Index analysis took 129 ms [2019-01-14 02:36:14,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 69 [2019-01-14 02:36:14,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 29 treesize of output 53 [2019-01-14 02:36:14,896 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2019-01-14 02:36:14,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 57 [2019-01-14 02:36:14,960 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 28 [2019-01-14 02:36:14,961 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-01-14 02:36:14,976 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:36:14,990 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 66 treesize of output 69 [2019-01-14 02:36:14,994 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 28 [2019-01-14 02:36:14,994 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-01-14 02:36:15,009 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:36:15,034 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 63 treesize of output 66 [2019-01-14 02:36:15,039 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 28 [2019-01-14 02:36:15,039 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-01-14 02:36:15,054 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:36:15,096 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2019-01-14 02:36:15,380 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 61 treesize of output 55 [2019-01-14 02:36:15,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2019-01-14 02:36:15,384 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-01-14 02:36:15,411 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 42 treesize of output 45 [2019-01-14 02:36:15,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-01-14 02:36:15,416 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-01-14 02:36:15,426 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:36:15,434 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:36:15,461 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:36:15,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 02:36:15,471 INFO L202 ElimStorePlain]: Needed 28 recursive calls to eliminate 2 variables, input treesize:309, output treesize:36 [2019-01-14 02:36:15,605 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:36:15,606 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2019-01-14 02:36:15,606 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 63 states and 81 transitions. cyclomatic complexity: 25 Second operand 6 states. [2019-01-14 02:36:15,736 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 63 states and 81 transitions. cyclomatic complexity: 25. Second operand 6 states. Result 87 states and 108 transitions. Complement of second has 10 states. [2019-01-14 02:36:15,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 02:36:15,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 02:36:15,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2019-01-14 02:36:15,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 16 letters. Loop has 5 letters. [2019-01-14 02:36:15,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:36:15,740 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:36:15,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:36:15,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:36:15,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:36:15,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:36:15,840 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:36:15,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:36:15,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:36:15,863 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:36:15,863 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:36:15,868 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:36:15,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:36:15,874 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2019-01-14 02:36:15,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:36:15,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:36:16,041 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 229 treesize of output 124 [2019-01-14 02:36:18,280 WARN L181 SmtUtils]: Spent 2.23 s on a formula simplification. DAG size of input: 155 DAG size of output: 101 [2019-01-14 02:36:18,286 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 85 treesize of output 82 [2019-01-14 02:36:18,287 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:36:18,877 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 78 treesize of output 77 [2019-01-14 02:36:18,878 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 02:36:18,885 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 0 case distinctions, treesize of input 75 treesize of output 70 [2019-01-14 02:36:18,886 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 02:36:19,370 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 61 treesize of output 55 [2019-01-14 02:36:19,374 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 14 treesize of output 13 [2019-01-14 02:36:19,374 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 02:36:19,398 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 42 treesize of output 45 [2019-01-14 02:36:19,403 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 28 [2019-01-14 02:36:19,404 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 02:36:19,414 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:36:19,421 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:36:19,641 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 0 case distinctions, treesize of input 81 treesize of output 62 [2019-01-14 02:36:19,648 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 26 treesize of output 17 [2019-01-14 02:36:19,649 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 02:36:19,668 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 40 treesize of output 35 [2019-01-14 02:36:19,673 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 31 treesize of output 25 [2019-01-14 02:36:19,673 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-14 02:36:19,679 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:36:19,687 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:36:19,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 82 [2019-01-14 02:36:19,741 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 75 [2019-01-14 02:36:19,741 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-01-14 02:36:19,829 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2019-01-14 02:36:19,829 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-14 02:36:19,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 44 [2019-01-14 02:36:19,904 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 28 [2019-01-14 02:36:19,904 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-01-14 02:36:19,914 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:36:19,983 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 56 treesize of output 55 [2019-01-14 02:36:19,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2019-01-14 02:36:19,989 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-01-14 02:36:20,003 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:36:20,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, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 62 [2019-01-14 02:36:20,066 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 28 [2019-01-14 02:36:20,066 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-01-14 02:36:20,079 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:36:20,106 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:36:20,146 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:36:20,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 02:36:20,154 INFO L202 ElimStorePlain]: Needed 22 recursive calls to eliminate 2 variables, input treesize:309, output treesize:36 [2019-01-14 02:36:20,279 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:36:20,279 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2019-01-14 02:36:20,279 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 63 states and 81 transitions. cyclomatic complexity: 25 Second operand 6 states. [2019-01-14 02:36:20,487 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 63 states and 81 transitions. cyclomatic complexity: 25. Second operand 6 states. Result 87 states and 108 transitions. Complement of second has 10 states. [2019-01-14 02:36:20,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 02:36:20,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 02:36:20,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2019-01-14 02:36:20,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 16 letters. Loop has 5 letters. [2019-01-14 02:36:20,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:36:20,492 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:36:20,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:36:20,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:36:20,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:36:20,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:36:20,560 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:36:20,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:36:20,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:36:20,584 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:36:20,584 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:36:20,591 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:36:20,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:36:20,597 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2019-01-14 02:36:20,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:36:20,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:36:20,724 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 229 treesize of output 124 [2019-01-14 02:36:22,642 WARN L181 SmtUtils]: Spent 1.91 s on a formula simplification. DAG size of input: 155 DAG size of output: 101 [2019-01-14 02:36:22,661 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 82 treesize of output 81 [2019-01-14 02:36:22,662 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:36:22,671 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 0 case distinctions, treesize of input 79 treesize of output 74 [2019-01-14 02:36:22,672 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 02:36:23,150 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 77 treesize of output 74 [2019-01-14 02:36:23,150 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:36:23,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, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 58 [2019-01-14 02:36:23,549 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 13 [2019-01-14 02:36:23,549 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 02:36:23,584 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 40 treesize of output 35 [2019-01-14 02:36:23,626 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 31 treesize of output 25 [2019-01-14 02:36:23,627 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 02:36:23,635 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:36:23,643 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:36:23,654 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 0 case distinctions, treesize of input 64 treesize of output 52 [2019-01-14 02:36:23,658 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 34 treesize of output 39 [2019-01-14 02:36:23,658 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 02:36:23,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2019-01-14 02:36:23,683 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 28 [2019-01-14 02:36:23,683 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-14 02:36:23,689 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:36:23,697 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:36:23,818 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 61 treesize of output 55 [2019-01-14 02:36:23,822 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 14 treesize of output 13 [2019-01-14 02:36:23,823 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-01-14 02:36:23,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 45 [2019-01-14 02:36:23,853 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 28 [2019-01-14 02:36:23,854 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-14 02:36:23,864 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:36:23,871 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:36:23,896 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:36:23,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 02:36:23,906 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 2 variables, input treesize:309, output treesize:36 [2019-01-14 02:36:24,026 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:36:24,026 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 4 loop predicates [2019-01-14 02:36:24,027 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 63 states and 81 transitions. cyclomatic complexity: 25 Second operand 6 states. [2019-01-14 02:36:24,145 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 63 states and 81 transitions. cyclomatic complexity: 25. Second operand 6 states. Result 76 states and 97 transitions. Complement of second has 9 states. [2019-01-14 02:36:24,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 02:36:24,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 02:36:24,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2019-01-14 02:36:24,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 16 letters. Loop has 5 letters. [2019-01-14 02:36:24,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:36:24,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 21 letters. Loop has 5 letters. [2019-01-14 02:36:24,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:36:24,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 16 letters. Loop has 10 letters. [2019-01-14 02:36:24,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:36:24,149 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 97 transitions. [2019-01-14 02:36:24,149 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:36:24,151 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 50 states and 62 transitions. [2019-01-14 02:36:24,152 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-01-14 02:36:24,152 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-01-14 02:36:24,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 62 transitions. [2019-01-14 02:36:24,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:36:24,152 INFO L706 BuchiCegarLoop]: Abstraction has 50 states and 62 transitions. [2019-01-14 02:36:24,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 62 transitions. [2019-01-14 02:36:24,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2019-01-14 02:36:24,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-14 02:36:24,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2019-01-14 02:36:24,154 INFO L729 BuchiCegarLoop]: Abstraction has 48 states and 59 transitions. [2019-01-14 02:36:24,154 INFO L609 BuchiCegarLoop]: Abstraction has 48 states and 59 transitions. [2019-01-14 02:36:24,154 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2019-01-14 02:36:24,155 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 59 transitions. [2019-01-14 02:36:24,161 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:36:24,161 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:36:24,161 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:36:24,162 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 2, 1, 1, 1, 1] [2019-01-14 02:36:24,162 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 02:36:24,162 INFO L794 eck$LassoCheckResult]: Stem: 4745#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4743#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem20, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~mem24, main_#t~mem7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6; 4744#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 4759#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 4785#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 4784#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 4783#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~mem20;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 4782#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 4758#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 4780#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 4779#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 4778#L554-2 assume 0 != main_#t~nondet14;havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;havoc main_#t~mem19; 4770#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 4775#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 4773#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 4771#L554 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem13; 4769#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~mem20;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 4767#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 4764#L553-1 [2019-01-14 02:36:24,162 INFO L796 eck$LassoCheckResult]: Loop: 4764#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 4755#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 4756#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 4762#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~mem20;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 4766#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 4764#L553-1 [2019-01-14 02:36:24,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:36:24,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1640222317, now seen corresponding path program 4 times [2019-01-14 02:36:24,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:36:24,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:36:24,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:36:24,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:36:24,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:36:24,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:36:24,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:36:24,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:36:24,204 INFO L82 PathProgramCache]: Analyzing trace with hash 38421686, now seen corresponding path program 4 times [2019-01-14 02:36:24,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:36:24,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:36:24,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:36:24,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:36:24,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:36:24,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:36:24,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:36:24,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:36:24,216 INFO L82 PathProgramCache]: Analyzing trace with hash -2144846236, now seen corresponding path program 5 times [2019-01-14 02:36:24,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:36:24,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:36:24,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:36:24,217 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:36:24,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:36:24,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:36:24,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:36:24,654 WARN L181 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 86 [2019-01-14 02:36:25,080 WARN L181 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 76 [2019-01-14 02:36:39,436 WARN L181 SmtUtils]: Spent 14.35 s on a formula simplification. DAG size of input: 271 DAG size of output: 221 [2019-01-14 02:37:18,063 WARN L181 SmtUtils]: Spent 38.61 s on a formula simplification. DAG size of input: 161 DAG size of output: 161 [2019-01-14 02:37:18,069 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:37:18,069 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:37:18,069 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:37:18,069 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:37:18,069 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:37:18,069 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:37:18,070 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:37:18,070 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:37:18,070 INFO L131 ssoRankerPreferences]: Filename of dumped script: min_rf-alloca_true-termination.c.i_Iteration15_Lasso [2019-01-14 02:37:18,070 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:37:18,070 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:37:18,076 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:37:18,112 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:37:18,116 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:37:18,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:37:18,121 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:37:18,125 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:37:18,128 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:37:18,130 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:37:18,136 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:37:18,142 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:37:59,005 WARN L181 SmtUtils]: Spent 787.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 87 [2019-01-14 02:37:59,454 WARN L181 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-01-14 02:37:59,454 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:37:59,459 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:37:59,462 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:37:59,465 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:37:59,469 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:37:59,473 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:37:59,476 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:37:59,477 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:37:59,480 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:37:59,483 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:37:59,485 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:37:59,489 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:37:59,490 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:37:59,493 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:37:59,495 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:37:59,916 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-01-14 02:38:00,217 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2019-01-14 02:38:00,391 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2019-01-14 02:38:00,914 WARN L181 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-01-14 02:38:01,088 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:38:01,088 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:38:01,089 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:38:01,089 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:38:01,089 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:38:01,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:38:01,089 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:38:01,090 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:38:01,096 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:38:01,096 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:38:01,097 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:38:01,097 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:38:01,097 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:38:01,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:38:01,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:38:01,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:38:01,098 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:38:01,098 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:38:01,101 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:38:01,102 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:38:01,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:38:01,102 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:38:01,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:38:01,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:38:01,102 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:38:01,103 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:38:01,103 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:38:01,103 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:38:01,103 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:38:01,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:38:01,104 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:38:01,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:38:01,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:38:01,107 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:38:01,107 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:38:01,107 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:38:01,108 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:38:01,108 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:38:01,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:38:01,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:38:01,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:38:01,112 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:38:01,112 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:38:01,112 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:38:01,113 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:38:01,113 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:38:01,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:38:01,114 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:38:01,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:38:01,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:38:01,114 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:38:01,114 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:38:01,114 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:38:01,115 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:38:01,117 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:38:01,117 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:38:01,117 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:38:01,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:38:01,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:38:01,118 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:38:01,118 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:38:01,118 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:38:01,118 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:38:01,119 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:38:01,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:38:01,119 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:38:01,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:38:01,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:38:01,119 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:38:01,119 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:38:01,119 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:38:01,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:38:01,123 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:38:01,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:38:01,124 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:38:01,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:38:01,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:38:01,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:38:01,124 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:38:01,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:38:01,125 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:38:01,128 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:38:01,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:38:01,129 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 02:38:01,129 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:38:01,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:38:01,135 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-01-14 02:38:01,135 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 02:38:01,236 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:38:01,237 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:38:01,237 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:38:01,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:38:01,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:38:01,238 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:38:01,239 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:38:01,239 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:38:01,239 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:38:01,240 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:38:01,240 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:38:01,240 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2019-01-14 02:38:01,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:38:01,241 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:38:01,244 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-01-14 02:38:01,244 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:38:01,255 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:38:01,256 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:38:01,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:38:01,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:38:01,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:38:01,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:38:01,260 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:38:01,260 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:38:01,263 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:38:01,263 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:38:01,263 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:38:01,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:38:01,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:38:01,264 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:38:01,266 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:38:01,266 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:38:01,273 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:38:01,273 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:38:01,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:38:01,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:38:01,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:38:01,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:38:01,274 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:38:01,274 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:38:01,282 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:38:01,283 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:38:01,283 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:38:01,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:38:01,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:38:01,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:38:01,285 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:38:01,285 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:38:01,287 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:38:01,287 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:38:01,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:38:01,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:38:01,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:38:01,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:38:01,288 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:38:01,288 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:38:01,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:38:01,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:38:01,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:38:01,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:38:01,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:38:01,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:38:01,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:38:01,292 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:38:01,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:38:01,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:38:01,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:38:01,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:38:01,293 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:38:01,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:38:01,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:38:01,294 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:38:01,294 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:38:01,294 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:38:01,294 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:38:01,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:38:01,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:38:01,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:38:01,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:38:01,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:38:01,296 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:38:01,296 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:38:01,296 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:38:01,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:38:01,297 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:38:01,297 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:38:01,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:38:01,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:38:01,297 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:38:01,297 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:38:01,298 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:38:01,298 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:38:01,298 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:38:01,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:38:01,298 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:38:01,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:38:01,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:38:01,299 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:38:01,299 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:38:01,299 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:38:01,299 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:38:01,300 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:38:01,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:38:01,300 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:38:01,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:38:01,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:38:01,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:38:01,301 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:38:01,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:38:01,302 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:38:01,303 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:38:01,303 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:38:01,303 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:38:01,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:38:01,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:38:01,303 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:38:01,304 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:38:01,304 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:38:01,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:38:01,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:38:01,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:38:01,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:38:01,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:38:01,305 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:38:01,305 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:38:01,305 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:38:01,306 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:38:01,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:38:01,307 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:38:01,307 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:38:01,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:38:01,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:38:01,307 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:38:01,308 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:38:01,308 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:38:01,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:38:01,308 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:38:01,312 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:38:01,312 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:38:01,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:38:01,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:38:01,312 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:38:01,313 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:38:01,313 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:38:01,313 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:38:01,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:38:01,314 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:38:01,314 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:38:01,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:38:01,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:38:01,314 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:38:01,314 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:38:01,315 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:38:01,315 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:38:01,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:38:01,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:38:01,316 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:38:01,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:38:01,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:38:01,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:38:01,316 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:38:01,316 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:38:01,317 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:38:01,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:38:01,317 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:38:01,317 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:38:01,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:38:01,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:38:01,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:38:01,318 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:38:01,318 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:38:01,319 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:38:01,319 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:38:01,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:38:01,319 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:38:01,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:38:01,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:38:01,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:38:01,320 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:38:01,320 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:38:01,321 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:38:01,321 INFO L497 LassoAnalysis]: Using template '2-nested'. [2019-01-14 02:38:01,321 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:38:01,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:38:01,322 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:38:01,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:38:01,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:38:01,322 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:38:01,322 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:38:01,322 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:38:01,323 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:38:01,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:38:01,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:38:01,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:38:01,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:38:01,324 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:38:01,324 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-14 02:38:01,325 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-14 02:38:01,327 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:38:01,327 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:38:01,328 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:38:01,328 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:38:01,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:38:01,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:38:01,328 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:38:01,328 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:38:01,328 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:38:01,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:38:01,329 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:38:01,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:38:01,330 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:38:01,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:38:01,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:38:01,330 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:38:01,330 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:38:01,330 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:38:01,331 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:38:01,331 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:38:01,331 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:38:01,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:38:01,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:38:01,332 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:38:01,332 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-14 02:38:01,332 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-14 02:38:01,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:38:01,333 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:38:01,334 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:38:01,334 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:38:01,334 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:38:01,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:38:01,334 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:38:01,334 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:38:01,334 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:38:01,335 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:38:01,335 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:38:01,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:38:01,336 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:38:01,336 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:38:01,336 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:38:01,336 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:38:01,336 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:38:01,336 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:38:01,337 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:38:01,337 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:38:01,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:38:01,337 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:38:01,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:38:01,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:38:01,338 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:38:01,338 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:38:01,338 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:38:01,338 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:38:01,339 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:38:01,339 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:38:01,339 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:38:01,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:38:01,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:38:01,339 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:38:01,340 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:38:01,340 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:38:01,340 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:38:01,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:38:01,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:38:01,341 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 02:38:01,341 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:38:01,341 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:38:01,346 INFO L402 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2019-01-14 02:38:01,346 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2019-01-14 02:38:01,576 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:38:01,698 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-14 02:38:01,698 INFO L444 ModelExtractionUtils]: 40 out of 49 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-01-14 02:38:01,699 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:38:01,701 INFO L440 nArgumentSynthesizer]: Removed 6 redundant supporting invariants from a total of 6. [2019-01-14 02:38:01,701 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:38:01,701 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function 2-nested ranking function: f0 = 2*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_10 + 1 f1 = 2*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_10 Supporting invariants [] [2019-01-14 02:38:02,469 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2019-01-14 02:38:02,536 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:38:02,537 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:38:02,537 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:38:02,538 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:38:02,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:38:02,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:38:02,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:38:02,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:02,689 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:38:02,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:02,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:02,711 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:38:02,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:02,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:38:02,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:38:02,724 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2019-01-14 02:38:02,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:38:02,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:38:02,888 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 54 treesize of output 51 [2019-01-14 02:38:02,909 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:38:02,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:02,933 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:38:03,076 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 56 treesize of output 53 [2019-01-14 02:38:03,080 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:38:03,080 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:03,094 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:38:03,168 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 54 treesize of output 51 [2019-01-14 02:38:03,171 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:38:03,171 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:03,186 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:38:03,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:38:03,228 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:232, output treesize:103 [2019-01-14 02:38:03,739 WARN L181 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 80 [2019-01-14 02:38:03,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:03,791 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 3 case distinctions, treesize of input 271 treesize of output 162 [2019-01-14 02:38:06,013 WARN L181 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 183 DAG size of output: 104 [2019-01-14 02:38:06,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:06,020 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 115 treesize of output 118 [2019-01-14 02:38:06,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:06,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:06,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:06,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:06,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:06,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 139 [2019-01-14 02:38:06,322 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:06,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:06,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 107 [2019-01-14 02:38:06,684 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 71 treesize of output 69 [2019-01-14 02:38:06,684 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:06,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 75 [2019-01-14 02:38:06,730 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 63 treesize of output 61 [2019-01-14 02:38:06,731 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:06,746 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:38:06,766 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:38:06,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:06,886 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 0 case distinctions, treesize of input 112 treesize of output 100 [2019-01-14 02:38:06,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:06,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:06,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:06,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 120 [2019-01-14 02:38:06,897 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:06,937 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 76 treesize of output 67 [2019-01-14 02:38:06,943 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 63 treesize of output 61 [2019-01-14 02:38:06,943 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:06,978 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:38:06,994 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:38:07,062 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:38:07,185 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 273 treesize of output 152 [2019-01-14 02:38:11,098 WARN L181 SmtUtils]: Spent 3.91 s on a formula simplification. DAG size of input: 174 DAG size of output: 111 [2019-01-14 02:38:11,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:11,108 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 117 [2019-01-14 02:38:11,108 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:11,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:11,121 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 110 treesize of output 127 [2019-01-14 02:38:11,121 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:11,627 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 119 treesize of output 114 [2019-01-14 02:38:11,628 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:12,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:12,066 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 0 case distinctions, treesize of input 92 treesize of output 88 [2019-01-14 02:38:12,072 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-01-14 02:38:12,072 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:12,102 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 51 treesize of output 44 [2019-01-14 02:38:12,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2019-01-14 02:38:12,109 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:12,118 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:38:12,133 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:38:12,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:12,146 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 0 case distinctions, treesize of input 106 treesize of output 92 [2019-01-14 02:38:12,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:12,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:12,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:12,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 114 [2019-01-14 02:38:12,158 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:12,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:12,197 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 70 treesize of output 75 [2019-01-14 02:38:12,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:12,204 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 71 treesize of output 75 [2019-01-14 02:38:12,204 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:12,219 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:38:12,236 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:38:12,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:12,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 110 [2019-01-14 02:38:12,457 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 101 treesize of output 99 [2019-01-14 02:38:12,457 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:12,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:12,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:12,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:12,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:12,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 124 [2019-01-14 02:38:12,594 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:12,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:12,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:12,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:12,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 112 [2019-01-14 02:38:12,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:12,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2019-01-14 02:38:12,727 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:12,758 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:38:12,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:12,856 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 80 treesize of output 85 [2019-01-14 02:38:12,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:12,860 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 71 treesize of output 75 [2019-01-14 02:38:12,860 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:12,881 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:38:12,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:12,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 82 [2019-01-14 02:38:12,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:12,973 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 71 treesize of output 75 [2019-01-14 02:38:12,973 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:12,992 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:38:13,018 INFO L267 ElimStorePlain]: Start of recursive call 25: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:38:13,103 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:38:13,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2019-01-14 02:38:13,275 INFO L202 ElimStorePlain]: Needed 33 recursive calls to eliminate 4 variables, input treesize:689, output treesize:185 [2019-01-14 02:38:13,362 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:38:13,362 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:38:13,362 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 59 transitions. cyclomatic complexity: 16 Second operand 7 states. [2019-01-14 02:38:13,551 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 59 transitions. cyclomatic complexity: 16. Second operand 7 states. Result 72 states and 85 transitions. Complement of second has 12 states. [2019-01-14 02:38:13,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-01-14 02:38:13,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 02:38:13,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2019-01-14 02:38:13,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. Stem has 18 letters. Loop has 5 letters. [2019-01-14 02:38:13,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:38:13,555 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:38:13,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:38:13,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:38:13,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:38:13,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:13,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:38:13,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:13,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:13,660 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:38:13,660 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:13,667 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:38:13,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:38:13,675 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2019-01-14 02:38:13,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:38:13,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:38:13,852 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 54 treesize of output 51 [2019-01-14 02:38:13,857 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:38:13,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:13,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:38:13,966 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 54 treesize of output 51 [2019-01-14 02:38:13,970 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:38:13,971 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:13,987 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:38:14,090 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 56 treesize of output 53 [2019-01-14 02:38:14,095 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:38:14,096 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:14,112 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:38:14,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:38:14,153 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:232, output treesize:103 [2019-01-14 02:38:14,614 WARN L181 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 80 [2019-01-14 02:38:14,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:14,663 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 3 case distinctions, treesize of input 271 treesize of output 162 [2019-01-14 02:38:16,568 WARN L181 SmtUtils]: Spent 1.90 s on a formula simplification. DAG size of input: 183 DAG size of output: 104 [2019-01-14 02:38:16,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:16,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:16,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:16,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:16,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 139 [2019-01-14 02:38:16,582 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:16,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:16,855 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 115 treesize of output 118 [2019-01-14 02:38:16,856 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:17,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:17,117 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 107 [2019-01-14 02:38:17,123 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 71 treesize of output 69 [2019-01-14 02:38:17,124 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:17,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 75 [2019-01-14 02:38:17,166 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 63 treesize of output 61 [2019-01-14 02:38:17,166 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:17,181 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:38:17,200 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:38:17,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:17,280 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 0 case distinctions, treesize of input 112 treesize of output 100 [2019-01-14 02:38:17,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:17,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:17,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:17,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 120 [2019-01-14 02:38:17,292 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:17,335 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 76 treesize of output 67 [2019-01-14 02:38:17,340 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 63 treesize of output 61 [2019-01-14 02:38:17,341 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:17,354 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:38:17,369 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:38:17,437 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:38:17,566 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 273 treesize of output 152 [2019-01-14 02:38:19,877 WARN L181 SmtUtils]: Spent 2.31 s on a formula simplification. DAG size of input: 174 DAG size of output: 111 [2019-01-14 02:38:19,882 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 119 treesize of output 114 [2019-01-14 02:38:19,883 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:20,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:20,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 106 [2019-01-14 02:38:20,441 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:20,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:20,449 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 110 treesize of output 127 [2019-01-14 02:38:20,450 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:20,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:20,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:20,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, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 121 treesize of output 131 [2019-01-14 02:38:20,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:21,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:21,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 124 treesize of output 178 [2019-01-14 02:38:21,027 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 3 xjuncts. [2019-01-14 02:38:21,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:21,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:21,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:21,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:21,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 114 [2019-01-14 02:38:21,327 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:21,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:21,523 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 70 treesize of output 77 [2019-01-14 02:38:21,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:21,535 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 56 treesize of output 60 [2019-01-14 02:38:21,535 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:21,560 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:38:21,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:21,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:21,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:21,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 102 [2019-01-14 02:38:21,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:21,704 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 54 treesize of output 52 [2019-01-14 02:38:21,704 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:21,729 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:38:21,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:21,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:21,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:21,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 114 [2019-01-14 02:38:21,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:21,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 125 [2019-01-14 02:38:21,864 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:21,895 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:38:21,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:21,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:21,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:21,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 93 [2019-01-14 02:38:21,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:21,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 73 [2019-01-14 02:38:21,916 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:21,942 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:38:22,017 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:38:22,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:22,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 88 [2019-01-14 02:38:22,418 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-01-14 02:38:22,418 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:22,455 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 51 treesize of output 44 [2019-01-14 02:38:22,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2019-01-14 02:38:22,460 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:22,470 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:38:22,483 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:38:22,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:22,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 92 [2019-01-14 02:38:22,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:22,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:22,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:22,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 114 [2019-01-14 02:38:22,502 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:22,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:22,536 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 70 treesize of output 75 [2019-01-14 02:38:22,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:22,541 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 71 treesize of output 75 [2019-01-14 02:38:22,541 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:22,556 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:38:22,572 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:38:22,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:22,760 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 3 case distinctions, treesize of input 107 treesize of output 110 [2019-01-14 02:38:22,766 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 101 treesize of output 99 [2019-01-14 02:38:22,766 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:22,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:22,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:22,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:22,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:22,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 124 [2019-01-14 02:38:22,915 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:23,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:23,043 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 80 treesize of output 85 [2019-01-14 02:38:23,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:23,049 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 71 treesize of output 75 [2019-01-14 02:38:23,049 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:23,073 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:38:23,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:23,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:23,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:23,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 112 [2019-01-14 02:38:23,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:23,177 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 54 treesize of output 52 [2019-01-14 02:38:23,178 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:23,205 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:38:23,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:23,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 82 [2019-01-14 02:38:23,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:23,296 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 71 treesize of output 75 [2019-01-14 02:38:23,296 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:23,313 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:38:23,342 INFO L267 ElimStorePlain]: Start of recursive call 36: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:38:23,393 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:38:23,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2019-01-14 02:38:23,454 INFO L202 ElimStorePlain]: Needed 44 recursive calls to eliminate 4 variables, input treesize:689, output treesize:185 [2019-01-14 02:38:23,542 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:38:23,543 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 5 loop predicates [2019-01-14 02:38:23,543 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 59 transitions. cyclomatic complexity: 16 Second operand 7 states. [2019-01-14 02:38:23,772 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 59 transitions. cyclomatic complexity: 16. Second operand 7 states. Result 70 states and 82 transitions. Complement of second has 12 states. [2019-01-14 02:38:23,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-01-14 02:38:23,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 02:38:23,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2019-01-14 02:38:23,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. Stem has 18 letters. Loop has 5 letters. [2019-01-14 02:38:23,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:38:23,776 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:38:23,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:38:23,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:38:23,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:38:23,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:23,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:38:23,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:23,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:23,871 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:38:23,871 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:23,878 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:38:23,885 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:38:23,885 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2019-01-14 02:38:23,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:38:23,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:38:24,081 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 54 treesize of output 51 [2019-01-14 02:38:24,084 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:38:24,085 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:24,101 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:38:24,204 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 56 treesize of output 53 [2019-01-14 02:38:24,207 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:38:24,208 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:24,224 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:38:24,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:38:24,300 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:232, output treesize:103 [2019-01-14 02:38:24,780 WARN L181 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 80 [2019-01-14 02:38:24,835 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 273 treesize of output 152 [2019-01-14 02:38:27,024 WARN L181 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 174 DAG size of output: 111 [2019-01-14 02:38:27,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:27,035 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 110 treesize of output 127 [2019-01-14 02:38:27,036 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:27,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:27,042 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 117 [2019-01-14 02:38:27,043 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:27,387 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 119 treesize of output 114 [2019-01-14 02:38:27,388 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:27,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:27,752 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 101 [2019-01-14 02:38:27,757 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 65 treesize of output 63 [2019-01-14 02:38:27,757 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:27,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:27,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 83 [2019-01-14 02:38:27,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:27,804 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 71 treesize of output 75 [2019-01-14 02:38:27,804 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:27,823 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:38:27,842 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:38:28,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:28,084 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 0 case distinctions, treesize of input 106 treesize of output 96 [2019-01-14 02:38:28,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:28,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:28,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:28,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 114 [2019-01-14 02:38:28,094 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:28,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:28,136 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 70 treesize of output 75 [2019-01-14 02:38:28,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:28,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 71 treesize of output 75 [2019-01-14 02:38:28,155 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:28,170 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:38:28,186 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:38:28,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:28,199 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 0 case distinctions, treesize of input 110 treesize of output 110 [2019-01-14 02:38:28,203 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-01-14 02:38:28,204 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:28,237 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 69 treesize of output 58 [2019-01-14 02:38:28,242 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 56 [2019-01-14 02:38:28,243 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:28,255 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:38:28,273 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:38:28,403 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:38:28,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:28,559 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 3 case distinctions, treesize of input 271 treesize of output 162 [2019-01-14 02:38:30,305 WARN L181 SmtUtils]: Spent 1.74 s on a formula simplification. DAG size of input: 183 DAG size of output: 104 [2019-01-14 02:38:30,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:30,311 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 115 treesize of output 118 [2019-01-14 02:38:30,312 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:30,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:30,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:30,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:30,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:30,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 139 [2019-01-14 02:38:30,590 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:30,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:30,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 100 [2019-01-14 02:38:30,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:30,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:30,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:30,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 120 [2019-01-14 02:38:30,880 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:30,926 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 76 treesize of output 67 [2019-01-14 02:38:30,933 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 63 treesize of output 61 [2019-01-14 02:38:30,933 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:30,947 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:38:30,964 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:38:31,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:31,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:31,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:31,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:31,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 128 [2019-01-14 02:38:31,145 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:38:31,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:31,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:31,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:31,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:31,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:31,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:31,161 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 192 [2019-01-14 02:38:31,162 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:31,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:31,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:31,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 101 [2019-01-14 02:38:31,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2019-01-14 02:38:31,239 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:31,262 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:38:31,285 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:38:31,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:31,425 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 3 case distinctions, treesize of input 113 treesize of output 114 [2019-01-14 02:38:31,430 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 107 treesize of output 105 [2019-01-14 02:38:31,430 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:31,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:31,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:31,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:31,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:38:31,585 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 130 [2019-01-14 02:38:31,585 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:31,734 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 86 treesize of output 77 [2019-01-14 02:38:31,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 61 [2019-01-14 02:38:31,742 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:31,772 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:38:31,884 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 87 treesize of output 74 [2019-01-14 02:38:31,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 61 [2019-01-14 02:38:31,889 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2019-01-14 02:38:31,907 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:38:31,961 INFO L267 ElimStorePlain]: Start of recursive call 29: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:38:31,993 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:38:32,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2019-01-14 02:38:32,059 INFO L202 ElimStorePlain]: Needed 35 recursive calls to eliminate 4 variables, input treesize:689, output treesize:207 [2019-01-14 02:38:32,156 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:38:32,157 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 5 loop predicates [2019-01-14 02:38:32,157 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 59 transitions. cyclomatic complexity: 16 Second operand 7 states. [2019-01-14 02:38:32,356 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 59 transitions. cyclomatic complexity: 16. Second operand 7 states. Result 91 states and 108 transitions. Complement of second has 11 states. [2019-01-14 02:38:32,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-01-14 02:38:32,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 02:38:32,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 17 transitions. [2019-01-14 02:38:32,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 17 transitions. Stem has 18 letters. Loop has 5 letters. [2019-01-14 02:38:32,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:38:32,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 17 transitions. Stem has 23 letters. Loop has 5 letters. [2019-01-14 02:38:32,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:38:32,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 17 transitions. Stem has 18 letters. Loop has 10 letters. [2019-01-14 02:38:32,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:38:32,362 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 108 transitions. [2019-01-14 02:38:32,363 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:38:32,363 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 0 states and 0 transitions. [2019-01-14 02:38:32,363 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:38:32,363 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:38:32,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:38:32,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:38:32,363 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:38:32,363 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:38:32,363 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:38:32,363 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2019-01-14 02:38:32,364 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:38:32,367 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:38:32,367 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:38:32,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:38:32 BoogieIcfgContainer [2019-01-14 02:38:32,383 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:38:32,383 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:38:32,383 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:38:32,384 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:38:32,384 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:34:12" (3/4) ... [2019-01-14 02:38:32,389 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:38:32,389 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:38:32,399 INFO L168 Benchmark]: Toolchain (without parser) took 260936.50 ms. Allocated memory was 1.0 GB in the beginning and 6.9 GB in the end (delta: 5.8 GB). Free memory was 951.3 MB in the beginning and 4.1 GB in the end (delta: -3.1 GB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. [2019-01-14 02:38:32,403 INFO L168 Benchmark]: CDTParser took 0.36 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:38:32,403 INFO L168 Benchmark]: CACSL2BoogieTranslator took 697.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -181.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:38:32,404 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.43 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-14 02:38:32,404 INFO L168 Benchmark]: Boogie Preprocessor took 56.15 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:38:32,404 INFO L168 Benchmark]: RCFGBuilder took 676.21 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.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. [2019-01-14 02:38:32,404 INFO L168 Benchmark]: BuchiAutomizer took 259402.66 ms. Allocated memory was 1.2 GB in the beginning and 6.9 GB in the end (delta: 5.7 GB). Free memory was 1.1 GB in the beginning and 4.1 GB in the end (delta: -3.0 GB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. [2019-01-14 02:38:32,407 INFO L168 Benchmark]: Witness Printer took 6.19 ms. Allocated memory is still 6.9 GB. Free memory is still 4.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:38:32,408 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.36 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 697.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -181.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 82.43 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 56.15 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 676.21 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.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 259402.66 ms. Allocated memory was 1.2 GB in the beginning and 6.9 GB in the end (delta: 5.7 GB). Free memory was 1.1 GB in the beginning and 4.1 GB in the end (delta: -3.0 GB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. * Witness Printer took 6.19 ms. Allocated memory is still 6.9 GB. Free memory is still 4.1 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 - 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 15 terminating modules (5 trivial, 6 deterministic, 4 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 8 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[z][z] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 7 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 5 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[z][z] and consists of 6 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 7 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 9 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[z][z] and consists of 6 locations. One nondeterministic module has 2-nested ranking function (if 2 * unknown-#memory_int-unknown[y][y] + 1 > 0 then 1 else 0), (if 2 * unknown-#memory_int-unknown[y][y] + 1 > 0 then 2 * unknown-#memory_int-unknown[y][y] + 1 else 2 * unknown-#memory_int-unknown[x][x]) and consists of 7 locations. 5 modules have a trivial ranking function, the largest among these consists of 18 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 259.3s and 16 iterations. TraceHistogramMax:4. Analysis of lassos took 168.0s. Construction of modules took 2.5s. Büchi inclusion checks took 88.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 14. Automata minimization 0.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 194 StatesRemovedByMinimization, 13 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 72 states and ocurred in iteration 9. Nontrivial modules had stage [6, 0, 4, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/5 HoareTripleCheckerStatistics: 58 SDtfs, 247 SDslu, 68 SDs, 0 SdLazy, 1241 SolverSat, 252 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU3 SILI0 SILT0 lasso10 LassoPreprocessingBenchmarks: Lassos: inital3231893 mio100 ax100 hnf99 lsp89 ukn5 mio100 lsp34 div100 bol102 ite100 ukn100 eq176 hnf89 smp92 dnf320 smp87 tf100 neg92 sie126 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 360ms VariablesStem: 7 VariablesLoop: 8 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 6 MotzkinApplications: 30 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...