./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/reducercommutativity/max05_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/max05_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 d02fdead04c3e6f93d11e2edd6641f56f1584022 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:28,712 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:54:28,714 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:54:28,732 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:54:28,732 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:54:28,734 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:54:28,736 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:54:28,740 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:54:28,743 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:54:28,744 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:54:28,747 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:54:28,748 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:54:28,749 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:54:28,750 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:54:28,759 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:54:28,760 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:54:28,761 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:54:28,762 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:54:28,767 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:54:28,771 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:54:28,773 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:54:28,774 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:54:28,779 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:54:28,779 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:54:28,780 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:54:28,782 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:54:28,783 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:54:28,784 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:54:28,784 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:54:28,788 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:54:28,790 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:54:28,791 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:54:28,791 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:54:28,791 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:54:28,792 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:54:28,793 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:54:28,794 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:28,819 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:54:28,820 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:54:28,821 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:54:28,821 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:54:28,821 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:54:28,822 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:54:28,823 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:54:28,823 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:54:28,823 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:54:28,823 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:54:28,823 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:54:28,823 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:54:28,824 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:54:28,824 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:54:28,824 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:54:28,824 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:54:28,824 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:54:28,824 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:54:28,824 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:54:28,828 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:54:28,828 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:54:28,828 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:54:28,828 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:54:28,829 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:54:28,829 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:54:28,829 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:54:28,829 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:54:28,829 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:54:28,830 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:54:28,830 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:54:28,830 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:54:28,832 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:54:28,835 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 -> d02fdead04c3e6f93d11e2edd6641f56f1584022 [2019-01-14 04:54:28,881 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:54:28,899 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:54:28,906 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:54:28,907 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:54:28,908 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:54:28,908 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/reducercommutativity/max05_true-unreach-call_true-termination.i [2019-01-14 04:54:28,970 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dded6cab/ee7f451ad06542d9b62616b434783adc/FLAG9845abd68 [2019-01-14 04:54:29,447 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:54:29,448 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/reducercommutativity/max05_true-unreach-call_true-termination.i [2019-01-14 04:54:29,455 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dded6cab/ee7f451ad06542d9b62616b434783adc/FLAG9845abd68 [2019-01-14 04:54:29,787 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dded6cab/ee7f451ad06542d9b62616b434783adc [2019-01-14 04:54:29,791 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:54:29,793 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:54:29,794 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:54:29,794 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:54:29,797 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:54:29,799 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:54:29" (1/1) ... [2019-01-14 04:54:29,803 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@236b7017 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:54:29, skipping insertion in model container [2019-01-14 04:54:29,803 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:54:29" (1/1) ... [2019-01-14 04:54:29,812 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:54:29,828 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:54:30,070 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:54:30,089 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:54:30,132 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:54:30,152 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:54:30,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:54:30 WrapperNode [2019-01-14 04:54:30,153 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:54:30,154 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:54:30,154 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:54:30,154 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:54:30,163 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:30" (1/1) ... [2019-01-14 04:54:30,172 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:30" (1/1) ... [2019-01-14 04:54:30,201 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:54:30,201 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:54:30,201 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:54:30,201 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:54:30,211 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:30" (1/1) ... [2019-01-14 04:54:30,211 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:30" (1/1) ... [2019-01-14 04:54:30,214 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:30" (1/1) ... [2019-01-14 04:54:30,214 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:30" (1/1) ... [2019-01-14 04:54:30,231 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:30" (1/1) ... [2019-01-14 04:54:30,311 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:30" (1/1) ... [2019-01-14 04:54:30,314 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:30" (1/1) ... [2019-01-14 04:54:30,319 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:54:30,324 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:54:30,324 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:54:30,325 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:54:30,326 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:54:30" (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:30,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 04:54:30,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:54:30,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:54:30,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 04:54:30,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 04:54:30,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 04:54:30,920 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:54:30,921 INFO L286 CfgBuilder]: Removed 15 assue(true) statements. [2019-01-14 04:54:30,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:54:30 BoogieIcfgContainer [2019-01-14 04:54:30,922 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:54:30,922 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:54:30,923 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:54:30,926 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:54:30,927 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:54:30,928 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:54:29" (1/3) ... [2019-01-14 04:54:30,929 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@747cfa21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:54:30, skipping insertion in model container [2019-01-14 04:54:30,929 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:54:30,929 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:54:30" (2/3) ... [2019-01-14 04:54:30,929 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@747cfa21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:54:30, skipping insertion in model container [2019-01-14 04:54:30,930 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:54:30,930 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:54:30" (3/3) ... [2019-01-14 04:54:30,932 INFO L375 chiAutomizerObserver]: Analyzing ICFG max05_true-unreach-call_true-termination.i [2019-01-14 04:54:30,986 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:54:30,986 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:54:30,987 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:54:30,987 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:54:30,987 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:54:30,987 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:54:30,987 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:54:30,988 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:54:30,988 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:54:31,003 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2019-01-14 04:54:31,025 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 16 [2019-01-14 04:54:31,025 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:54:31,025 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:54:31,031 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 04:54:31,031 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 04:54:31,031 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:54:31,032 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2019-01-14 04:54:31,034 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 16 [2019-01-14 04:54:31,035 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:54:31,035 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:54:31,035 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 04:54:31,035 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 04:54:31,043 INFO L794 eck$LassoCheckResult]: Stem: 31#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 30#L23-3true [2019-01-14 04:54:31,043 INFO L796 eck$LassoCheckResult]: Loop: 30#L23-3true assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 10#L23-2true main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 30#L23-3true [2019-01-14 04:54:31,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:31,049 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-01-14 04:54:31,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:31,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:31,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:31,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:54:31,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:31,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:31,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:31,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:31,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2019-01-14 04:54:31,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:31,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:31,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:31,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:54:31,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:31,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:31,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:31,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:31,193 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-01-14 04:54:31,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:31,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:31,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:31,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:54:31,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:31,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:31,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:31,607 WARN L181 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-01-14 04:54:31,687 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:54:31,688 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:54:31,689 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:54:31,689 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:54:31,689 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:54:31,689 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:54:31,689 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:54:31,689 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:54:31,690 INFO L131 ssoRankerPreferences]: Filename of dumped script: max05_true-unreach-call_true-termination.i_Iteration1_Lasso [2019-01-14 04:54:31,690 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:54:31,690 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:54:31,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:31,720 INFO L141 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:31,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:54:31,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:54:31,803 INFO L141 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:31,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:54:31,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:54:31,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:54:31,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:54:31,832 INFO L141 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:31,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:54:31,838 INFO L141 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:31,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:54:31,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:54:31,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:31,853 INFO L141 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:31,859 INFO L141 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:31,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:32,368 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-14 04:54:32,519 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-14 04:54:32,598 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:54:32,604 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:54:32,607 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:32,608 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:32,609 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:32,609 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:32,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:32,610 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:32,612 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:32,612 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:32,616 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:32,617 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:32,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:32,618 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:32,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:32,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:32,618 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:32,619 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:32,619 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:32,621 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:32,621 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:32,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:32,622 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 04:54:32,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:32,623 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:32,626 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 04:54:32,627 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:54:32,655 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:32,655 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:32,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:32,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:32,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:32,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:32,661 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:54:32,662 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:54:32,674 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:32,675 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:32,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:32,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:32,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:32,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:32,682 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:54:32,684 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:54:32,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:32,711 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:32,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:32,712 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:32,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:32,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:32,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:32,713 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:32,713 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:32,715 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:32,715 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:32,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:32,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:32,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:32,717 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:32,725 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:54:32,725 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:54:32,787 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:54:32,815 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 04:54:32,815 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-14 04:54:32,818 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:54:32,824 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 04:54:32,827 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:54:32,828 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1) = -8*ULTIMATE.start_main_~i~1 + 9*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1 Supporting invariants [] [2019-01-14 04:54:32,833 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-01-14 04:54:32,842 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 04:54:32,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:32,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:54:32,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:54:32,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:54:32,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:54:32,970 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:32,984 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:32,985 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states. Second operand 3 states. [2019-01-14 04:54:33,231 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states.. Second operand 3 states. Result 84 states and 119 transitions. Complement of second has 8 states. [2019-01-14 04:54:33,233 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:33,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:54:33,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2019-01-14 04:54:33,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 2 letters. Loop has 2 letters. [2019-01-14 04:54:33,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:54:33,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-14 04:54:33,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:54:33,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 2 letters. Loop has 4 letters. [2019-01-14 04:54:33,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:54:33,241 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 119 transitions. [2019-01-14 04:54:33,248 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-01-14 04:54:33,253 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 25 states and 33 transitions. [2019-01-14 04:54:33,255 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-01-14 04:54:33,255 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-01-14 04:54:33,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 33 transitions. [2019-01-14 04:54:33,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:54:33,257 INFO L706 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-01-14 04:54:33,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 33 transitions. [2019-01-14 04:54:33,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-01-14 04:54:33,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-14 04:54:33,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2019-01-14 04:54:33,290 INFO L729 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-01-14 04:54:33,291 INFO L609 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-01-14 04:54:33,291 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:54:33,291 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2019-01-14 04:54:33,292 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-01-14 04:54:33,292 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:54:33,293 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:54:33,293 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 04:54:33,293 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:54:33,294 INFO L794 eck$LassoCheckResult]: Stem: 181#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 178#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 175#L23-3 assume !(main_~i~1 < 5); 174#L23-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; 163#L9-3 [2019-01-14 04:54:33,294 INFO L796 eck$LassoCheckResult]: Loop: 163#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 164#L10 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; 173#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 168#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 163#L9-3 [2019-01-14 04:54:33,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:33,294 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2019-01-14 04:54:33,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:33,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:33,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:33,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:54:33,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:33,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:54:33,339 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:33,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:54:33,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:54:33,343 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:54:33,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:33,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 1 times [2019-01-14 04:54:33,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:33,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:33,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:33,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:54:33,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:33,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:33,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:33,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:54:33,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:54:33,476 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-01-14 04:54:33,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:54:33,492 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2019-01-14 04:54:33,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:54:33,496 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 33 transitions. [2019-01-14 04:54:33,497 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-01-14 04:54:33,499 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 33 transitions. [2019-01-14 04:54:33,499 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-01-14 04:54:33,500 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-01-14 04:54:33,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 33 transitions. [2019-01-14 04:54:33,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:54:33,500 INFO L706 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-01-14 04:54:33,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 33 transitions. [2019-01-14 04:54:33,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-01-14 04:54:33,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-14 04:54:33,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2019-01-14 04:54:33,505 INFO L729 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2019-01-14 04:54:33,505 INFO L609 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2019-01-14 04:54:33,505 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:54:33,506 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 32 transitions. [2019-01-14 04:54:33,508 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-01-14 04:54:33,508 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:54:33,508 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:54:33,508 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:54:33,509 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:54:33,509 INFO L794 eck$LassoCheckResult]: Stem: 238#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 235#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 232#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 233#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 234#L23-3 assume !(main_~i~1 < 5); 231#L23-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; 220#L9-3 [2019-01-14 04:54:33,509 INFO L796 eck$LassoCheckResult]: Loop: 220#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 221#L10 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; 230#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 225#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 220#L9-3 [2019-01-14 04:54:33,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:33,510 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2019-01-14 04:54:33,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:33,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:33,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:33,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:54:33,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:33,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:54:33,590 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:33,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:54:33,590 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:33,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:54:33,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:54:33,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:54:33,640 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:33,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:54:33,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-01-14 04:54:33,663 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:54:33,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:33,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 2 times [2019-01-14 04:54:33,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:33,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:33,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:33,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:54:33,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:33,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:33,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:33,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:54:33,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:54:33,774 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. cyclomatic complexity: 12 Second operand 5 states. [2019-01-14 04:54:33,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:54:33,807 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2019-01-14 04:54:33,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 04:54:33,809 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 35 transitions. [2019-01-14 04:54:33,810 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-01-14 04:54:33,811 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 35 transitions. [2019-01-14 04:54:33,812 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-01-14 04:54:33,812 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-01-14 04:54:33,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 35 transitions. [2019-01-14 04:54:33,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:54:33,813 INFO L706 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-01-14 04:54:33,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 35 transitions. [2019-01-14 04:54:33,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-01-14 04:54:33,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-14 04:54:33,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2019-01-14 04:54:33,816 INFO L729 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-01-14 04:54:33,817 INFO L609 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-01-14 04:54:33,817 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 04:54:33,817 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 34 transitions. [2019-01-14 04:54:33,818 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-01-14 04:54:33,818 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:54:33,818 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:54:33,818 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2019-01-14 04:54:33,819 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:54:33,819 INFO L794 eck$LassoCheckResult]: Stem: 313#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 312#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 308#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 309#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 310#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 311#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 318#L23-3 assume !(main_~i~1 < 5); 307#L23-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; 296#L9-3 [2019-01-14 04:54:33,819 INFO L796 eck$LassoCheckResult]: Loop: 296#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 297#L10 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; 306#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 301#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 296#L9-3 [2019-01-14 04:54:33,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:33,820 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2019-01-14 04:54:33,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:33,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:33,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:33,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:54:33,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:33,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:54:33,910 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:54:33,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:54:33,911 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:33,922 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 04:54:33,944 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 04:54:33,944 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 04:54:33,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:54:34,002 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:54:34,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:54:34,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-01-14 04:54:34,036 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:54:34,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:34,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 3 times [2019-01-14 04:54:34,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:34,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:34,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:34,039 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:54:34,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:34,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:34,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:34,215 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-01-14 04:54:34,320 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-14 04:54:34,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 04:54:34,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 04:54:34,322 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. cyclomatic complexity: 12 Second operand 6 states. [2019-01-14 04:54:34,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:54:34,350 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2019-01-14 04:54:34,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 04:54:34,352 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 37 transitions. [2019-01-14 04:54:34,353 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-01-14 04:54:34,354 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 37 transitions. [2019-01-14 04:54:34,354 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-01-14 04:54:34,355 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-01-14 04:54:34,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 37 transitions. [2019-01-14 04:54:34,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:54:34,355 INFO L706 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-01-14 04:54:34,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 37 transitions. [2019-01-14 04:54:34,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-01-14 04:54:34,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-14 04:54:34,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2019-01-14 04:54:34,361 INFO L729 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2019-01-14 04:54:34,361 INFO L609 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2019-01-14 04:54:34,361 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 04:54:34,361 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 36 transitions. [2019-01-14 04:54:34,362 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-01-14 04:54:34,362 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:54:34,362 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:54:34,363 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2019-01-14 04:54:34,370 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:54:34,370 INFO L794 eck$LassoCheckResult]: Stem: 401#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 399#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 395#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 396#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 397#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 398#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 400#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 407#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 406#L23-3 assume !(main_~i~1 < 5); 394#L23-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; 383#L9-3 [2019-01-14 04:54:34,370 INFO L796 eck$LassoCheckResult]: Loop: 383#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 384#L10 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; 393#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 388#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 383#L9-3 [2019-01-14 04:54:34,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:34,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2019-01-14 04:54:34,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:34,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:34,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:34,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:54:34,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:34,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:54:34,493 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:54:34,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:54:34,493 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:54:34,504 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 04:54:34,529 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-14 04:54:34,529 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 04:54:34,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:54:34,585 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:54:34,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:54:34,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-01-14 04:54:34,606 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:54:34,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:34,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 4 times [2019-01-14 04:54:34,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:34,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:34,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:34,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:54:34,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:34,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:34,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:34,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 04:54:34,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 04:54:34,714 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-01-14 04:54:34,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:54:34,748 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2019-01-14 04:54:34,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 04:54:34,749 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 39 transitions. [2019-01-14 04:54:34,751 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-01-14 04:54:34,752 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 39 transitions. [2019-01-14 04:54:34,752 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-01-14 04:54:34,752 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-01-14 04:54:34,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 39 transitions. [2019-01-14 04:54:34,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:54:34,753 INFO L706 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2019-01-14 04:54:34,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 39 transitions. [2019-01-14 04:54:34,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-01-14 04:54:34,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-14 04:54:34,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2019-01-14 04:54:34,757 INFO L729 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-01-14 04:54:34,757 INFO L609 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-01-14 04:54:34,758 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 04:54:34,758 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 38 transitions. [2019-01-14 04:54:34,758 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-01-14 04:54:34,759 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:54:34,759 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:54:34,760 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2019-01-14 04:54:34,760 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:54:34,760 INFO L794 eck$LassoCheckResult]: Stem: 501#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 497#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 493#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 494#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 495#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 496#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 498#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 507#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 506#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 505#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 504#L23-3 assume !(main_~i~1 < 5); 492#L23-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; 481#L9-3 [2019-01-14 04:54:34,760 INFO L796 eck$LassoCheckResult]: Loop: 481#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 482#L10 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; 491#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 486#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 481#L9-3 [2019-01-14 04:54:34,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:34,760 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2019-01-14 04:54:34,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:34,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:34,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:34,764 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:54:34,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:34,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:54:34,847 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:54:34,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:54:34,847 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:54:34,857 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 04:54:34,884 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 04:54:34,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 04:54:34,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:54:34,897 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:54:34,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:54:34,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-01-14 04:54:34,919 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:54:34,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:34,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 5 times [2019-01-14 04:54:34,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:34,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:34,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:34,921 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:54:34,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:34,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:34,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:35,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 04:54:35,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-14 04:54:35,007 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. cyclomatic complexity: 12 Second operand 8 states. [2019-01-14 04:54:35,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:54:35,048 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2019-01-14 04:54:35,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 04:54:35,052 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 40 transitions. [2019-01-14 04:54:35,053 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-01-14 04:54:35,054 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 40 transitions. [2019-01-14 04:54:35,054 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-01-14 04:54:35,054 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-01-14 04:54:35,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 40 transitions. [2019-01-14 04:54:35,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:54:35,055 INFO L706 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2019-01-14 04:54:35,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 40 transitions. [2019-01-14 04:54:35,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-01-14 04:54:35,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-14 04:54:35,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2019-01-14 04:54:35,058 INFO L729 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2019-01-14 04:54:35,058 INFO L609 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2019-01-14 04:54:35,058 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 04:54:35,058 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 40 transitions. [2019-01-14 04:54:35,059 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-01-14 04:54:35,059 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:54:35,059 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:54:35,061 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2019-01-14 04:54:35,061 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:54:35,062 INFO L794 eck$LassoCheckResult]: Stem: 606#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 605#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 601#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 602#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 603#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 604#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 617#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 616#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 615#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 614#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 613#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 612#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 611#L23-3 assume !(main_~i~1 < 5); 600#L23-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; 589#L9-3 [2019-01-14 04:54:35,062 INFO L796 eck$LassoCheckResult]: Loop: 589#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 590#L10 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; 599#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 594#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 589#L9-3 [2019-01-14 04:54:35,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:35,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2019-01-14 04:54:35,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:35,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:35,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:35,063 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:54:35,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:35,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:35,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:35,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:35,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 6 times [2019-01-14 04:54:35,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:35,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:35,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:35,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:54:35,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:35,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:35,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:35,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:35,129 INFO L82 PathProgramCache]: Analyzing trace with hash -743539014, now seen corresponding path program 1 times [2019-01-14 04:54:35,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:35,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:35,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:35,131 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:54:35,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:35,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:35,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:35,433 WARN L181 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-01-14 04:54:35,608 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-14 04:54:36,147 WARN L181 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 102 [2019-01-14 04:54:36,250 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:54:36,250 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:54:36,250 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:54:36,251 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:54:36,251 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:54:36,251 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:54:36,251 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:54:36,252 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:54:36,252 INFO L131 ssoRankerPreferences]: Filename of dumped script: max05_true-unreach-call_true-termination.i_Iteration7_Lasso [2019-01-14 04:54:36,252 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:54:36,252 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:54:36,257 INFO L141 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:36,299 INFO L141 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:36,304 INFO L141 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:36,306 INFO L141 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:36,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:36,316 INFO L141 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:36,319 INFO L141 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:36,322 INFO L141 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:36,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:54:36,327 INFO L141 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:36,330 INFO L141 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:36,334 INFO L141 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:36,337 INFO L141 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:36,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:36,343 INFO L141 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:36,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:36,350 INFO L141 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:36,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:36,402 INFO L141 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:36,534 INFO L141 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:36,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:36,539 INFO L141 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:36,541 INFO L141 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:36,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:36,980 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:54:36,981 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:54:36,981 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:36,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:36,982 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:36,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:36,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:36,982 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:36,985 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:36,986 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:36,986 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:36,987 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:36,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:36,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:36,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:36,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:36,989 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:36,989 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:36,990 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:36,990 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:36,990 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:36,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:36,994 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:36,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:36,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:36,994 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:36,996 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:36,997 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:36,998 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:36,999 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:36,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:37,000 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:37,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:37,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:37,000 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:37,000 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:37,000 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:37,005 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:37,006 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:37,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:37,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:37,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:37,007 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:37,012 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:54:37,012 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:54:37,018 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:37,020 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:54:37,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:37,021 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:37,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:37,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:37,025 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:37,025 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:37,026 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:37,026 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:37,027 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:37,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:37,027 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:37,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:37,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:37,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:37,035 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:37,035 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:37,036 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:37,036 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:54:37,039 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:37,040 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:37,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:37,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:37,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:37,041 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:37,042 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:37,043 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:37,043 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:54:37,046 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:37,046 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:37,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:37,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:37,047 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:37,049 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:37,049 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:37,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:37,050 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:54:37,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:37,050 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:37,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:37,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:37,055 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:37,055 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:37,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:37,057 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:37,058 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:54:37,060 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:37,061 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:37,061 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:37,062 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:37,063 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:54:37,064 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:54:37,067 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:37,068 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:37,068 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:37,068 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:37,069 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:37,069 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:37,069 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:37,069 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:37,069 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:37,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:37,077 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:37,077 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:37,078 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:37,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:37,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:37,078 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:37,078 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:37,078 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:37,083 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:37,084 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:54:37,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:37,085 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:37,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:37,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:37,085 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:37,086 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:37,088 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:37,089 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:37,091 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:54:37,091 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:37,091 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:37,091 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:37,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:37,092 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:37,092 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:37,092 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:37,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:37,103 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:54:37,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:37,104 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:37,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:37,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:37,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:37,104 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:37,104 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:37,110 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:37,110 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:37,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:37,111 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:37,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:37,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:37,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:37,111 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:37,111 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:37,114 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:37,115 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:54:37,115 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:37,115 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:37,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:37,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:37,116 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:37,116 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:37,116 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:37,117 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:37,117 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:54:37,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:37,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:37,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:37,118 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:37,128 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:54:37,128 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:54:37,143 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:37,143 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:37,143 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:37,144 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 04:54:37,144 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:37,144 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:37,150 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 04:54:37,151 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:54:37,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:37,170 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:54:37,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:37,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:37,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:37,171 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:37,177 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:54:37,177 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:54:37,208 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:54:37,224 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 04:54:37,224 INFO L444 ModelExtractionUtils]: 18 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:54:37,224 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:54:37,227 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 04:54:37,228 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:54:37,229 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_max_~i~0) = -2*ULTIMATE.start_max_~i~0 + 9 Supporting invariants [] [2019-01-14 04:54:37,302 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-14 04:54:37,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:37,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:54:37,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:54:37,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:54:37,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:54:37,417 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:37,418 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:37,418 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 40 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-01-14 04:54:37,447 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 40 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 39 states and 50 transitions. Complement of second has 7 states. [2019-01-14 04:54:37,448 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:54:37,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:54:37,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-01-14 04:54:37,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 14 letters. Loop has 4 letters. [2019-01-14 04:54:37,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:54:37,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 18 letters. Loop has 4 letters. [2019-01-14 04:54:37,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:54:37,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 14 letters. Loop has 8 letters. [2019-01-14 04:54:37,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:54:37,452 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 50 transitions. [2019-01-14 04:54:37,453 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-01-14 04:54:37,454 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 34 states and 42 transitions. [2019-01-14 04:54:37,454 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-01-14 04:54:37,454 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-01-14 04:54:37,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 42 transitions. [2019-01-14 04:54:37,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:54:37,454 INFO L706 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2019-01-14 04:54:37,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 42 transitions. [2019-01-14 04:54:37,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-01-14 04:54:37,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-14 04:54:37,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2019-01-14 04:54:37,459 INFO L729 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2019-01-14 04:54:37,460 INFO L609 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2019-01-14 04:54:37,460 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-14 04:54:37,460 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 42 transitions. [2019-01-14 04:54:37,460 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-01-14 04:54:37,460 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:54:37,461 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:54:37,463 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:54:37,464 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:54:37,464 INFO L794 eck$LassoCheckResult]: Stem: 771#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 768#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 764#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 765#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 766#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 767#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 780#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 779#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 778#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 777#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 776#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 775#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 774#L23-3 assume !(main_~i~1 < 5); 763#L23-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; 751#L9-3 assume !(max_~i~0 < 5); 747#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 748#L12 main_#t~ret6 := max_#res;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;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; 772#L9-8 [2019-01-14 04:54:37,465 INFO L796 eck$LassoCheckResult]: Loop: 772#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 758#L10-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; 749#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 750#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 772#L9-8 [2019-01-14 04:54:37,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:37,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1638581251, now seen corresponding path program 1 times [2019-01-14 04:54:37,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:37,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:37,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:37,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:54:37,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:37,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:54:37,541 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-01-14 04:54:37,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:54:37,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:54:37,542 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:54:37,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:37,542 INFO L82 PathProgramCache]: Analyzing trace with hash 2373478, now seen corresponding path program 1 times [2019-01-14 04:54:37,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:37,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:37,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:37,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:54:37,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:37,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:37,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:37,710 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-01-14 04:54:37,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:54:37,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:54:37,746 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-01-14 04:54:37,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:54:37,786 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2019-01-14 04:54:37,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:54:37,790 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 55 transitions. [2019-01-14 04:54:37,792 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-01-14 04:54:37,793 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 55 transitions. [2019-01-14 04:54:37,793 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-01-14 04:54:37,793 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-01-14 04:54:37,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 55 transitions. [2019-01-14 04:54:37,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:54:37,795 INFO L706 BuchiCegarLoop]: Abstraction has 45 states and 55 transitions. [2019-01-14 04:54:37,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 55 transitions. [2019-01-14 04:54:37,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 35. [2019-01-14 04:54:37,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-14 04:54:37,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2019-01-14 04:54:37,799 INFO L729 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2019-01-14 04:54:37,800 INFO L609 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2019-01-14 04:54:37,800 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-14 04:54:37,800 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 42 transitions. [2019-01-14 04:54:37,802 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-01-14 04:54:37,802 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:54:37,802 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:54:37,803 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:54:37,803 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:54:37,803 INFO L794 eck$LassoCheckResult]: Stem: 854#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 853#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 849#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 850#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 851#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 852#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 866#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 865#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 864#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 863#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 862#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 861#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 860#L23-3 assume !(main_~i~1 < 5); 848#L23-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; 836#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 837#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 847#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 842#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 838#L9-3 assume !(max_~i~0 < 5); 832#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 833#L12 main_#t~ret6 := max_#res;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;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; 857#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 843#L10-3 [2019-01-14 04:54:37,803 INFO L796 eck$LassoCheckResult]: Loop: 843#L10-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; 834#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 835#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 858#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 843#L10-3 [2019-01-14 04:54:37,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:37,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1336698829, now seen corresponding path program 1 times [2019-01-14 04:54:37,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:37,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:37,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:37,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:54:37,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:37,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:54:37,963 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-01-14 04:54:37,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:54:37,964 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 04:54:37,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:54:38,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:54:38,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:54:38,024 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-01-14 04:54:38,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:54:38,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-01-14 04:54:38,044 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:54:38,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:38,044 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 2 times [2019-01-14 04:54:38,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:38,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:38,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:38,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:54:38,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:38,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:38,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:38,612 WARN L181 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-01-14 04:54:38,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:54:38,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:54:38,695 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. cyclomatic complexity: 12 Second operand 5 states. [2019-01-14 04:54:38,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:54:38,761 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2019-01-14 04:54:38,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 04:54:38,762 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 70 transitions. [2019-01-14 04:54:38,763 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-01-14 04:54:38,765 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 57 states and 70 transitions. [2019-01-14 04:54:38,765 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2019-01-14 04:54:38,765 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2019-01-14 04:54:38,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 70 transitions. [2019-01-14 04:54:38,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:54:38,768 INFO L706 BuchiCegarLoop]: Abstraction has 57 states and 70 transitions. [2019-01-14 04:54:38,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 70 transitions. [2019-01-14 04:54:38,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 43. [2019-01-14 04:54:38,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-14 04:54:38,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2019-01-14 04:54:38,771 INFO L729 BuchiCegarLoop]: Abstraction has 43 states and 52 transitions. [2019-01-14 04:54:38,772 INFO L609 BuchiCegarLoop]: Abstraction has 43 states and 52 transitions. [2019-01-14 04:54:38,772 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-14 04:54:38,772 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 52 transitions. [2019-01-14 04:54:38,772 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-01-14 04:54:38,772 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:54:38,772 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:54:38,776 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:54:38,776 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:54:38,776 INFO L794 eck$LassoCheckResult]: Stem: 1020#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1018#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1014#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1015#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1016#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1017#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1019#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1035#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1034#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1033#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1031#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1030#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1029#L23-3 assume !(main_~i~1 < 5); 1013#L23-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; 999#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1000#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1032#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1006#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1001#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1002#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1011#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1012#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1027#L9-3 assume !(max_~i~0 < 5); 995#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 996#L12 main_#t~ret6 := max_#res;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;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; 1024#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1037#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1036#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1025#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1023#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1007#L10-3 [2019-01-14 04:54:38,776 INFO L796 eck$LassoCheckResult]: Loop: 1007#L10-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; 997#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 998#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1028#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1007#L10-3 [2019-01-14 04:54:38,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:38,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1525547091, now seen corresponding path program 1 times [2019-01-14 04:54:38,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:38,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:38,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:38,778 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:54:38,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:38,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:54:38,962 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-14 04:54:38,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:54:38,963 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 04:54:38,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:54:39,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:54:39,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:54:39,039 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-14 04:54:39,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:54:39,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-01-14 04:54:39,060 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:54:39,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:39,061 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 3 times [2019-01-14 04:54:39,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:39,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:39,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:39,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:54:39,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:39,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:39,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:39,402 WARN L181 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-01-14 04:54:39,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 04:54:39,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 04:54:39,428 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. cyclomatic complexity: 14 Second operand 6 states. [2019-01-14 04:54:39,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:54:39,521 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2019-01-14 04:54:39,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 04:54:39,522 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 85 transitions. [2019-01-14 04:54:39,524 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-01-14 04:54:39,525 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 69 states and 85 transitions. [2019-01-14 04:54:39,525 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2019-01-14 04:54:39,525 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2019-01-14 04:54:39,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 85 transitions. [2019-01-14 04:54:39,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:54:39,526 INFO L706 BuchiCegarLoop]: Abstraction has 69 states and 85 transitions. [2019-01-14 04:54:39,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 85 transitions. [2019-01-14 04:54:39,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 51. [2019-01-14 04:54:39,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-14 04:54:39,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2019-01-14 04:54:39,533 INFO L729 BuchiCegarLoop]: Abstraction has 51 states and 62 transitions. [2019-01-14 04:54:39,533 INFO L609 BuchiCegarLoop]: Abstraction has 51 states and 62 transitions. [2019-01-14 04:54:39,533 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-14 04:54:39,533 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 62 transitions. [2019-01-14 04:54:39,533 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-01-14 04:54:39,534 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:54:39,536 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:54:39,538 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:54:39,538 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:54:39,538 INFO L794 eck$LassoCheckResult]: Stem: 1230#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1227#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1223#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1224#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1225#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1226#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1248#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1247#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1246#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1245#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1244#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1243#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1242#L23-3 assume !(main_~i~1 < 5); 1222#L23-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; 1207#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1208#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1220#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1221#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1209#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1210#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1253#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1214#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1215#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1237#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1252#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1238#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1236#L9-3 assume !(max_~i~0 < 5); 1203#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1204#L12 main_#t~ret6 := max_#res;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;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; 1231#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1232#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1251#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1233#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1234#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1216#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1205#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1206#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1250#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1240#L10-3 [2019-01-14 04:54:39,538 INFO L796 eck$LassoCheckResult]: Loop: 1240#L10-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; 1249#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1241#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1239#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1240#L10-3 [2019-01-14 04:54:39,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:39,539 INFO L82 PathProgramCache]: Analyzing trace with hash 452444531, now seen corresponding path program 2 times [2019-01-14 04:54:39,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:39,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:39,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:39,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:54:39,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:39,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:54:39,635 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-01-14 04:54:39,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:54:39,636 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 04:54:39,648 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 04:54:39,687 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 04:54:39,687 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 04:54:39,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:54:39,706 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-01-14 04:54:39,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:54:39,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-01-14 04:54:39,727 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:54:39,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:39,727 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 4 times [2019-01-14 04:54:39,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:39,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:39,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:39,728 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:54:39,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:39,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:39,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:40,029 WARN L181 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-01-14 04:54:40,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 04:54:40,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 04:54:40,051 INFO L87 Difference]: Start difference. First operand 51 states and 62 transitions. cyclomatic complexity: 16 Second operand 7 states. [2019-01-14 04:54:40,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:54:40,375 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2019-01-14 04:54:40,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 04:54:40,376 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 100 transitions. [2019-01-14 04:54:40,378 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-01-14 04:54:40,379 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 81 states and 100 transitions. [2019-01-14 04:54:40,380 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2019-01-14 04:54:40,381 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2019-01-14 04:54:40,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 81 states and 100 transitions. [2019-01-14 04:54:40,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:54:40,382 INFO L706 BuchiCegarLoop]: Abstraction has 81 states and 100 transitions. [2019-01-14 04:54:40,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states and 100 transitions. [2019-01-14 04:54:40,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 59. [2019-01-14 04:54:40,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-14 04:54:40,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2019-01-14 04:54:40,388 INFO L729 BuchiCegarLoop]: Abstraction has 59 states and 72 transitions. [2019-01-14 04:54:40,388 INFO L609 BuchiCegarLoop]: Abstraction has 59 states and 72 transitions. [2019-01-14 04:54:40,388 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2019-01-14 04:54:40,389 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 72 transitions. [2019-01-14 04:54:40,391 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-01-14 04:54:40,392 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:54:40,392 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:54:40,393 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:54:40,393 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:54:40,393 INFO L794 eck$LassoCheckResult]: Stem: 1481#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1478#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1474#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1475#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1476#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1477#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1497#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1496#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1495#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1494#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1493#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1492#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1491#L23-3 assume !(main_~i~1 < 5); 1473#L23-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; 1460#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1461#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1472#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1467#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1462#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1463#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1513#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1511#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1509#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1507#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1505#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1503#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1501#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1486#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1499#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1487#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1485#L9-3 assume !(max_~i~0 < 5); 1458#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1459#L12 main_#t~ret6 := max_#res;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;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; 1482#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1468#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1456#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1457#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1483#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1514#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1512#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1510#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1508#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1506#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1504#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1502#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1500#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1489#L10-3 [2019-01-14 04:54:40,393 INFO L796 eck$LassoCheckResult]: Loop: 1489#L10-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; 1498#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1490#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1488#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1489#L10-3 [2019-01-14 04:54:40,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:40,395 INFO L82 PathProgramCache]: Analyzing trace with hash 2023971731, now seen corresponding path program 3 times [2019-01-14 04:54:40,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:40,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:40,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:40,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:54:40,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:40,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:54:40,543 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-01-14 04:54:40,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:54:40,543 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 04:54:40,564 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 04:54:40,662 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-14 04:54:40,663 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 04:54:40,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:54:40,712 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-01-14 04:54:40,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:54:40,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-01-14 04:54:40,734 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:54:40,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:40,734 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 5 times [2019-01-14 04:54:40,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:40,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:40,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:40,736 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:54:40,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:40,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:40,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:40,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 04:54:40,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-14 04:54:40,838 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. cyclomatic complexity: 18 Second operand 8 states. [2019-01-14 04:54:40,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:54:40,997 INFO L93 Difference]: Finished difference Result 84 states and 103 transitions. [2019-01-14 04:54:40,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 04:54:40,998 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 103 transitions. [2019-01-14 04:54:40,999 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-01-14 04:54:41,000 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 84 states and 103 transitions. [2019-01-14 04:54:41,000 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2019-01-14 04:54:41,000 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2019-01-14 04:54:41,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 103 transitions. [2019-01-14 04:54:41,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:54:41,001 INFO L706 BuchiCegarLoop]: Abstraction has 84 states and 103 transitions. [2019-01-14 04:54:41,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 103 transitions. [2019-01-14 04:54:41,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 67. [2019-01-14 04:54:41,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-14 04:54:41,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 82 transitions. [2019-01-14 04:54:41,008 INFO L729 BuchiCegarLoop]: Abstraction has 67 states and 82 transitions. [2019-01-14 04:54:41,011 INFO L609 BuchiCegarLoop]: Abstraction has 67 states and 82 transitions. [2019-01-14 04:54:41,011 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2019-01-14 04:54:41,011 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 82 transitions. [2019-01-14 04:54:41,012 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-01-14 04:54:41,012 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:54:41,012 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:54:41,013 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:54:41,013 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:54:41,014 INFO L794 eck$LassoCheckResult]: Stem: 1771#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1768#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1764#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1765#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1766#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1767#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1793#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1791#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1789#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1787#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1785#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1783#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1782#L23-3 assume !(main_~i~1 < 5); 1763#L23-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; 1749#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1750#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1811#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1810#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1751#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1752#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1762#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1756#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1757#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1809#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1808#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1807#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1806#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1805#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1803#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1801#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1799#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1776#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1796#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1777#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1775#L9-3 assume !(max_~i~0 < 5); 1745#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1746#L12 main_#t~ret6 := max_#res;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;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; 1772#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1758#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1747#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1748#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1773#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1804#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1802#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1800#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1798#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1797#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1795#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1794#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1792#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1790#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1788#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1786#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1784#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1779#L10-3 [2019-01-14 04:54:41,014 INFO L796 eck$LassoCheckResult]: Loop: 1779#L10-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; 1781#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1780#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1778#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1779#L10-3 [2019-01-14 04:54:41,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:41,014 INFO L82 PathProgramCache]: Analyzing trace with hash 669208243, now seen corresponding path program 4 times [2019-01-14 04:54:41,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:41,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:41,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:41,019 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:54:41,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:41,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:41,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:41,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:41,145 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 6 times [2019-01-14 04:54:41,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:41,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:41,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:41,147 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:54:41,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:41,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:41,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:41,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:41,162 INFO L82 PathProgramCache]: Analyzing trace with hash -746698386, now seen corresponding path program 1 times [2019-01-14 04:54:41,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:41,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:41,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:41,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:54:41,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:41,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:54:41,358 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-01-14 04:54:41,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:54:41,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-14 04:54:41,550 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-01-14 04:54:41,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 04:54:41,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-14 04:54:41,552 INFO L87 Difference]: Start difference. First operand 67 states and 82 transitions. cyclomatic complexity: 20 Second operand 10 states. [2019-01-14 04:54:41,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:54:41,813 INFO L93 Difference]: Finished difference Result 84 states and 100 transitions. [2019-01-14 04:54:41,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 04:54:41,814 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 100 transitions. [2019-01-14 04:54:41,816 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 04:54:41,817 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 62 states and 73 transitions. [2019-01-14 04:54:41,817 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2019-01-14 04:54:41,817 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2019-01-14 04:54:41,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 73 transitions. [2019-01-14 04:54:41,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:54:41,818 INFO L706 BuchiCegarLoop]: Abstraction has 62 states and 73 transitions. [2019-01-14 04:54:41,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 73 transitions. [2019-01-14 04:54:41,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-01-14 04:54:41,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-14 04:54:41,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2019-01-14 04:54:41,827 INFO L729 BuchiCegarLoop]: Abstraction has 62 states and 73 transitions. [2019-01-14 04:54:41,827 INFO L609 BuchiCegarLoop]: Abstraction has 62 states and 73 transitions. [2019-01-14 04:54:41,827 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2019-01-14 04:54:41,827 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 73 transitions. [2019-01-14 04:54:41,828 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 04:54:41,828 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:54:41,828 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:54:41,829 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:54:41,829 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 04:54:41,830 INFO L794 eck$LassoCheckResult]: Stem: 1941#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1940#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1936#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1937#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1938#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1939#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1961#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1958#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1955#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1952#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1950#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1948#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1947#L23-3 assume !(main_~i~1 < 5); 1935#L23-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; 1927#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1928#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1934#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1929#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1930#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1984#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1983#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1981#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1979#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1977#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1975#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1973#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1971#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1969#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1967#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1965#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1963#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1960#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1957#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1954#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1946#L9-3 assume !(max_~i~0 < 5); 1923#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1924#L12 main_#t~ret6 := max_#res;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;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; 1944#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1931#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1925#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1926#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1945#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1982#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1980#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1978#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1976#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1974#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1972#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1970#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1968#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1966#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1964#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1962#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1959#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1956#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1953#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1951#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1949#L9-8 assume !(max_~i~0 < 5); 1942#L9-9 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1943#L12-1 main_#t~ret9 := max_#res;main_~ret2~0 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;main_~i~2 := 0; 1932#L32-3 [2019-01-14 04:54:41,830 INFO L796 eck$LassoCheckResult]: Loop: 1932#L32-3 assume !!(main_~i~2 < 4);call main_#t~mem12 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~2), 4);call write~int(main_#t~mem12, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~2, 4);havoc main_#t~mem12; 1933#L32-2 main_#t~post11 := main_~i~2;main_~i~2 := 1 + main_#t~post11;havoc main_#t~post11; 1932#L32-3 [2019-01-14 04:54:41,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:41,830 INFO L82 PathProgramCache]: Analyzing trace with hash -260352212, now seen corresponding path program 1 times [2019-01-14 04:54:41,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:41,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:41,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:41,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:54:41,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:41,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:41,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:41,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:41,950 INFO L82 PathProgramCache]: Analyzing trace with hash 3203, now seen corresponding path program 1 times [2019-01-14 04:54:41,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:41,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:41,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:41,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:54:41,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:41,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:41,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:41,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:41,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1090370322, now seen corresponding path program 1 times [2019-01-14 04:54:41,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:41,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:41,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:41,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:54:41,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:42,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:42,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:42,496 WARN L181 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-01-14 04:54:45,748 WARN L181 SmtUtils]: Spent 3.22 s on a formula simplification. DAG size of input: 371 DAG size of output: 286 [2019-01-14 04:54:46,766 WARN L181 SmtUtils]: Spent 959.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 115 [2019-01-14 04:54:46,774 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:54:46,774 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:54:46,774 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:54:46,774 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:54:46,775 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:54:46,775 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:54:46,775 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:54:46,775 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:54:46,775 INFO L131 ssoRankerPreferences]: Filename of dumped script: max05_true-unreach-call_true-termination.i_Iteration14_Lasso [2019-01-14 04:54:46,775 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:54:46,775 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:54:46,780 INFO L141 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:46,815 INFO L141 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:46,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:54:46,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:46,882 INFO L141 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:46,884 INFO L141 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:46,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:46,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:46,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:46,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:46,896 INFO L141 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:46,898 INFO L141 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:46,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:46,905 INFO L141 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:46,907 INFO L141 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:46,912 INFO L141 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:46,914 INFO L141 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:46,915 INFO L141 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:46,917 INFO L141 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:46,922 INFO L141 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:46,924 INFO L141 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:47,436 WARN L181 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 71 [2019-01-14 04:54:48,295 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:54:48,296 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:54:48,297 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:54:48,297 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:48,298 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:48,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:48,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:48,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:48,305 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:48,305 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:48,306 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:48,307 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:54:48,307 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:48,308 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:48,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:48,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:48,308 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:48,308 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:48,308 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:48,312 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:48,312 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:48,313 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:48,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:48,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:48,313 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:48,314 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:54:48,314 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:54:48,316 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:48,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:54:48,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:48,317 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:48,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:48,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:48,327 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:48,327 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:48,327 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:48,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:48,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:48,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:48,331 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:48,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:48,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:48,331 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:48,331 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:48,331 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:48,336 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:48,338 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:48,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:48,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:48,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:48,339 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:48,343 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:54:48,343 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:54:48,345 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:48,346 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:48,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:48,349 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:48,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:48,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:48,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:48,350 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:48,350 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:48,351 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:48,351 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:48,351 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:48,351 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:48,351 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:48,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:48,355 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:48,355 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:48,355 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:48,356 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:48,356 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:54:48,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:48,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:48,362 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:48,362 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:48,363 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:54:48,363 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:54:48,364 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:48,364 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:54:48,365 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:48,365 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:48,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:48,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:48,365 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:48,366 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:48,366 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:48,366 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:48,366 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:48,370 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:48,370 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:48,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:48,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:48,371 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:48,371 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:48,371 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:48,371 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:48,372 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:54:48,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:48,372 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:48,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:48,373 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:48,373 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:48,373 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:48,373 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:48,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:48,377 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:54:48,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:48,378 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:48,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:48,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:48,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:48,378 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:48,378 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:48,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:48,381 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:54:48,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:48,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:48,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:48,382 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:48,386 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:54:48,387 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:54:48,388 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:48,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:54:48,389 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:48,389 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:48,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:48,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:48,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:48,393 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:48,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:48,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:48,394 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:54:48,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:48,394 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:48,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:48,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:48,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:48,395 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:48,395 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:48,396 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:48,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:54:48,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:48,401 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:48,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:48,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:48,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:48,402 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:48,402 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:48,403 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:48,406 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:48,407 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:48,407 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:48,407 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:48,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:48,407 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:48,407 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:48,408 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:48,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:48,409 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:54:48,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:48,409 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:48,410 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:48,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:48,410 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:48,410 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:48,410 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:48,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:48,411 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:54:48,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:48,411 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:48,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:48,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:48,412 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:48,412 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:48,412 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:48,412 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:48,413 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:48,413 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:48,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:48,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:48,414 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:48,414 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:54:48,414 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:54:48,419 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:48,419 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:54:48,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:48,420 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:48,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:48,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:48,421 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:48,421 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:48,421 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:48,421 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:48,429 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:48,429 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:48,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:48,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:48,430 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:48,431 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:54:48,431 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:54:48,443 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:48,444 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:48,447 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:48,447 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 04:54:48,447 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:48,448 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:48,449 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 04:54:48,449 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:54:48,458 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:48,459 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:48,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:48,459 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:48,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:48,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:48,465 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:48,465 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:48,465 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:48,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:48,466 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:48,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:48,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:48,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:48,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:48,468 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:54:48,468 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:54:48,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:48,470 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:48,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:48,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:48,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:48,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:48,472 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:54:48,472 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:54:48,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:48,476 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:48,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:48,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:48,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:48,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:48,478 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:54:48,478 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:54:48,479 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:48,480 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:48,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:48,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:48,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:48,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:48,482 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:54:48,482 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:54:48,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:48,485 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:54:48,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:48,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:48,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:48,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:48,487 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:54:48,488 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:54:48,498 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:54:48,549 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2019-01-14 04:54:48,549 INFO L444 ModelExtractionUtils]: 13 out of 22 variables were initially zero. Simplification set additionally 6 variables to zero. [2019-01-14 04:54:48,550 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:54:48,550 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 04:54:48,551 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:54:48,551 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~2, v_rep(select #length ULTIMATE.start_main_~#x~0.base)_3) = -16*ULTIMATE.start_main_~i~2 + 7*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_3 Supporting invariants [] [2019-01-14 04:54:48,864 INFO L297 tatePredicateManager]: 25 out of 25 supporting invariants were superfluous and have been removed [2019-01-14 04:54:48,866 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 04:54:48,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:48,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:54:48,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:54:48,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:54:48,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:54:48,975 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:48,975 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:48,976 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62 states and 73 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-01-14 04:54:49,000 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62 states and 73 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 64 states and 76 transitions. Complement of second has 4 states. [2019-01-14 04:54:49,001 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:54:49,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:54:49,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2019-01-14 04:54:49,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 60 letters. Loop has 2 letters. [2019-01-14 04:54:49,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:54:49,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 62 letters. Loop has 2 letters. [2019-01-14 04:54:49,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:54:49,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 60 letters. Loop has 4 letters. [2019-01-14 04:54:49,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:54:49,008 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 76 transitions. [2019-01-14 04:54:49,009 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:54:49,009 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 0 states and 0 transitions. [2019-01-14 04:54:49,010 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:54:49,010 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:54:49,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:54:49,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:54:49,010 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:54:49,010 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:54:49,010 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:54:49,010 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2019-01-14 04:54:49,010 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 04:54:49,010 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:54:49,011 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 04:54:49,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:54:49 BoogieIcfgContainer [2019-01-14 04:54:49,018 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:54:49,018 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:54:49,018 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:54:49,018 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:54:49,019 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:30" (3/4) ... [2019-01-14 04:54:49,023 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 04:54:49,023 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:54:49,024 INFO L168 Benchmark]: Toolchain (without parser) took 19232.26 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 314.0 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -179.4 MB). Peak memory consumption was 134.6 MB. Max. memory is 11.5 GB. [2019-01-14 04:54:49,025 INFO L168 Benchmark]: CDTParser took 0.17 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:54:49,025 INFO L168 Benchmark]: CACSL2BoogieTranslator took 359.64 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 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:54:49,026 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.23 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:54:49,027 INFO L168 Benchmark]: Boogie Preprocessor took 122.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -182.5 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. [2019-01-14 04:54:49,027 INFO L168 Benchmark]: RCFGBuilder took 597.82 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: 31.3 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. [2019-01-14 04:54:49,028 INFO L168 Benchmark]: BuchiAutomizer took 18095.38 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 188.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -48.3 MB). Peak memory consumption was 140.5 MB. Max. memory is 11.5 GB. [2019-01-14 04:54:49,029 INFO L168 Benchmark]: Witness Printer took 4.91 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:54:49,034 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 359.64 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 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 47.23 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 122.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -182.5 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 597.82 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: 31.3 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 18095.38 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 188.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -48.3 MB). Peak memory consumption was 140.5 MB. Max. memory is 11.5 GB. * Witness Printer took 4.91 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #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 14 terminating modules (11 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -8 * i + 9 * unknown-#length-unknown[x] and consists of 5 locations. One deterministic module has affine ranking function -2 * i + 9 and consists of 4 locations. One deterministic module has affine ranking function -16 * i + 7 * unknown-#length-unknown[x] and consists of 3 locations. 11 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 18.0s and 15 iterations. TraceHistogramMax:5. Analysis of lassos took 15.9s. Construction of modules took 1.0s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 14. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 85 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 67 states and ocurred in iteration 12. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 346 SDtfs, 399 SDslu, 704 SDs, 0 SdLazy, 441 SolverSat, 91 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU10 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital257 mio100 ax100 hnf99 lsp95 ukn49 mio100 lsp55 div100 bol100 ite100 ukn100 eq163 hnf87 smp98 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 30ms VariablesStem: 2 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...