./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/reducercommutativity/max_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/reducercommutativity/max_true-unreach-call_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash c721a987debd4748cfed075333b7fa46c2d0f9ef .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 04:54:51,567 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:54:51,569 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:54:51,581 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:54:51,581 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:54:51,582 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:54:51,583 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:54:51,586 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:54:51,587 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:54:51,590 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:54:51,591 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:54:51,593 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:54:51,594 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:54:51,596 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:54:51,597 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:54:51,598 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:54:51,599 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:54:51,601 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:54:51,603 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:54:51,605 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:54:51,606 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:54:51,607 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:54:51,610 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:54:51,610 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:54:51,610 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:54:51,611 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:54:51,612 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:54:51,613 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:54:51,614 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:54:51,617 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:54:51,618 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:54:51,618 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:54:51,619 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:54:51,619 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:54:51,623 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:54:51,624 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:54:51,624 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 04:54:51,654 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:54:51,654 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:54:51,656 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:54:51,656 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:54:51,656 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:54:51,656 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:54:51,656 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:54:51,657 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:54:51,657 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:54:51,657 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:54:51,657 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:54:51,657 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:54:51,657 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:54:51,658 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:54:51,658 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:54:51,658 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:54:51,658 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:54:51,658 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:54:51,658 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:54:51,659 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:54:51,659 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:54:51,659 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:54:51,659 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:54:51,659 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:54:51,660 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:54:51,660 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:54:51,663 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:54:51,663 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:54:51,663 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:54:51,663 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:54:51,664 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:54:51,664 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:54:51,665 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c721a987debd4748cfed075333b7fa46c2d0f9ef [2019-01-14 04:54:51,701 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:54:51,718 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:54:51,726 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:54:51,728 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:54:51,728 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:54:51,729 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/reducercommutativity/max_true-unreach-call_true-termination.i [2019-01-14 04:54:51,798 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b87b2e49/e12507c9875746edb40bf55c0bfdd99e/FLAG1a42c758a [2019-01-14 04:54:52,178 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:54:52,179 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/reducercommutativity/max_true-unreach-call_true-termination.i [2019-01-14 04:54:52,184 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b87b2e49/e12507c9875746edb40bf55c0bfdd99e/FLAG1a42c758a [2019-01-14 04:54:52,581 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b87b2e49/e12507c9875746edb40bf55c0bfdd99e [2019-01-14 04:54:52,585 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:54:52,586 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:54:52,588 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:54:52,588 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:54:52,591 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:54:52,592 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:54:52" (1/1) ... [2019-01-14 04:54:52,595 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c8a6077 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:54:52, skipping insertion in model container [2019-01-14 04:54:52,595 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:54:52" (1/1) ... [2019-01-14 04:54:52,604 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:54:52,627 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:54:52,876 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:54:52,892 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:54:52,917 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:54:52,936 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:54:52,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:54:52 WrapperNode [2019-01-14 04:54:52,937 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:54:52,938 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:54:52,938 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:54:52,938 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:54:52,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:54:52" (1/1) ... [2019-01-14 04:54:52,959 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:54:52" (1/1) ... [2019-01-14 04:54:52,987 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:54:52,988 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:54:52,988 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:54:52,988 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:54:52,999 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:54:52" (1/1) ... [2019-01-14 04:54:52,999 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:54:52" (1/1) ... [2019-01-14 04:54:53,003 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:54:52" (1/1) ... [2019-01-14 04:54:53,003 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:54:52" (1/1) ... [2019-01-14 04:54:53,012 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:54:52" (1/1) ... [2019-01-14 04:54:53,082 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:54:52" (1/1) ... [2019-01-14 04:54:53,084 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:54:52" (1/1) ... [2019-01-14 04:54:53,088 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:54:53,088 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:54:53,088 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:54:53,088 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:54:53,089 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:54:52" (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 04:54:53,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 04:54:53,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:54:53,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:54:53,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 04:54:53,163 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 04:54:53,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 04:54:53,819 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:54:53,819 INFO L286 CfgBuilder]: Removed 14 assue(true) statements. [2019-01-14 04:54:53,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:54:53 BoogieIcfgContainer [2019-01-14 04:54:53,821 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:54:53,822 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:54:53,822 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:54:53,826 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:54:53,826 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:54:53,826 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:54:52" (1/3) ... [2019-01-14 04:54:53,827 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@16b0ca47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:54:53, skipping insertion in model container [2019-01-14 04:54:53,828 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:54:53,828 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:54:52" (2/3) ... [2019-01-14 04:54:53,828 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@16b0ca47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:54:53, skipping insertion in model container [2019-01-14 04:54:53,828 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:54:53,828 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:54:53" (3/3) ... [2019-01-14 04:54:53,830 INFO L375 chiAutomizerObserver]: Analyzing ICFG max_true-unreach-call_true-termination.i [2019-01-14 04:54:53,886 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:54:53,887 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:54:53,887 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:54:53,887 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:54:53,887 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:54:53,887 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:54:53,888 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:54:53,888 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:54:53,888 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:54:53,903 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2019-01-14 04:54:53,926 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-01-14 04:54:53,927 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:54:53,927 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:54:53,934 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 04:54:53,935 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:54:53,935 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:54:53,935 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2019-01-14 04:54:53,938 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-01-14 04:54:53,939 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:54:53,939 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:54:53,939 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 04:54:53,939 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:54:53,949 INFO L794 eck$LassoCheckResult]: Stem: 31#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 9#L-1true havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 8#L20true assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 6#L11-3true [2019-01-14 04:54:53,949 INFO L796 eck$LassoCheckResult]: Loop: 6#L11-3true assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 12#L12true assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 11#L12-2true max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 7#L11-2true max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 6#L11-3true [2019-01-14 04:54:53,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:53,956 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2019-01-14 04:54:53,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:53,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:54,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:54,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:54:54,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:54,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:54,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:54,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:54,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1326822, now seen corresponding path program 1 times [2019-01-14 04:54:54,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:54,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:54,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:54,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:54:54,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:54,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:54,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:54,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:54,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1805089543, now seen corresponding path program 1 times [2019-01-14 04:54:54,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:54,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:54,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:54,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:54:54,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:54,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:54,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:54,651 WARN L181 SmtUtils]: Spent 289.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-01-14 04:54:54,767 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-14 04:54:54,786 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:54:54,787 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:54:54,787 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:54:54,787 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:54:54,787 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:54:54,788 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:54:54,788 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:54:54,788 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:54:54,788 INFO L131 ssoRankerPreferences]: Filename of dumped script: max_true-unreach-call_true-termination.i_Iteration1_Lasso [2019-01-14 04:54:54,788 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:54:54,789 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:54:54,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:54,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:54,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 04:54:54,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 04:54:54,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:54,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 04:54:54,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:55,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 04:54:55,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:55,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:55,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:55,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 04:54:55,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:55,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 04:54:55,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 04:54:55,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 04:54:55,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 04:54:55,398 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2019-01-14 04:54:55,657 WARN L181 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-01-14 04:54:55,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:55,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 04:54:55,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 04:54:55,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:55,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:55,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:56,228 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:54:56,232 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:54:56,234 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:54:56,236 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:56,236 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:56,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:56,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:56,237 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:56,239 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:56,239 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:56,242 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:56,243 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:54:56,243 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:56,244 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:56,245 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:56,245 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:56,245 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:56,246 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:56,246 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:56,248 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:56,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 04:54:56,250 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:56,250 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:56,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:56,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:56,250 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:56,252 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:56,252 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:56,253 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:56,253 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:54:56,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:56,255 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:56,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:56,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:56,255 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:56,256 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:56,256 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:56,257 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:56,258 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:54:56,260 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:56,260 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:56,260 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:56,260 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:56,261 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:56,262 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:56,262 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:56,263 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:56,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 04:54:56,264 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:56,264 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:56,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:56,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:56,265 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:56,266 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:56,267 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:56,268 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:56,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 04:54:56,271 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:56,272 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:56,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:56,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:56,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:56,274 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:56,274 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:56,275 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:56,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 04:54:56,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:56,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:56,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:56,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:56,281 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:54:56,282 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:54:56,286 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:56,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 04:54:56,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:56,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:56,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:56,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:56,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:56,291 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:56,291 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:56,292 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:56,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 04:54:56,294 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:56,295 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:56,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:56,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:56,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:56,296 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:56,296 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:56,298 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:56,299 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:54:56,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:56,300 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:56,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:56,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:56,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:56,303 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:56,303 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:56,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:56,305 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:54:56,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:56,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:56,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:56,307 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:56,310 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:54:56,310 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:54:56,318 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:56,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 04:54:56,320 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:56,320 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:56,320 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:56,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:56,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:56,321 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:56,321 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:56,322 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:56,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 04:54:56,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:56,324 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:56,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:56,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:56,325 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:56,327 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:56,327 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:56,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:56,330 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:54:56,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:56,332 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:56,332 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:56,332 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:56,332 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:56,333 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:56,334 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:56,334 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:56,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 04:54:56,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:56,337 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:56,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:56,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:56,338 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:56,338 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:56,339 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:56,341 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:56,342 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:54:56,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:56,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:56,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:56,345 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:56,347 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:54:56,348 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:54:56,368 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:56,369 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:54:56,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:56,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:56,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:56,370 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:56,374 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:54:56,374 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:54:56,389 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:56,389 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:54:56,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:56,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:56,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:56,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:56,397 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:54:56,397 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:54:56,453 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:54:56,523 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2019-01-14 04:54:56,523 INFO L444 ModelExtractionUtils]: 16 out of 25 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-01-14 04:54:56,528 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:54:56,529 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 04:54:56,530 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:54:56,531 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_max_~i~0, v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1, ULTIMATE.start_max_~x.offset) = -4*ULTIMATE.start_max_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1 - 1*ULTIMATE.start_max_~x.offset Supporting invariants [] [2019-01-14 04:54:56,563 INFO L297 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed [2019-01-14 04:54:56,575 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 04:54:56,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:56,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:54:56,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:54:56,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:54:56,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:54:56,717 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 04:54:56,730 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 04:54:56,731 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states. Second operand 3 states. [2019-01-14 04:54:56,860 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states.. Second operand 3 states. Result 63 states and 87 transitions. Complement of second has 8 states. [2019-01-14 04:54:56,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 04:54:56,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:54:56,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2019-01-14 04:54:56,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 46 transitions. Stem has 3 letters. Loop has 4 letters. [2019-01-14 04:54:56,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:54:56,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 46 transitions. Stem has 7 letters. Loop has 4 letters. [2019-01-14 04:54:56,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:54:56,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 46 transitions. Stem has 3 letters. Loop has 8 letters. [2019-01-14 04:54:56,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:54:56,868 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 87 transitions. [2019-01-14 04:54:56,873 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-01-14 04:54:56,877 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 23 states and 32 transitions. [2019-01-14 04:54:56,878 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-01-14 04:54:56,879 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-01-14 04:54:56,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 32 transitions. [2019-01-14 04:54:56,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:54:56,880 INFO L706 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2019-01-14 04:54:56,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 32 transitions. [2019-01-14 04:54:56,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-14 04:54:56,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-14 04:54:56,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 32 transitions. [2019-01-14 04:54:56,905 INFO L729 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2019-01-14 04:54:56,905 INFO L609 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2019-01-14 04:54:56,905 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:54:56,905 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 32 transitions. [2019-01-14 04:54:56,906 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-01-14 04:54:56,906 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:54:56,906 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:54:56,908 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:54:56,908 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:54:56,909 INFO L794 eck$LassoCheckResult]: Stem: 178#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 175#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 174#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 169#L11-3 assume !(max_~i~0 < ~N~0); 163#L11-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 164#L14 main_#t~ret5 := max_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 181#L11-8 [2019-01-14 04:54:56,910 INFO L796 eck$LassoCheckResult]: Loop: 181#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 173#L12-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 165#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 166#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 181#L11-8 [2019-01-14 04:54:56,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:56,910 INFO L82 PathProgramCache]: Analyzing trace with hash 889511083, now seen corresponding path program 1 times [2019-01-14 04:54:56,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:56,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:56,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:56,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:54:56,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:56,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:54:57,010 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 04:54:57,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:54:57,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:54:57,015 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:54:57,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:57,015 INFO L82 PathProgramCache]: Analyzing trace with hash 2034854, now seen corresponding path program 1 times [2019-01-14 04:54:57,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:57,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:57,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:57,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:54:57,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:57,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:57,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:57,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:54:57,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:54:57,107 INFO L87 Difference]: Start difference. First operand 23 states and 32 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-01-14 04:54:57,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:54:57,220 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2019-01-14 04:54:57,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:54:57,222 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 33 transitions. [2019-01-14 04:54:57,223 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-01-14 04:54:57,224 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 33 transitions. [2019-01-14 04:54:57,224 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-01-14 04:54:57,224 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-01-14 04:54:57,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 33 transitions. [2019-01-14 04:54:57,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:54:57,226 INFO L706 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-01-14 04:54:57,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 33 transitions. [2019-01-14 04:54:57,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2019-01-14 04:54:57,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-14 04:54:57,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2019-01-14 04:54:57,230 INFO L729 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-01-14 04:54:57,231 INFO L609 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-01-14 04:54:57,231 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:54:57,231 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2019-01-14 04:54:57,233 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-01-14 04:54:57,233 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:54:57,233 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:54:57,233 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:54:57,234 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:54:57,235 INFO L794 eck$LassoCheckResult]: Stem: 233#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 231#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 229#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 224#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 225#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 232#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 227#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 226#L11-3 assume !(max_~i~0 < ~N~0); 218#L11-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 219#L14 main_#t~ret5 := max_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 236#L11-8 [2019-01-14 04:54:57,235 INFO L796 eck$LassoCheckResult]: Loop: 236#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 228#L12-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 220#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 221#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 236#L11-8 [2019-01-14 04:54:57,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:57,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1805667996, now seen corresponding path program 1 times [2019-01-14 04:54:57,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:57,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:57,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:57,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:54:57,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:57,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:54:57,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:54:57,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:54:57,321 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 04:54:57,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:54:57,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:54:57,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:54:57,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:54:57,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:54:57,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-01-14 04:54:57,444 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:54:57,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:57,445 INFO L82 PathProgramCache]: Analyzing trace with hash 2034854, now seen corresponding path program 2 times [2019-01-14 04:54:57,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:57,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:57,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:57,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:54:57,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:57,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:57,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:57,567 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-01-14 04:54:57,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 04:54:57,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 04:54:57,634 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. cyclomatic complexity: 10 Second operand 6 states. [2019-01-14 04:54:57,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:54:57,734 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2019-01-14 04:54:57,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 04:54:57,736 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 38 transitions. [2019-01-14 04:54:57,738 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-01-14 04:54:57,739 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 38 transitions. [2019-01-14 04:54:57,739 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-01-14 04:54:57,740 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-01-14 04:54:57,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 38 transitions. [2019-01-14 04:54:57,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:54:57,741 INFO L706 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2019-01-14 04:54:57,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 38 transitions. [2019-01-14 04:54:57,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2019-01-14 04:54:57,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-14 04:54:57,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2019-01-14 04:54:57,744 INFO L729 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-01-14 04:54:57,744 INFO L609 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-01-14 04:54:57,744 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 04:54:57,745 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 34 transitions. [2019-01-14 04:54:57,746 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-01-14 04:54:57,747 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:54:57,747 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:54:57,747 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-14 04:54:57,747 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:54:57,748 INFO L794 eck$LassoCheckResult]: Stem: 324#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 320#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 319#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 313#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 314#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 329#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 317#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 315#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 316#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 322#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 323#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 328#L11-3 assume !(max_~i~0 < ~N~0); 307#L11-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 308#L14 main_#t~ret5 := max_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 327#L11-8 [2019-01-14 04:54:57,748 INFO L796 eck$LassoCheckResult]: Loop: 327#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 318#L12-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 309#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 310#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 327#L11-8 [2019-01-14 04:54:57,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:57,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1818198429, now seen corresponding path program 2 times [2019-01-14 04:54:57,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:57,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:57,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:57,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:54:57,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:57,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:57,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:57,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:57,816 INFO L82 PathProgramCache]: Analyzing trace with hash 2034854, now seen corresponding path program 3 times [2019-01-14 04:54:57,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:57,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:57,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:57,820 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:54:57,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:57,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:57,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:57,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:57,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1198284866, now seen corresponding path program 1 times [2019-01-14 04:54:57,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:57,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:57,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:57,837 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:54:57,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:57,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:54:58,135 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 16 [2019-01-14 04:54:58,489 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:54:58,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:54:58,489 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 04:54:58,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:54:58,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:54:58,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:54:58,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2019-01-14 04:54:58,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 04:54:58,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 33 [2019-01-14 04:54:58,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 04:54:58,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-01-14 04:54:58,810 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 04:54:58,820 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 04:54:58,828 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 04:54:58,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 04:54:58,845 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:41, output treesize:17 [2019-01-14 04:54:58,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-01-14 04:54:59,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-01-14 04:54:59,001 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 04:54:59,017 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 04:54:59,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 04:54:59,025 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2019-01-14 04:54:59,065 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:54:59,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:54:59,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2019-01-14 04:54:59,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-14 04:54:59,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-01-14 04:54:59,126 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. cyclomatic complexity: 11 Second operand 17 states. [2019-01-14 04:54:59,686 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 31 [2019-01-14 04:55:01,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:55:01,317 INFO L93 Difference]: Finished difference Result 106 states and 134 transitions. [2019-01-14 04:55:01,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-14 04:55:01,318 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 106 states and 134 transitions. [2019-01-14 04:55:01,321 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 22 [2019-01-14 04:55:01,325 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 106 states to 106 states and 134 transitions. [2019-01-14 04:55:01,325 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 85 [2019-01-14 04:55:01,325 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 85 [2019-01-14 04:55:01,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 134 transitions. [2019-01-14 04:55:01,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:55:01,328 INFO L706 BuchiCegarLoop]: Abstraction has 106 states and 134 transitions. [2019-01-14 04:55:01,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 134 transitions. [2019-01-14 04:55:01,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 39. [2019-01-14 04:55:01,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-14 04:55:01,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2019-01-14 04:55:01,335 INFO L729 BuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2019-01-14 04:55:01,335 INFO L609 BuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2019-01-14 04:55:01,335 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 04:55:01,335 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 50 transitions. [2019-01-14 04:55:01,338 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-01-14 04:55:01,338 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:55:01,338 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:55:01,339 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:55:01,339 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:55:01,340 INFO L794 eck$LassoCheckResult]: Stem: 559#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 556#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 554#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 547#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 548#L12 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 569#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 570#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 549#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 550#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 557#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 558#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 565#L11-3 assume !(max_~i~0 < ~N~0); 566#L11-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 564#L14 main_#t~ret5 := max_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 562#L11-8 [2019-01-14 04:55:01,340 INFO L796 eck$LassoCheckResult]: Loop: 562#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 563#L12-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 543#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 544#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 562#L11-8 [2019-01-14 04:55:01,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:55:01,340 INFO L82 PathProgramCache]: Analyzing trace with hash -2083741857, now seen corresponding path program 1 times [2019-01-14 04:55:01,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:55:01,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:55:01,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:55:01,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:55:01,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:55:01,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:55:01,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:55:01,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:55:01,383 INFO L82 PathProgramCache]: Analyzing trace with hash 2034854, now seen corresponding path program 4 times [2019-01-14 04:55:01,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:55:01,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:55:01,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:55:01,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:55:01,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:55:01,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:55:01,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:55:01,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:55:01,393 INFO L82 PathProgramCache]: Analyzing trace with hash -2085565180, now seen corresponding path program 1 times [2019-01-14 04:55:01,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:55:01,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:55:01,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:55:01,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:55:01,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:55:01,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:55:01,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:55:01,560 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-01-14 04:55:01,964 WARN L181 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 116 [2019-01-14 04:55:02,243 WARN L181 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-01-14 04:55:02,248 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:55:02,248 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:55:02,248 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:55:02,248 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:55:02,249 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:55:02,249 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:55:02,249 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:55:02,249 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:55:02,249 INFO L131 ssoRankerPreferences]: Filename of dumped script: max_true-unreach-call_true-termination.i_Iteration5_Lasso [2019-01-14 04:55:02,249 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:55:02,249 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:55:02,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:02,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:02,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:02,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:02,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:02,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:02,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:02,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:02,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:02,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:02,792 WARN L181 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-01-14 04:55:02,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:02,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:02,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:02,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:02,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:02,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:02,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:02,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:02,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:02,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:02,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:03,281 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:55:03,281 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:55:03,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 04:55:03,282 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:55:03,282 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:55:03,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:55:03,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:55:03,285 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:55:03,286 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:55:03,286 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:55:03,287 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:55:03,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 04:55:03,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:55:03,289 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:55:03,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:55:03,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:55:03,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:55:03,290 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:55:03,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:55:03,291 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:55:03,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 04:55:03,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:55:03,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:55:03,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:55:03,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:55:03,294 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:55:03,294 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:55:03,294 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:55:03,295 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:55:03,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 04:55:03,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:55:03,299 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:55:03,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:55:03,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:55:03,299 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:55:03,300 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:55:03,300 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:55:03,300 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:55:03,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 04:55:03,303 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:55:03,303 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:55:03,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:55:03,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:55:03,306 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:55:03,306 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:55:03,306 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:55:03,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:55:03,309 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:55:03,309 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:55:03,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:55:03,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:55:03,310 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:55:03,311 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:55:03,311 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:55:03,316 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:55:03,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 04:55:03,317 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:55:03,317 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:55:03,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:55:03,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:55:03,317 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:55:03,318 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:55:03,320 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:55:03,321 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:55:03,322 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:55:03,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:55:03,322 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:55:03,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:55:03,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:55:03,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:55:03,323 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:55:03,326 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:55:03,327 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:55:03,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 04:55:03,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:55:03,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:55:03,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:55:03,331 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:55:03,332 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:55:03,333 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:55:03,335 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:55:03,336 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:55:03,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:55:03,336 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:55:03,336 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:55:03,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:55:03,337 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:55:03,337 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:55:03,337 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:55:03,337 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:55:03,342 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:55:03,343 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:55:03,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:55:03,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:55:03,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:55:03,347 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:55:03,348 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:55:03,356 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:55:03,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 04:55:03,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:55:03,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:55:03,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:55:03,358 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:55:03,361 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:55:03,362 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:55:03,367 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:55:03,368 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:55:03,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:55:03,368 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 04:55:03,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:55:03,368 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:55:03,373 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 04:55:03,373 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:55:03,379 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:55:03,380 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:55:03,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:55:03,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:55:03,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:55:03,383 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:55:03,384 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:55:03,384 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:55:03,387 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:55:03,388 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:55:03,389 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:55:03,389 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 04:55:03,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:55:03,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:55:03,393 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 04:55:03,393 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:55:03,400 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:55:03,401 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:55:03,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:55:03,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:55:03,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:55:03,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:55:03,407 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:55:03,407 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:55:03,421 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:55:03,444 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-14 04:55:03,444 INFO L444 ModelExtractionUtils]: 19 out of 25 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-14 04:55:03,445 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:55:03,446 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 04:55:03,447 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:55:03,447 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_max_~x.base)_2, ULTIMATE.start_max_~i~0, ULTIMATE.start_max_~x.offset) = 1*v_rep(select #length ULTIMATE.start_max_~x.base)_2 - 4*ULTIMATE.start_max_~i~0 - 1*ULTIMATE.start_max_~x.offset Supporting invariants [] [2019-01-14 04:55:03,569 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-01-14 04:55:03,584 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 04:55:03,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:55:03,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:55:03,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:55:03,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:55:03,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:55:04,020 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 04:55:04,021 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 04:55:04,021 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 50 transitions. cyclomatic complexity: 16 Second operand 3 states. [2019-01-14 04:55:04,277 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 50 transitions. cyclomatic complexity: 16. Second operand 3 states. Result 49 states and 67 transitions. Complement of second has 7 states. [2019-01-14 04:55:04,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 04:55:04,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:55:04,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2019-01-14 04:55:04,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 14 letters. Loop has 4 letters. [2019-01-14 04:55:04,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:55:04,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 18 letters. Loop has 4 letters. [2019-01-14 04:55:04,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:55:04,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 14 letters. Loop has 8 letters. [2019-01-14 04:55:04,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:55:04,283 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 67 transitions. [2019-01-14 04:55:04,289 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-14 04:55:04,290 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 40 states and 52 transitions. [2019-01-14 04:55:04,290 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-01-14 04:55:04,290 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-01-14 04:55:04,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 52 transitions. [2019-01-14 04:55:04,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:55:04,295 INFO L706 BuchiCegarLoop]: Abstraction has 40 states and 52 transitions. [2019-01-14 04:55:04,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 52 transitions. [2019-01-14 04:55:04,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-01-14 04:55:04,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-14 04:55:04,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2019-01-14 04:55:04,298 INFO L729 BuchiCegarLoop]: Abstraction has 40 states and 52 transitions. [2019-01-14 04:55:04,298 INFO L609 BuchiCegarLoop]: Abstraction has 40 states and 52 transitions. [2019-01-14 04:55:04,298 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 04:55:04,298 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 52 transitions. [2019-01-14 04:55:04,299 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-14 04:55:04,299 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:55:04,299 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:55:04,300 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:55:04,300 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 04:55:04,300 INFO L794 eck$LassoCheckResult]: Stem: 739#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 737#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 735#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 729#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 730#L12 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 758#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 757#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 756#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 751#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 754#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 752#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 750#L11-3 assume !(max_~i~0 < ~N~0); 749#L11-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 748#L14 main_#t~ret5 := max_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 747#L11-8 assume !(max_~i~0 < ~N~0); 742#L11-9 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 743#L14-1 main_#t~ret8 := max_#res;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 727#L32-3 [2019-01-14 04:55:04,300 INFO L796 eck$LassoCheckResult]: Loop: 727#L32-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem11; 728#L32-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 727#L32-3 [2019-01-14 04:55:04,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:55:04,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1591298555, now seen corresponding path program 1 times [2019-01-14 04:55:04,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:55:04,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:55:04,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:55:04,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:55:04,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:55:04,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:55:04,487 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-14 04:55:04,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:55:04,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 04:55:04,488 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:55:04,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:55:04,489 INFO L82 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 1 times [2019-01-14 04:55:04,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:55:04,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:55:04,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:55:04,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:55:04,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:55:04,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:55:04,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:55:04,882 WARN L181 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-01-14 04:55:04,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 04:55:04,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 04:55:04,924 INFO L87 Difference]: Start difference. First operand 40 states and 52 transitions. cyclomatic complexity: 17 Second operand 4 states. [2019-01-14 04:55:04,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:55:04,980 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2019-01-14 04:55:04,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 04:55:04,980 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 59 transitions. [2019-01-14 04:55:04,981 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-14 04:55:04,982 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 59 transitions. [2019-01-14 04:55:04,982 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-01-14 04:55:04,982 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-01-14 04:55:04,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 59 transitions. [2019-01-14 04:55:04,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:55:04,983 INFO L706 BuchiCegarLoop]: Abstraction has 47 states and 59 transitions. [2019-01-14 04:55:04,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 59 transitions. [2019-01-14 04:55:04,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2019-01-14 04:55:04,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-14 04:55:04,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2019-01-14 04:55:04,990 INFO L729 BuchiCegarLoop]: Abstraction has 40 states and 50 transitions. [2019-01-14 04:55:04,990 INFO L609 BuchiCegarLoop]: Abstraction has 40 states and 50 transitions. [2019-01-14 04:55:04,990 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 04:55:04,990 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 50 transitions. [2019-01-14 04:55:04,991 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-14 04:55:04,991 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:55:04,991 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:55:04,991 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:55:04,991 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 04:55:04,992 INFO L794 eck$LassoCheckResult]: Stem: 834#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 831#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 829#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 823#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 824#L12 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 832#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 833#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 852#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 847#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 850#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 848#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 846#L11-3 assume !(max_~i~0 < ~N~0); 817#L11-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 818#L14 main_#t~ret5 := max_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 838#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 839#L12-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 819#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 820#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 840#L11-8 assume !(max_~i~0 < ~N~0); 836#L11-9 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 837#L14-1 main_#t~ret8 := max_#res;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 821#L32-3 [2019-01-14 04:55:04,992 INFO L796 eck$LassoCheckResult]: Loop: 821#L32-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem11; 822#L32-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 821#L32-3 [2019-01-14 04:55:04,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:55:04,992 INFO L82 PathProgramCache]: Analyzing trace with hash -18080898, now seen corresponding path program 1 times [2019-01-14 04:55:04,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:55:04,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:55:04,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:55:04,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:55:04,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:55:05,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:55:05,263 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-14 04:55:05,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:55:05,263 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 04:55:05,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:55:05,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:55:05,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:55:05,414 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-14 04:55:05,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:55:05,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-01-14 04:55:05,434 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:55:05,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:55:05,434 INFO L82 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 2 times [2019-01-14 04:55:05,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:55:05,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:55:05,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:55:05,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:55:05,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:55:05,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:55:05,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:55:05,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 04:55:05,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-14 04:55:05,555 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. cyclomatic complexity: 15 Second operand 7 states. [2019-01-14 04:55:05,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:55:05,648 INFO L93 Difference]: Finished difference Result 60 states and 75 transitions. [2019-01-14 04:55:05,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 04:55:05,650 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 75 transitions. [2019-01-14 04:55:05,651 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-14 04:55:05,652 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 60 states and 75 transitions. [2019-01-14 04:55:05,653 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-01-14 04:55:05,653 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-01-14 04:55:05,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 75 transitions. [2019-01-14 04:55:05,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:55:05,656 INFO L706 BuchiCegarLoop]: Abstraction has 60 states and 75 transitions. [2019-01-14 04:55:05,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 75 transitions. [2019-01-14 04:55:05,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 44. [2019-01-14 04:55:05,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-14 04:55:05,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2019-01-14 04:55:05,660 INFO L729 BuchiCegarLoop]: Abstraction has 44 states and 55 transitions. [2019-01-14 04:55:05,660 INFO L609 BuchiCegarLoop]: Abstraction has 44 states and 55 transitions. [2019-01-14 04:55:05,660 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-14 04:55:05,660 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 55 transitions. [2019-01-14 04:55:05,663 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-14 04:55:05,663 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:55:05,663 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:55:05,665 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:55:05,665 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 04:55:05,665 INFO L794 eck$LassoCheckResult]: Stem: 1006#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 1003#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 1002#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 995#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 996#L12 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 1028#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1027#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 997#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 998#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1007#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1023#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1020#L11-3 assume !(max_~i~0 < ~N~0); 1019#L11-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1018#L14 main_#t~ret5 := max_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1017#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1016#L12-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1015#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1014#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1012#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1001#L12-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 991#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 992#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1013#L11-8 assume !(max_~i~0 < ~N~0); 1008#L11-9 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1009#L14-1 main_#t~ret8 := max_#res;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 993#L32-3 [2019-01-14 04:55:05,665 INFO L796 eck$LassoCheckResult]: Loop: 993#L32-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem11; 994#L32-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 993#L32-3 [2019-01-14 04:55:05,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:55:05,665 INFO L82 PathProgramCache]: Analyzing trace with hash -2011161481, now seen corresponding path program 2 times [2019-01-14 04:55:05,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:55:05,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:55:05,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:55:05,666 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:55:05,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:55:05,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:55:06,048 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 25 [2019-01-14 04:55:06,425 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:55:06,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:55:06,425 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 04:55:06,435 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 04:55:06,484 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 04:55:06,484 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 04:55:06,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:55:06,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2019-01-14 04:55:06,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2019-01-14 04:55:06,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2019-01-14 04:55:06,567 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 04:55:06,575 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 04:55:06,582 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 04:55:06,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 04:55:06,598 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:42, output treesize:17 [2019-01-14 04:55:06,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-01-14 04:55:06,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-01-14 04:55:06,694 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 04:55:06,711 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 04:55:06,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 04:55:06,751 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2019-01-14 04:55:06,773 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-14 04:55:06,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:55:06,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 19 [2019-01-14 04:55:06,792 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:55:06,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:55:06,792 INFO L82 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 3 times [2019-01-14 04:55:06,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:55:06,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:55:06,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:55:06,793 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:55:06,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:55:06,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:55:06,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:55:06,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-14 04:55:06,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2019-01-14 04:55:06,894 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. cyclomatic complexity: 16 Second operand 19 states. [2019-01-14 04:55:08,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:55:08,461 INFO L93 Difference]: Finished difference Result 87 states and 107 transitions. [2019-01-14 04:55:08,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-14 04:55:08,462 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87 states and 107 transitions. [2019-01-14 04:55:08,464 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-01-14 04:55:08,466 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87 states to 87 states and 107 transitions. [2019-01-14 04:55:08,466 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2019-01-14 04:55:08,466 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2019-01-14 04:55:08,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 107 transitions. [2019-01-14 04:55:08,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:55:08,469 INFO L706 BuchiCegarLoop]: Abstraction has 87 states and 107 transitions. [2019-01-14 04:55:08,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 107 transitions. [2019-01-14 04:55:08,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 56. [2019-01-14 04:55:08,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-14 04:55:08,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2019-01-14 04:55:08,474 INFO L729 BuchiCegarLoop]: Abstraction has 56 states and 70 transitions. [2019-01-14 04:55:08,474 INFO L609 BuchiCegarLoop]: Abstraction has 56 states and 70 transitions. [2019-01-14 04:55:08,475 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-14 04:55:08,475 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 70 transitions. [2019-01-14 04:55:08,475 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-14 04:55:08,475 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:55:08,475 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:55:08,476 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:55:08,476 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 04:55:08,477 INFO L794 eck$LassoCheckResult]: Stem: 1257#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 1254#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 1252#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1246#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1247#L12 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 1285#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1283#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1281#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1276#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1278#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1277#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1275#L11-3 assume !(max_~i~0 < ~N~0); 1274#L11-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1273#L14 main_#t~ret5 := max_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1272#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1271#L12-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 1242#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1243#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1269#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1266#L12-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1268#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1267#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1265#L11-8 assume !(max_~i~0 < ~N~0); 1259#L11-9 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1260#L14-1 main_#t~ret8 := max_#res;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 1244#L32-3 [2019-01-14 04:55:08,480 INFO L796 eck$LassoCheckResult]: Loop: 1244#L32-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem11; 1245#L32-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1244#L32-3 [2019-01-14 04:55:08,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:55:08,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1618134471, now seen corresponding path program 1 times [2019-01-14 04:55:08,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:55:08,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:55:08,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:55:08,482 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:55:08,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:55:08,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:55:08,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:55:08,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:55:08,577 INFO L82 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 4 times [2019-01-14 04:55:08,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:55:08,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:55:08,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:55:08,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:55:08,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:55:08,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:55:08,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:55:08,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:55:08,588 INFO L82 PathProgramCache]: Analyzing trace with hash -249063589, now seen corresponding path program 1 times [2019-01-14 04:55:08,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:55:08,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:55:08,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:55:08,589 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:55:08,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:55:08,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:55:08,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:55:08,942 WARN L181 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-01-14 04:55:10,042 WARN L181 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 191 DAG size of output: 161 [2019-01-14 04:55:11,179 WARN L181 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 105 DAG size of output: 101 [2019-01-14 04:55:11,181 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:55:11,181 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:55:11,181 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:55:11,182 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:55:11,182 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:55:11,182 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:55:11,182 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:55:11,182 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:55:11,182 INFO L131 ssoRankerPreferences]: Filename of dumped script: max_true-unreach-call_true-termination.i_Iteration9_Lasso [2019-01-14 04:55:11,183 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:55:11,183 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:55:11,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:11,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:11,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:11,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:11,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:11,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:11,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:11,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 04:55:11,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:11,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 04:55:11,411 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-01-14 04:55:12,018 WARN L181 SmtUtils]: Spent 601.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 81 [2019-01-14 04:55:12,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:12,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:12,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 04:55:12,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:12,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:12,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:12,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:12,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 04:55:12,762 WARN L181 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 69 [2019-01-14 04:55:13,467 WARN L181 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2019-01-14 04:55:13,493 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:55:13,493 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:55:13,493 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:55:13,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:55:13,497 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:55:13,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:55:13,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:55:13,497 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:55:13,498 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:55:13,498 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:55:13,498 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:55:13,500 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:55:13,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:55:13,500 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:55:13,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:55:13,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:55:13,501 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:55:13,502 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:55:13,502 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:55:13,502 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:55:13,502 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:55:13,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:55:13,503 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:55:13,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:55:13,504 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:55:13,504 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:55:13,504 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:55:13,504 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:55:13,504 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:55:13,505 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:55:13,505 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:55:13,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:55:13,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:55:13,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:55:13,506 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:55:13,506 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:55:13,508 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:55:13,508 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:55:13,509 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:55:13,509 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:55:13,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:55:13,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:55:13,509 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:55:13,509 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:55:13,509 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:55:13,513 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:55:13,514 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:55:13,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:55:13,515 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:55:13,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:55:13,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:55:13,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:55:13,515 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:55:13,515 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:55:13,516 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:55:13,516 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:55:13,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:55:13,517 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:55:13,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:55:13,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:55:13,517 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:55:13,518 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:55:13,518 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:55:13,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:55:13,521 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:55:13,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:55:13,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:55:13,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:55:13,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:55:13,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:55:13,522 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:55:13,522 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:55:13,522 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:55:13,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:55:13,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:55:13,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:55:13,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:55:13,523 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:55:13,525 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:55:13,525 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:55:13,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:55:13,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:55:13,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:55:13,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:55:13,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:55:13,537 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:55:13,538 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:55:13,538 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:55:13,547 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:55:13,547 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:55:13,547 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:55:13,548 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 04:55:13,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:55:13,548 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:55:13,553 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 04:55:13,553 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:55:13,559 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:55:13,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 04:55:13,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:55:13,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:55:13,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:55:13,564 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:55:13,568 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:55:13,568 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:55:13,596 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:55:13,609 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 04:55:13,610 INFO L444 ModelExtractionUtils]: 21 out of 25 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:55:13,610 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:55:13,613 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 04:55:13,614 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:55:13,614 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, ~N~0) = -1*ULTIMATE.start_main_~i~1 + 1*~N~0 Supporting invariants [] [2019-01-14 04:55:13,855 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-01-14 04:55:14,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:55:14,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:55:14,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:55:14,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:55:14,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:55:14,058 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 04:55:14,059 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 04:55:14,059 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 70 transitions. cyclomatic complexity: 20 Second operand 3 states. [2019-01-14 04:55:14,084 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 70 transitions. cyclomatic complexity: 20. Second operand 3 states. Result 63 states and 82 transitions. Complement of second has 6 states. [2019-01-14 04:55:14,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 04:55:14,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:55:14,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2019-01-14 04:55:14,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 25 letters. Loop has 2 letters. [2019-01-14 04:55:14,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:55:14,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 27 letters. Loop has 2 letters. [2019-01-14 04:55:14,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:55:14,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 25 letters. Loop has 4 letters. [2019-01-14 04:55:14,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:55:14,088 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 82 transitions. [2019-01-14 04:55:14,089 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 04:55:14,090 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 57 states and 72 transitions. [2019-01-14 04:55:14,090 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-01-14 04:55:14,090 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-01-14 04:55:14,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 72 transitions. [2019-01-14 04:55:14,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:55:14,091 INFO L706 BuchiCegarLoop]: Abstraction has 57 states and 72 transitions. [2019-01-14 04:55:14,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 72 transitions. [2019-01-14 04:55:14,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-01-14 04:55:14,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-14 04:55:14,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 72 transitions. [2019-01-14 04:55:14,097 INFO L729 BuchiCegarLoop]: Abstraction has 57 states and 72 transitions. [2019-01-14 04:55:14,097 INFO L609 BuchiCegarLoop]: Abstraction has 57 states and 72 transitions. [2019-01-14 04:55:14,098 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-14 04:55:14,098 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 72 transitions. [2019-01-14 04:55:14,098 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 04:55:14,098 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:55:14,098 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:55:14,103 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:55:14,103 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:55:14,104 INFO L794 eck$LassoCheckResult]: Stem: 1517#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 1514#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 1513#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1506#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1507#L12 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 1518#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1551#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1550#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1542#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1546#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1544#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1541#L11-3 assume !(max_~i~0 < ~N~0); 1539#L11-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1536#L14 main_#t~ret5 := max_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1534#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1530#L12-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 1512#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1529#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1528#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1525#L12-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1527#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1526#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1524#L11-8 assume !(max_~i~0 < ~N~0); 1519#L11-9 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1520#L14-1 main_#t~ret8 := max_#res;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 1503#L32-3 assume !(main_~i~1 < ~N~0 - 1); 1497#L32-4 call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4 * (~N~0 - 1), 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1498#L11-13 [2019-01-14 04:55:14,104 INFO L796 eck$LassoCheckResult]: Loop: 1498#L11-13 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1495#L12-6 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 1496#L12-8 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1515#L11-12 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1498#L11-13 [2019-01-14 04:55:14,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:55:14,104 INFO L82 PathProgramCache]: Analyzing trace with hash -249063647, now seen corresponding path program 1 times [2019-01-14 04:55:14,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:55:14,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:55:14,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:55:14,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:55:14,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:55:14,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:55:14,194 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-01-14 04:55:14,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:55:14,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 04:55:14,194 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:55:14,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:55:14,195 INFO L82 PathProgramCache]: Analyzing trace with hash 3173862, now seen corresponding path program 1 times [2019-01-14 04:55:14,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:55:14,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:55:14,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:55:14,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:55:14,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:55:14,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:55:14,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:55:14,358 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-01-14 04:55:14,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 04:55:14,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 04:55:14,374 INFO L87 Difference]: Start difference. First operand 57 states and 72 transitions. cyclomatic complexity: 21 Second operand 4 states. [2019-01-14 04:55:14,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:55:14,398 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2019-01-14 04:55:14,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 04:55:14,399 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 72 transitions. [2019-01-14 04:55:14,400 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 04:55:14,401 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 58 states and 72 transitions. [2019-01-14 04:55:14,401 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-01-14 04:55:14,401 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-01-14 04:55:14,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 72 transitions. [2019-01-14 04:55:14,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:55:14,402 INFO L706 BuchiCegarLoop]: Abstraction has 58 states and 72 transitions. [2019-01-14 04:55:14,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 72 transitions. [2019-01-14 04:55:14,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-01-14 04:55:14,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-14 04:55:14,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 71 transitions. [2019-01-14 04:55:14,405 INFO L729 BuchiCegarLoop]: Abstraction has 57 states and 71 transitions. [2019-01-14 04:55:14,405 INFO L609 BuchiCegarLoop]: Abstraction has 57 states and 71 transitions. [2019-01-14 04:55:14,405 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-14 04:55:14,405 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 71 transitions. [2019-01-14 04:55:14,406 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 04:55:14,406 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:55:14,406 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:55:14,407 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:55:14,407 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:55:14,407 INFO L794 eck$LassoCheckResult]: Stem: 1639#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 1636#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 1635#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1628#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1629#L12 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 1671#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1669#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1667#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1659#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1664#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1661#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1658#L11-3 assume !(max_~i~0 < ~N~0); 1656#L11-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1654#L14 main_#t~ret5 := max_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1653#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1652#L12-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 1634#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1651#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1650#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1647#L12-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1649#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1648#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1646#L11-8 assume !(max_~i~0 < ~N~0); 1640#L11-9 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1641#L14-1 main_#t~ret8 := max_#res;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 1625#L32-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem11; 1626#L32-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1627#L32-3 assume !(main_~i~1 < ~N~0 - 1); 1619#L32-4 call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4 * (~N~0 - 1), 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1620#L11-13 [2019-01-14 04:55:14,408 INFO L796 eck$LassoCheckResult]: Loop: 1620#L11-13 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1617#L12-6 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 1618#L12-8 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1637#L11-12 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1620#L11-13 [2019-01-14 04:55:14,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:55:14,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1168061379, now seen corresponding path program 1 times [2019-01-14 04:55:14,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:55:14,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:55:14,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:55:14,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:55:14,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:55:14,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:55:14,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:55:14,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:55:14,449 INFO L82 PathProgramCache]: Analyzing trace with hash 3173862, now seen corresponding path program 2 times [2019-01-14 04:55:14,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:55:14,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:55:14,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:55:14,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:55:14,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:55:14,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:55:14,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:55:14,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:55:14,454 INFO L82 PathProgramCache]: Analyzing trace with hash 934015144, now seen corresponding path program 1 times [2019-01-14 04:55:14,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:55:14,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:55:14,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:55:14,455 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:55:14,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:55:14,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:55:14,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:55:14,636 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-01-14 04:55:15,894 WARN L181 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 233 DAG size of output: 193 [2019-01-14 04:55:16,716 WARN L181 SmtUtils]: Spent 801.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 91 [2019-01-14 04:55:16,718 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:55:16,719 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:55:16,719 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:55:16,719 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:55:16,719 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:55:16,719 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:55:16,719 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:55:16,719 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:55:16,720 INFO L131 ssoRankerPreferences]: Filename of dumped script: max_true-unreach-call_true-termination.i_Iteration11_Lasso [2019-01-14 04:55:16,720 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:55:16,720 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:55:16,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:16,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 04:55:16,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:16,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:16,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:16,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:16,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:16,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:16,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:16,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:16,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:16,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:16,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:16,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:16,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:16,871 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-01-14 04:55:17,369 WARN L181 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2019-01-14 04:55:17,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:17,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:17,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:17,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:55:17,649 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-01-14 04:55:18,009 WARN L181 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-01-14 04:55:18,084 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:55:18,084 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:55:18,085 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:55:18,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:55:18,085 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:55:18,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:55:18,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:55:18,091 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:55:18,091 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:55:18,092 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:55:18,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:55: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 04:55:18,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:55:18,094 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:55:18,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:55:18,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:55:18,095 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:55:18,097 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:55:18,097 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:55:18,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:55:18,098 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:55:18,098 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:55:18,098 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:55:18,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:55:18,099 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:55:18,099 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:55:18,099 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:55:18,099 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:55:18,099 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:55: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 04:55:18,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:55:18,101 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:55:18,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:55:18,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:55:18,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:55:18,102 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:55:18,102 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:55:18,102 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:55:18,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 04:55:18,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:55:18,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:55:18,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:55:18,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:55:18,106 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:55:18,107 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:55:18,108 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:55:18,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 04:55:18,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:55:18,109 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:55:18,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:55:18,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:55:18,109 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:55:18,110 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:55:18,110 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:55:18,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:55:18,112 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:55:18,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:55:18,113 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:55:18,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:55:18,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:55:18,113 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:55:18,113 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:55:18,113 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:55:18,114 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:55:18,114 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:55:18,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:55:18,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:55:18,115 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:55:18,115 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:55:18,115 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:55:18,115 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:55:18,119 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:55:18,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 04:55:18,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:55:18,120 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:55:18,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:55:18,121 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:55:18,121 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:55:18,121 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:55:18,122 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:55:18,122 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:55:18,122 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:55:18,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:55:18,123 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:55:18,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:55:18,123 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:55:18,123 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:55:18,124 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:55:18,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:55:18,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:55:18,124 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:55:18,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:55:18,125 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:55:18,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:55:18,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:55:18,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:55:18,125 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:55:18,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:55:18,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:55:18,126 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:55:18,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:55:18,126 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:55:18,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:55:18,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:55:18,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:55:18,127 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:55:18,127 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:55:18,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:55:18,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 04:55:18,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:55:18,128 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:55:18,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:55:18,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:55:18,128 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:55:18,129 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:55:18,129 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:55:18,129 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:55:18,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 04:55:18,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:55:18,130 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:55:18,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:55:18,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:55:18,130 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:55:18,130 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:55:18,130 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:55:18,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:55:18,131 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:55:18,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:55:18,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:55:18,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:55:18,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:55:18,133 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:55:18,134 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:55:18,173 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:55:18,195 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 04:55:18,195 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:55:18,195 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:55:18,201 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 04:55:18,201 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:55:18,201 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_max_~x.base)_4, ULTIMATE.start_max_~i~0, ULTIMATE.start_max_~x.offset) = 1*v_rep(select #length ULTIMATE.start_max_~x.base)_4 - 4*ULTIMATE.start_max_~i~0 - 1*ULTIMATE.start_max_~x.offset Supporting invariants [] [2019-01-14 04:55:18,308 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-01-14 04:55:18,310 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 04:55:18,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:55:18,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:55:18,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:55:18,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:55:18,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:55:18,377 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 04:55:18,378 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 04:55:18,378 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 71 transitions. cyclomatic complexity: 20 Second operand 3 states. [2019-01-14 04:55:18,389 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 57 states and 71 transitions. cyclomatic complexity: 20. Second operand 3 states. Result 61 states and 77 transitions. Complement of second has 4 states. [2019-01-14 04:55:18,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 04:55:18,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:55:18,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2019-01-14 04:55:18,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 29 letters. Loop has 4 letters. [2019-01-14 04:55:18,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:55:18,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 33 letters. Loop has 4 letters. [2019-01-14 04:55:18,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:55:18,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 29 letters. Loop has 8 letters. [2019-01-14 04:55:18,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:55:18,393 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 77 transitions. [2019-01-14 04:55:18,397 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:55:18,397 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 0 states and 0 transitions. [2019-01-14 04:55:18,397 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:55:18,398 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:55:18,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:55:18,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:55:18,398 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:55:18,398 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:55:18,398 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:55:18,398 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2019-01-14 04:55:18,398 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 04:55:18,398 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:55:18,398 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 04:55:18,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:55:18 BoogieIcfgContainer [2019-01-14 04:55:18,409 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:55:18,410 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:55:18,410 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:55:18,410 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:55:18,411 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:54:53" (3/4) ... [2019-01-14 04:55:18,418 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 04:55:18,418 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:55:18,419 INFO L168 Benchmark]: Toolchain (without parser) took 25833.32 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 370.1 MB). Free memory was 951.4 MB in the beginning and 1.2 GB in the end (delta: -257.5 MB). Peak memory consumption was 112.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:55:18,420 INFO L168 Benchmark]: CDTParser took 0.45 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 04:55:18,420 INFO L168 Benchmark]: CACSL2BoogieTranslator took 349.34 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:55:18,422 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.24 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-14 04:55:18,422 INFO L168 Benchmark]: Boogie Preprocessor took 99.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -195.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:55:18,424 INFO L168 Benchmark]: RCFGBuilder took 733.44 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: 20.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-01-14 04:55:18,424 INFO L168 Benchmark]: BuchiAutomizer took 24587.48 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 227.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -98.4 MB). Peak memory consumption was 129.1 MB. Max. memory is 11.5 GB. [2019-01-14 04:55:18,425 INFO L168 Benchmark]: Witness Printer took 8.18 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:55:18,432 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.45 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 349.34 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.24 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 99.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -195.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 733.44 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: 20.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 24587.48 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 227.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -98.4 MB). Peak memory consumption was 129.1 MB. Max. memory is 11.5 GB. * Witness Printer took 8.18 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 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 #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (7 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -4 * i + unknown-#length-unknown[x] + -1 * x and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[x] + -4 * i + -1 * x and consists of 4 locations. One deterministic module has affine ranking function -1 * i + N and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[x] + -4 * i + -1 * x and consists of 3 locations. 7 modules have a trivial ranking function, the largest among these consists of 19 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 24.5s and 12 iterations. TraceHistogramMax:2. Analysis of lassos took 18.8s. Construction of modules took 2.4s. Büchi inclusion checks took 3.0s. Highest rank in rank-based complementation 3. Minimization of det autom 11. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 128 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 57 states and ocurred in iteration 9. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 231 SDtfs, 435 SDslu, 284 SDs, 0 SdLazy, 1740 SolverSat, 110 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU6 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital374 mio100 ax100 hnf99 lsp89 ukn68 mio100 lsp48 div122 bol100 ite100 ukn100 eq160 hnf80 smp79 dnf263 smp59 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 4 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...