./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 30ab881e1a71a9d76a9921c34ce47cc9425d2331 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 21:43:16,034 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:43:16,035 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:43:16,048 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:43:16,048 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:43:16,049 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:43:16,051 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:43:16,053 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:43:16,055 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:43:16,056 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:43:16,057 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:43:16,057 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:43:16,058 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:43:16,059 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:43:16,061 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:43:16,061 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:43:16,062 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:43:16,065 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:43:16,067 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:43:16,069 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:43:16,070 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:43:16,072 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:43:16,074 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:43:16,075 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:43:16,075 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:43:16,076 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:43:16,078 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:43:16,078 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:43:16,079 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:43:16,081 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:43:16,081 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:43:16,081 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:43:16,082 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:43:16,082 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:43:16,084 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:43:16,085 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:43:16,085 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:43:16,102 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:43:16,103 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:43:16,107 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:43:16,107 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:43:16,107 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:43:16,107 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:43:16,108 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:43:16,108 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:43:16,108 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:43:16,108 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:43:16,108 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:43:16,109 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:43:16,111 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:43:16,111 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:43:16,111 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:43:16,111 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:43:16,112 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:43:16,112 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:43:16,112 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:43:16,112 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:43:16,112 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:43:16,112 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:43:16,113 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:43:16,113 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:43:16,113 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:43:16,113 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:43:16,114 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:43:16,115 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:43:16,116 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:43:16,116 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 30ab881e1a71a9d76a9921c34ce47cc9425d2331 [2019-01-01 21:43:16,158 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:43:16,176 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:43:16,183 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:43:16,184 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:43:16,185 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:43:16,186 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i [2019-01-01 21:43:16,254 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af1a5666d/6cef313969314e55a8e92099cb4a3094/FLAG89bd17fe7 [2019-01-01 21:43:16,827 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:43:16,828 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i [2019-01-01 21:43:16,841 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af1a5666d/6cef313969314e55a8e92099cb4a3094/FLAG89bd17fe7 [2019-01-01 21:43:17,119 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af1a5666d/6cef313969314e55a8e92099cb4a3094 [2019-01-01 21:43:17,123 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:43:17,125 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:43:17,126 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:43:17,126 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:43:17,130 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:43:17,131 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:43:17" (1/1) ... [2019-01-01 21:43:17,134 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f4fbf7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:43:17, skipping insertion in model container [2019-01-01 21:43:17,134 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:43:17" (1/1) ... [2019-01-01 21:43:17,142 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:43:17,193 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:43:17,508 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:43:17,528 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:43:17,598 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:43:17,736 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:43:17,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:43:17 WrapperNode [2019-01-01 21:43:17,737 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:43:17,738 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:43:17,738 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:43:17,738 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:43:17,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:43:17" (1/1) ... [2019-01-01 21:43:17,765 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:43:17" (1/1) ... [2019-01-01 21:43:17,785 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:43:17,786 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:43:17,786 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:43:17,786 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:43:17,797 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:43:17" (1/1) ... [2019-01-01 21:43:17,797 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:43:17" (1/1) ... [2019-01-01 21:43:17,800 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:43:17" (1/1) ... [2019-01-01 21:43:17,800 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:43:17" (1/1) ... [2019-01-01 21:43:17,805 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:43:17" (1/1) ... [2019-01-01 21:43:17,810 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:43:17" (1/1) ... [2019-01-01 21:43:17,811 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:43:17" (1/1) ... [2019-01-01 21:43:17,814 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:43:17,814 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:43:17,814 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:43:17,814 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:43:17,815 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:43:17" (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-01 21:43:17,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 21:43:17,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 21:43:17,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 21:43:17,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 21:43:17,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:43:17,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:43:18,223 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:43:18,224 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-01 21:43:18,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:43:18 BoogieIcfgContainer [2019-01-01 21:43:18,224 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:43:18,225 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:43:18,225 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:43:18,228 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:43:18,229 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:43:18,230 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:43:17" (1/3) ... [2019-01-01 21:43:18,231 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@79f4ddee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:43:18, skipping insertion in model container [2019-01-01 21:43:18,231 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:43:18,231 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:43:17" (2/3) ... [2019-01-01 21:43:18,232 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@79f4ddee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:43:18, skipping insertion in model container [2019-01-01 21:43:18,232 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:43:18,232 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:43:18" (3/3) ... [2019-01-01 21:43:18,234 INFO L375 chiAutomizerObserver]: Analyzing ICFG CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i [2019-01-01 21:43:18,297 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:43:18,297 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:43:18,298 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:43:18,298 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:43:18,298 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:43:18,298 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:43:18,298 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:43:18,299 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:43:18,299 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:43:18,313 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2019-01-01 21:43:18,335 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:43:18,336 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:43:18,336 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:43:18,342 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:43:18,343 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 21:43:18,343 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:43:18,343 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2019-01-01 21:43:18,344 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:43:18,345 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:43:18,345 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:43:18,345 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:43:18,345 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 21:43:18,354 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet7, main_#t~mem8, main_#t~nondet9, main_#t~mem10, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 11#L551-2true [2019-01-01 21:43:18,355 INFO L796 eck$LassoCheckResult]: Loop: 11#L551-2true call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := main_#t~mem4 > 0; 12#L550-1true assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 6#L550-3true assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~short6;havoc main_#t~mem5; 7#L551true assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem8 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem8; 11#L551-2true [2019-01-01 21:43:18,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:18,362 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-01-01 21:43:18,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:43:18,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:43:18,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:18,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:43:18,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:18,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:18,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:18,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:18,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1142247, now seen corresponding path program 1 times [2019-01-01 21:43:18,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:43:18,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:43:18,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:18,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:43:18,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:18,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:18,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:18,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:18,558 INFO L82 PathProgramCache]: Analyzing trace with hash 889569449, now seen corresponding path program 1 times [2019-01-01 21:43:18,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:43:18,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:43:18,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:18,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:43:18,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:18,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:18,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:19,114 WARN L181 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-01-01 21:43:19,381 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-01-01 21:43:19,572 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-01-01 21:43:19,589 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:43:19,590 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:43:19,591 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:43:19,591 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:43:19,591 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:43:19,591 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:43:19,591 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:43:19,592 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:43:19,592 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i_Iteration1_Lasso [2019-01-01 21:43:19,592 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:43:19,592 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:43:19,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:19,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:19,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:19,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:19,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:19,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:19,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:20,281 WARN L181 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-01-01 21:43:20,401 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2019-01-01 21:43:20,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:20,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:20,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:20,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:20,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:20,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:20,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:21,225 WARN L181 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-01-01 21:43:21,307 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:43:21,313 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:43:21,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:21,317 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:21,317 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:21,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:21,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:21,319 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:21,320 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:21,321 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:21,323 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:21,324 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:21,325 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:21,325 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:21,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:21,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:21,326 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:21,326 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:21,326 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:21,328 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:21,328 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:21,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:21,329 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:21,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:21,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:21,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:21,330 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:21,330 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:21,331 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:21,332 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:21,332 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:21,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:21,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:21,333 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:21,336 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:21,336 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:21,340 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:21,341 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:21,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:21,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:21,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:21,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:21,345 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:21,345 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:21,349 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:21,349 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:21,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:21,350 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:21,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:21,351 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:21,351 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:21,351 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:21,352 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:21,353 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:21,353 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:21,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:21,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:21,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:21,355 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:21,363 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:21,363 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:21,405 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:21,405 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:21,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:21,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:21,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:21,407 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:21,410 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:21,411 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:21,444 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:21,445 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:21,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:21,449 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-01 21:43:21,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:21,449 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:21,461 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 21:43:21,461 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:21,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:21,532 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:21,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:21,533 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:21,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:21,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:21,534 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:21,534 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:21,534 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:21,537 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:43:21,542 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:43:21,542 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:43:21,545 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:43:21,545 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:43:21,545 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:43:21,546 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 Supporting invariants [] [2019-01-01 21:43:21,734 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2019-01-01 21:43:21,742 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:43:21,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:21,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:43:21,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:43:21,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:43:21,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:43:21,903 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-01 21:43:21,919 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 21:43:21,921 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states. Second operand 4 states. [2019-01-01 21:43:22,047 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states.. Second operand 4 states. Result 40 states and 48 transitions. Complement of second has 10 states. [2019-01-01 21:43:22,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 21:43:22,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:43:22,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2019-01-01 21:43:22,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 2 letters. Loop has 4 letters. [2019-01-01 21:43:22,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:43:22,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-01 21:43:22,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:43:22,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 2 letters. Loop has 8 letters. [2019-01-01 21:43:22,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:43:22,057 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 48 transitions. [2019-01-01 21:43:22,060 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:43:22,065 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 16 states and 22 transitions. [2019-01-01 21:43:22,066 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-01 21:43:22,066 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-01 21:43:22,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2019-01-01 21:43:22,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:43:22,067 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-01-01 21:43:22,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2019-01-01 21:43:22,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2019-01-01 21:43:22,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-01 21:43:22,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2019-01-01 21:43:22,095 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2019-01-01 21:43:22,095 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2019-01-01 21:43:22,095 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:43:22,095 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 20 transitions. [2019-01-01 21:43:22,096 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:43:22,097 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:43:22,097 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:43:22,097 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:43:22,097 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 21:43:22,098 INFO L794 eck$LassoCheckResult]: Stem: 150#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 144#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet7, main_#t~mem8, main_#t~nondet9, main_#t~mem10, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 145#L551-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := main_#t~mem4 > 0; 153#L550-1 assume !main_#t~short6; 146#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~short6;havoc main_#t~mem5; 147#L551 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(main_#t~nondet9, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet9;call main_#t~mem10 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem10; 151#L551-2 [2019-01-01 21:43:22,098 INFO L796 eck$LassoCheckResult]: Loop: 151#L551-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := main_#t~mem4 > 0; 155#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 157#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~short6;havoc main_#t~mem5; 156#L551 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem8 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem8; 151#L551-2 [2019-01-01 21:43:22,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:22,098 INFO L82 PathProgramCache]: Analyzing trace with hash 889571373, now seen corresponding path program 1 times [2019-01-01 21:43:22,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:43:22,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:43:22,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:22,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:43:22,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:22,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:43:22,174 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-01 21:43:22,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:43:22,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 21:43:22,179 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:43:22,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:22,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1142247, now seen corresponding path program 2 times [2019-01-01 21:43:22,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:43:22,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:43:22,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:22,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:43:22,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:22,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:22,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:22,362 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-01-01 21:43:22,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 21:43:22,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 21:43:22,410 INFO L87 Difference]: Start difference. First operand 14 states and 20 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-01-01 21:43:22,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:43:22,435 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2019-01-01 21:43:22,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 21:43:22,436 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions. [2019-01-01 21:43:22,437 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:43:22,438 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 14 states and 17 transitions. [2019-01-01 21:43:22,438 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-01 21:43:22,438 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-01 21:43:22,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2019-01-01 21:43:22,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:43:22,439 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-01-01 21:43:22,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2019-01-01 21:43:22,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-01-01 21:43:22,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-01 21:43:22,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2019-01-01 21:43:22,442 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-01-01 21:43:22,442 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-01-01 21:43:22,442 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:43:22,442 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2019-01-01 21:43:22,442 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:43:22,442 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:43:22,443 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:43:22,443 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:43:22,443 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 21:43:22,443 INFO L794 eck$LassoCheckResult]: Stem: 183#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 181#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet7, main_#t~mem8, main_#t~nondet9, main_#t~mem10, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 182#L551-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := main_#t~mem4 > 0; 191#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 184#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~short6;havoc main_#t~mem5; 185#L551 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(main_#t~nondet9, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet9;call main_#t~mem10 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem10; 188#L551-2 [2019-01-01 21:43:22,443 INFO L796 eck$LassoCheckResult]: Loop: 188#L551-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := main_#t~mem4 > 0; 190#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 194#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~short6;havoc main_#t~mem5; 193#L551 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem8 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem8; 188#L551-2 [2019-01-01 21:43:22,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:22,444 INFO L82 PathProgramCache]: Analyzing trace with hash 889569451, now seen corresponding path program 1 times [2019-01-01 21:43:22,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:43:22,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:43:22,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:22,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:43:22,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:22,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:22,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:22,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:22,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1142247, now seen corresponding path program 3 times [2019-01-01 21:43:22,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:43:22,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:43:22,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:22,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:43:22,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:22,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:22,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:22,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:22,483 INFO L82 PathProgramCache]: Analyzing trace with hash -980235887, now seen corresponding path program 1 times [2019-01-01 21:43:22,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:43:22,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:43:22,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:22,484 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:43:22,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:22,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:22,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:22,695 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-01-01 21:43:23,010 WARN L181 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 72 [2019-01-01 21:43:23,268 WARN L181 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-01-01 21:43:23,273 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:43:23,273 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:43:23,273 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:43:23,274 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:43:23,274 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:43:23,274 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:43:23,274 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:43:23,274 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:43:23,275 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i_Iteration3_Lasso [2019-01-01 21:43:23,275 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:43:23,275 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:43:23,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:23,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:23,784 WARN L181 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-01-01 21:43:23,930 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2019-01-01 21:43:23,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:23,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:23,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:23,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:23,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:23,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:23,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:23,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:23,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:23,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:23,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:23,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:24,409 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-01-01 21:43:24,517 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:43:24,517 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:43:24,517 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:24,518 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:24,518 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:24,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:24,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:24,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:24,519 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:24,519 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:24,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:24,520 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:24,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:24,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:24,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:24,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:24,524 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:24,525 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:24,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:24,540 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:24,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:24,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:24,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:24,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:24,542 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:24,543 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:24,548 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:24,549 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:24,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:24,549 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-01 21:43:24,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:24,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:24,552 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 21:43:24,553 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:24,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:24,569 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:24,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:24,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:24,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:24,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:24,574 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:24,574 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:24,581 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:24,581 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:24,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:24,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:24,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:24,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:24,583 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:24,586 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:24,600 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:24,601 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:24,602 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:24,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:24,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:24,602 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:24,606 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:24,606 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:24,623 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:43:24,637 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:43:24,637 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-01 21:43:24,638 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:43:24,639 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:43:24,640 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:43:24,642 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2 Supporting invariants [] [2019-01-01 21:43:24,820 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2019-01-01 21:43:24,821 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:43:24,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:24,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:43:24,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:43:24,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:43:24,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:43:24,995 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2019-01-01 21:43:25,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:43:25,011 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 21:43:25,011 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-01-01 21:43:25,055 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 22 states and 27 transitions. Complement of second has 7 states. [2019-01-01 21:43:25,058 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-01 21:43:25,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:43:25,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-01-01 21:43:25,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-01 21:43:25,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:43:25,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 10 letters. Loop has 4 letters. [2019-01-01 21:43:25,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:43:25,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 8 letters. [2019-01-01 21:43:25,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:43:25,060 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 27 transitions. [2019-01-01 21:43:25,062 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:43:25,062 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 27 transitions. [2019-01-01 21:43:25,063 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-01-01 21:43:25,063 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-01-01 21:43:25,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 27 transitions. [2019-01-01 21:43:25,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:43:25,063 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2019-01-01 21:43:25,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 27 transitions. [2019-01-01 21:43:25,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-01-01 21:43:25,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-01 21:43:25,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2019-01-01 21:43:25,067 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2019-01-01 21:43:25,067 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2019-01-01 21:43:25,068 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:43:25,068 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2019-01-01 21:43:25,069 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:43:25,069 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:43:25,069 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:43:25,069 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1] [2019-01-01 21:43:25,069 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 21:43:25,071 INFO L794 eck$LassoCheckResult]: Stem: 322#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 316#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet7, main_#t~mem8, main_#t~nondet9, main_#t~mem10, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 317#L551-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := main_#t~mem4 > 0; 333#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 332#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~short6;havoc main_#t~mem5; 330#L551 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(main_#t~nondet9, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet9;call main_#t~mem10 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem10; 329#L551-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := main_#t~mem4 > 0; 327#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 318#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~short6;havoc main_#t~mem5; 319#L551 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(main_#t~nondet9, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet9;call main_#t~mem10 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem10; 323#L551-2 [2019-01-01 21:43:25,071 INFO L796 eck$LassoCheckResult]: Loop: 323#L551-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := main_#t~mem4 > 0; 325#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 328#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~short6;havoc main_#t~mem5; 331#L551 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem8 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem8; 323#L551-2 [2019-01-01 21:43:25,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:25,072 INFO L82 PathProgramCache]: Analyzing trace with hash -980235885, now seen corresponding path program 2 times [2019-01-01 21:43:25,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:43:25,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:43:25,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:25,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:43:25,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:25,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:25,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:25,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:25,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1142247, now seen corresponding path program 4 times [2019-01-01 21:43:25,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:43:25,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:43:25,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:25,108 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:43:25,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:25,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:25,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:25,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:25,121 INFO L82 PathProgramCache]: Analyzing trace with hash -987685255, now seen corresponding path program 2 times [2019-01-01 21:43:25,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:43:25,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:43:25,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:25,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:43:25,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:25,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:25,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:25,742 WARN L181 SmtUtils]: Spent 564.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-01-01 21:43:26,268 WARN L181 SmtUtils]: Spent 494.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 101 [2019-01-01 21:43:26,416 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-01-01 21:43:26,422 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:43:26,422 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:43:26,422 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:43:26,422 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:43:26,423 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:43:26,423 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:43:26,423 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:43:26,423 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:43:26,423 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i_Iteration4_Lasso [2019-01-01 21:43:26,423 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:43:26,423 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:43:26,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:26,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:26,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:26,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:26,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:26,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:26,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:26,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:26,786 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-01-01 21:43:26,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:26,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:26,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:26,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:26,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:26,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-01 21:43:26,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:26,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:27,427 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-01-01 21:43:27,464 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:43:27,465 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:43:27,465 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:27,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:27,468 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:27,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:27,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:27,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:27,470 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:27,470 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:27,471 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:27,471 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:27,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:27,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:27,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:27,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:27,476 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:27,476 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:27,479 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:27,479 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:27,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:27,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:27,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:27,480 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:27,484 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:27,484 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:27,486 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:27,487 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:27,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:27,487 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:27,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:27,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:27,490 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:27,490 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:27,491 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:27,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:27,492 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:27,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:27,492 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:27,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:27,495 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 21:43:27,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:27,496 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 21:43:27,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:27,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:27,500 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:27,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:27,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:27,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:27,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:27,504 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:27,505 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:27,506 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:27,506 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:27,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:27,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:27,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:27,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:27,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:27,511 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:27,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:27,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:27,513 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:27,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:27,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:27,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:27,516 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:27,518 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:27,518 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:27,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:27,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:27,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:27,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:27,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:27,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:27,528 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:27,528 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:27,533 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:27,534 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:27,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:27,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:27,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:27,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:27,538 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:27,539 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:27,544 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:27,544 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:27,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:27,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:27,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:27,545 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:27,546 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:27,546 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:27,550 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:27,551 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:27,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:27,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:27,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:27,554 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:27,557 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:27,557 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:27,592 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:27,593 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:27,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:27,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:27,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:27,594 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:27,597 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:27,597 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:27,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:27,600 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:27,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:27,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:27,601 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:27,601 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:27,601 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:27,602 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:27,609 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:43:27,613 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:43:27,613 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:43:27,614 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:43:27,614 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:43:27,616 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:43:27,616 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3 Supporting invariants [] [2019-01-01 21:43:27,926 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2019-01-01 21:43:27,928 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:43:27,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:27,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:43:27,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:43:27,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:43:27,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:43:28,053 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-01 21:43:28,054 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 21:43:28,054 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-01-01 21:43:28,101 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 28 states and 35 transitions. Complement of second has 7 states. [2019-01-01 21:43:28,107 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-01 21:43:28,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:43:28,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-01-01 21:43:28,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 10 letters. Loop has 4 letters. [2019-01-01 21:43:28,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:43:28,108 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:43:28,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:28,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:43:28,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:43:28,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:43:28,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:43:28,210 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-01 21:43:28,210 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 21:43:28,211 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-01-01 21:43:28,244 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 28 states and 35 transitions. Complement of second has 7 states. [2019-01-01 21:43:28,245 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-01 21:43:28,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:43:28,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-01-01 21:43:28,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 10 letters. Loop has 4 letters. [2019-01-01 21:43:28,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:43:28,247 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:43:28,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:28,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:43:28,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:43:28,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:43:28,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:43:28,328 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-01 21:43:28,328 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 21:43:28,329 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-01-01 21:43:28,363 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 32 states and 40 transitions. Complement of second has 6 states. [2019-01-01 21:43:28,369 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-01 21:43:28,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:43:28,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-01-01 21:43:28,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 10 letters. Loop has 4 letters. [2019-01-01 21:43:28,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:43:28,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 4 letters. [2019-01-01 21:43:28,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:43:28,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 10 letters. Loop has 8 letters. [2019-01-01 21:43:28,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:43:28,372 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 40 transitions. [2019-01-01 21:43:28,375 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-01 21:43:28,376 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 26 states and 32 transitions. [2019-01-01 21:43:28,376 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-01-01 21:43:28,376 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-01-01 21:43:28,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 32 transitions. [2019-01-01 21:43:28,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:43:28,378 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2019-01-01 21:43:28,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 32 transitions. [2019-01-01 21:43:28,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 10. [2019-01-01 21:43:28,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-01 21:43:28,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2019-01-01 21:43:28,381 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-01-01 21:43:28,381 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-01-01 21:43:28,381 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 21:43:28,382 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2019-01-01 21:43:28,382 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-01 21:43:28,382 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:43:28,382 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:43:28,382 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:43:28,383 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 21:43:28,383 INFO L794 eck$LassoCheckResult]: Stem: 642#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 640#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet7, main_#t~mem8, main_#t~nondet9, main_#t~mem10, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 641#L551-2 [2019-01-01 21:43:28,383 INFO L796 eck$LassoCheckResult]: Loop: 641#L551-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := main_#t~mem4 > 0; 649#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 643#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~short6;havoc main_#t~mem5; 644#L551 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(main_#t~nondet9, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet9;call main_#t~mem10 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem10; 641#L551-2 [2019-01-01 21:43:28,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:28,383 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-01-01 21:43:28,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:43:28,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:43:28,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:28,385 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:43:28,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:28,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:28,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:28,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:28,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1142249, now seen corresponding path program 1 times [2019-01-01 21:43:28,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:43:28,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:43:28,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:28,397 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:43:28,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:28,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:28,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:28,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:28,408 INFO L82 PathProgramCache]: Analyzing trace with hash 889569451, now seen corresponding path program 3 times [2019-01-01 21:43:28,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:43:28,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:43:28,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:28,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:43:28,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:28,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:28,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:28,641 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-01-01 21:43:28,781 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:43:28,781 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:43:28,781 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:43:28,781 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:43:28,781 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:43:28,782 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:43:28,782 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:43:28,782 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:43:28,782 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i_Iteration5_Lasso [2019-01-01 21:43:28,782 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:43:28,782 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:43:28,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:28,924 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-01-01 21:43:29,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:29,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:29,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:29,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:29,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:29,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:29,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:29,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:29,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:29,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:29,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:29,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:29,424 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-01-01 21:43:29,503 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:43:29,504 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:43:29,504 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:29,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:29,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:29,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:29,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:29,509 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:29,509 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:29,511 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:29,512 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:29,512 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:29,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:29,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:29,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:29,518 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:29,518 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:29,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:29,527 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:29,527 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:29,528 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:29,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:29,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:29,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:29,532 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:29,532 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:29,533 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:29,534 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:29,534 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:29,534 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-01 21:43:29,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:29,534 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:29,539 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 21:43:29,540 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:29,549 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:29,550 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:29,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:29,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:29,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:29,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:29,554 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:29,554 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:29,555 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:29,557 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:29,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:29,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:29,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:29,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:29,561 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:29,561 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:29,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:29,567 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:29,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:29,567 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:29,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:29,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:29,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:29,571 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:29,571 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:29,572 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:43:29,575 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:43:29,575 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:43:29,575 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:43:29,575 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:43:29,576 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:43:29,576 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_4 Supporting invariants [] [2019-01-01 21:43:29,814 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2019-01-01 21:43:29,816 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:43:29,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:29,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:43:29,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:43:29,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:43:29,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:43:29,940 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-01 21:43:29,941 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 21:43:29,941 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 3 Second operand 5 states. [2019-01-01 21:43:30,024 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 3. Second operand 5 states. Result 26 states and 33 transitions. Complement of second has 8 states. [2019-01-01 21:43:30,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 21:43:30,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:43:30,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2019-01-01 21:43:30,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 2 letters. Loop has 4 letters. [2019-01-01 21:43:30,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:43:30,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-01 21:43:30,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:43:30,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 2 letters. Loop has 8 letters. [2019-01-01 21:43:30,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:43:30,027 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 33 transitions. [2019-01-01 21:43:30,029 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:43:30,029 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 0 states and 0 transitions. [2019-01-01 21:43:30,029 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:43:30,029 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:43:30,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:43:30,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:43:30,029 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:43:30,029 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:43:30,029 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:43:30,030 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 21:43:30,030 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:43:30,030 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:43:30,030 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:43:30,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:43:30 BoogieIcfgContainer [2019-01-01 21:43:30,037 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:43:30,037 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:43:30,037 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:43:30,037 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:43:30,038 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:43:18" (3/4) ... [2019-01-01 21:43:30,042 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:43:30,042 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:43:30,043 INFO L168 Benchmark]: Toolchain (without parser) took 12919.05 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 313.0 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -108.7 MB). Peak memory consumption was 204.3 MB. Max. memory is 11.5 GB. [2019-01-01 21:43:30,045 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:43:30,046 INFO L168 Benchmark]: CACSL2BoogieTranslator took 611.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -190.4 MB). Peak memory consumption was 38.4 MB. Max. memory is 11.5 GB. [2019-01-01 21:43:30,048 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:43:30,048 INFO L168 Benchmark]: Boogie Preprocessor took 28.20 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:43:30,049 INFO L168 Benchmark]: RCFGBuilder took 410.19 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: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-01-01 21:43:30,051 INFO L168 Benchmark]: BuchiAutomizer took 11811.90 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 167.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 57.1 MB). Peak memory consumption was 224.9 MB. Max. memory is 11.5 GB. [2019-01-01 21:43:30,052 INFO L168 Benchmark]: Witness Printer took 5.08 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-01 21:43:30,058 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 611.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -190.4 MB). Peak memory consumption was 38.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.20 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 410.19 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: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 11811.90 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 167.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 57.1 MB). Peak memory consumption was 224.9 MB. Max. memory is 11.5 GB. * Witness Printer took 5.08 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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (1 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 4 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 5 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.7s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 10.3s. Construction of modules took 0.1s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 18 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 22 states and ocurred in iteration 3. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 50 SDtfs, 47 SDslu, 18 SDs, 0 SdLazy, 74 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital252 mio100 ax108 hnf100 lsp87 ukn62 mio100 lsp39 div100 bol100 ite100 ukn100 eq185 hnf88 smp97 dnf162 smp95 tf100 neg93 sie125 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 85ms VariablesStem: 5 VariablesLoop: 4 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 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...