./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-recursive-malloc/rec_malloc_ex7B_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-recursive-malloc/rec_malloc_ex7B_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 d6678868f165c4dda1e615b0f5d66797a7e8aaae ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 02:48:47,908 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:48:47,910 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:48:47,929 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:48:47,930 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:48:47,931 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:48:47,932 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:48:47,934 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:48:47,936 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:48:47,937 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:48:47,938 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:48:47,938 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:48:47,939 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:48:47,940 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:48:47,941 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:48:47,942 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:48:47,943 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:48:47,945 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:48:47,947 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:48:47,949 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:48:47,950 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:48:47,952 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:48:47,954 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:48:47,955 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:48:47,955 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:48:47,956 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:48:47,957 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:48:47,958 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:48:47,959 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:48:47,960 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:48:47,961 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:48:47,962 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:48:47,962 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:48:47,962 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:48:47,963 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:48:47,964 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:48:47,964 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:48:47,987 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:48:47,989 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:48:47,990 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:48:47,990 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:48:47,990 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:48:47,991 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:48:47,991 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:48:47,991 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:48:47,991 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:48:47,991 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:48:47,991 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:48:47,992 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:48:47,992 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:48:47,992 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:48:47,992 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:48:47,992 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:48:47,993 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:48:47,993 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:48:47,993 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:48:47,993 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:48:47,993 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:48:47,993 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:48:47,994 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:48:47,994 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:48:47,994 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:48:47,994 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:48:47,994 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:48:47,995 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:48:47,995 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:48:47,996 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 -> d6678868f165c4dda1e615b0f5d66797a7e8aaae [2019-01-14 02:48:48,035 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:48:48,051 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:48:48,056 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:48:48,058 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:48:48,058 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:48:48,059 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-recursive-malloc/rec_malloc_ex7B_true-termination.c.i [2019-01-14 02:48:48,123 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/086e74a9e/083f07b2677f4227ad40e4b6d5ed959d/FLAGc9d352345 [2019-01-14 02:48:48,617 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:48:48,618 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-recursive-malloc/rec_malloc_ex7B_true-termination.c.i [2019-01-14 02:48:48,624 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/086e74a9e/083f07b2677f4227ad40e4b6d5ed959d/FLAGc9d352345 [2019-01-14 02:48:48,958 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/086e74a9e/083f07b2677f4227ad40e4b6d5ed959d [2019-01-14 02:48:48,962 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:48:48,964 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:48:48,965 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:48:48,965 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:48:48,969 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:48:48,970 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:48:48" (1/1) ... [2019-01-14 02:48:48,972 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4adeb527 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:48, skipping insertion in model container [2019-01-14 02:48:48,972 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:48:48" (1/1) ... [2019-01-14 02:48:48,978 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:48:48,996 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:48:49,212 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:48:49,228 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:48:49,247 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:48:49,263 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:48:49,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:49 WrapperNode [2019-01-14 02:48:49,264 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:48:49,265 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:48:49,265 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:48:49,265 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:48:49,275 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:49" (1/1) ... [2019-01-14 02:48:49,286 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:49" (1/1) ... [2019-01-14 02:48:49,309 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:48:49,309 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:48:49,309 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:48:49,309 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:48:49,320 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:49" (1/1) ... [2019-01-14 02:48:49,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:49" (1/1) ... [2019-01-14 02:48:49,322 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:49" (1/1) ... [2019-01-14 02:48:49,322 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:49" (1/1) ... [2019-01-14 02:48:49,329 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:49" (1/1) ... [2019-01-14 02:48:49,333 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:49" (1/1) ... [2019-01-14 02:48:49,334 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:49" (1/1) ... [2019-01-14 02:48:49,337 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:48:49,338 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:48:49,343 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:48:49,344 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:48:49,345 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:48:49,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:48:49,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 02:48:49,469 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-01-14 02:48:49,469 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-01-14 02:48:49,469 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-01-14 02:48:49,469 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-01-14 02:48:49,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:48:49,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:48:49,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:48:49,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:48:49,765 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:48:49,765 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-14 02:48:49,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:48:49 BoogieIcfgContainer [2019-01-14 02:48:49,767 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:48:49,768 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:48:49,768 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:48:49,772 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:48:49,773 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:48:49,773 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:48:48" (1/3) ... [2019-01-14 02:48:49,774 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2f4f3696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:48:49, skipping insertion in model container [2019-01-14 02:48:49,774 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:48:49,774 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:49" (2/3) ... [2019-01-14 02:48:49,776 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2f4f3696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:48:49, skipping insertion in model container [2019-01-14 02:48:49,776 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:48:49,776 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:48:49" (3/3) ... [2019-01-14 02:48:49,778 INFO L375 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex7B_true-termination.c.i [2019-01-14 02:48:49,840 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:48:49,840 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:48:49,841 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:48:49,841 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:48:49,841 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:48:49,841 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:48:49,841 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:48:49,841 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:48:49,841 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:48:49,857 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-01-14 02:48:49,882 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:48:49,882 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:48:49,882 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:48:49,889 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 02:48:49,889 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 02:48:49,890 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:48:49,890 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-01-14 02:48:49,891 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:48:49,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:48:49,892 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:48:49,892 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 02:48:49,892 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 02:48:49,898 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~nondet8, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(4);main_~p1~0.base, main_~p1~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(4);main_~p2~0.base, main_~p2~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~p1~0.base, main_~p1~0.offset, 4);havoc main_#t~nondet7;call write~int(main_#t~nondet8, main_~p2~0.base, main_~p2~0.offset, 4);havoc main_#t~nondet8; 11#L43true call f(main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset);< 13#fENTRYtrue [2019-01-14 02:48:49,899 INFO L796 eck$LassoCheckResult]: Loop: 13#fENTRYtrue ~p.base, ~p.offset := #in~p.base, #in~p.offset;~q.base, ~q.offset := #in~q.base, #in~q.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4);call #t~mem2 := read~int(~q.base, ~q.offset, 4); 15#L13true assume !(#t~mem1 + #t~mem2 < 0);havoc #t~mem2;havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~np~0.base, ~np~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);call write~int(#t~mem4 - 1, ~np~0.base, ~np~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~p.base, ~p.offset); 17#L23true call g(~q.base, ~q.offset, ~np~0.base, ~np~0.offset);< 12#gENTRYtrue ~p.base, ~p.offset := #in~p.base, #in~p.offset;~q.base, ~q.offset := #in~q.base, #in~q.offset; 5#L31true call f(~q.base, ~q.offset, ~p.base, ~p.offset);< 13#fENTRYtrue [2019-01-14 02:48:49,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:49,905 INFO L82 PathProgramCache]: Analyzing trace with hash 39794, now seen corresponding path program 1 times [2019-01-14 02:48:49,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:49,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:49,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:49,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:48:49,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:50,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:50,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:50,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:50,061 INFO L82 PathProgramCache]: Analyzing trace with hash 28764888, now seen corresponding path program 1 times [2019-01-14 02:48:50,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:50,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:50,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:50,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:48:50,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:50,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:50,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:50,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:50,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1102237191, now seen corresponding path program 1 times [2019-01-14 02:48:50,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:50,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:50,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:50,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:48:50,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:50,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:50,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:50,385 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-01-14 02:48:50,689 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-01-14 02:48:51,480 WARN L181 SmtUtils]: Spent 738.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 83 [2019-01-14 02:48:51,621 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-01-14 02:48:51,913 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-01-14 02:48:52,245 WARN L181 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-01-14 02:48:52,476 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-01-14 02:48:52,575 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:48:52,576 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:48:52,576 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:48:52,577 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:48:52,578 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:48:52,578 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:48:52,579 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:48:52,579 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:48:52,579 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex7B_true-termination.c.i_Iteration1_Lasso [2019-01-14 02:48:52,579 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:48:52,581 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:48:52,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:52,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:52,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:52,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:52,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:52,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:52,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:52,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:52,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:52,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:52,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:52,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:52,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:52,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:52,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:52,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:52,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:52,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:52,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:52,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:52,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:52,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:52,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:52,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:52,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:52,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:52,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:52,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:52,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:52,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:52,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:52,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:53,047 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-01-14 02:48:53,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:53,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:53,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:53,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:53,853 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:48:53,859 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:48:53,861 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:53,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:53,863 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:53,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:53,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:53,864 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:53,866 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:53,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:53,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:53,869 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:53,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:53,870 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:53,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:53,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:53,871 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:53,871 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:53,871 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:53,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:53,872 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:53,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:53,873 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:53,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:53,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:53,874 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:53,874 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:53,874 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:53,875 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:53,876 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:53,876 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:53,876 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:53,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:53,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:53,877 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:53,878 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:53,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:53,879 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:53,879 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:53,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:53,880 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:53,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:53,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:53,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:53,881 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:53,881 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:53,882 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:53,883 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:53,883 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:53,884 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:53,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:53,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:53,884 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:53,884 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:53,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:53,885 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:53,886 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:53,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:53,886 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:53,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:53,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:53,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:53,887 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:53,887 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:53,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:53,889 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:53,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:53,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:53,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:53,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:53,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:53,890 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:53,890 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:53,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:53,892 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:53,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:53,892 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:53,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:53,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:53,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:53,894 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:53,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:53,895 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:53,896 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:53,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:53,896 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:53,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:53,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:53,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:53,897 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:53,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:53,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:53,899 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:53,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:53,900 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:53,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:53,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:53,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:53,901 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:53,901 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:53,902 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:53,902 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:53,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:53,903 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:53,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:53,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:53,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:53,904 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:53,904 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:53,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:53,905 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:53,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:53,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:53,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:53,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:53,909 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:53,909 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:53,913 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:53,913 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:53,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:53,914 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:53,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:53,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:53,915 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:53,915 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:53,915 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:53,916 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:53,917 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:53,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:53,918 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:53,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:53,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:53,918 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:53,919 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:53,919 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:53,921 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:53,922 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:53,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:53,922 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:53,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:53,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:53,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:53,925 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:53,925 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:53,928 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:53,930 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:53,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:53,931 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:53,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:53,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:53,932 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:53,932 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:53,932 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:53,933 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:53,934 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:53,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:53,937 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:53,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:53,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:53,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:53,938 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:53,938 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:53,939 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:53,940 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:53,940 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:53,940 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:53,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:53,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:53,942 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:53,943 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:53,943 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:53,945 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:53,945 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:53,946 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:53,946 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:53,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:53,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:53,947 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:53,950 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:53,950 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:53,957 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:53,957 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:53,958 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:53,958 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:53,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:53,959 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:53,959 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:53,960 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:53,960 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:53,961 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:53,961 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:53,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:53,965 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:53,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:53,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:53,966 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:53,966 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:53,966 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:53,967 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:53,972 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:53,972 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:53,973 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:53,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:53,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:53,973 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:53,974 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:53,974 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:53,975 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:53,975 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:53,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:53,981 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:53,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:53,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:53,982 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:53,983 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:53,983 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:53,985 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:53,986 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:53,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:53,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:53,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:53,989 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:53,992 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:53,993 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:53,998 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:53,999 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:54,002 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:54,002 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:54,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:54,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:54,003 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:54,003 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:54,003 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:54,013 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:54,013 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:54,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:54,014 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:54,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:54,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:54,014 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:54,017 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:54,018 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:54,019 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:54,019 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:54,020 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:54,022 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:54,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:54,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:54,024 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:54,024 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:54,025 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:54,026 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:54,028 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:54,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:54,034 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:54,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:54,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:54,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:54,035 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:54,035 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:54,040 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:54,041 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:54,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:54,043 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:54,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:54,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:54,044 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:54,044 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:54,044 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:54,047 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:54,047 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:54,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:54,048 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:54,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:54,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:54,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:54,049 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:54,049 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:54,050 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:54,053 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:54,054 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:54,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:54,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:54,054 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:54,059 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:54,059 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:54,117 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:48:54,136 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:48:54,136 INFO L444 ModelExtractionUtils]: 12 out of 16 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:48:54,139 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:48:54,141 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:48:54,142 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:48:54,142 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int f_#in~p.base) f_#in~p.offset)_1, v_rep(select (select #memory_int f_#in~q.base) f_#in~q.offset)_1) = 2*v_rep(select (select #memory_int f_#in~p.base) f_#in~p.offset)_1 + 2*v_rep(select (select #memory_int f_#in~q.base) f_#in~q.offset)_1 + 1 Supporting invariants [] [2019-01-14 02:48:54,157 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-14 02:48:54,165 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:48:54,166 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:48:54,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:54,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:54,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:48:54,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:54,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:48:54,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:48:54,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:48:54,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-14 02:48:54,366 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 02:48:54,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 61 [2019-01-14 02:48:54,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 53 [2019-01-14 02:48:54,454 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 02:48:54,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:48:54,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 53 [2019-01-14 02:48:54,570 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-01-14 02:48:54,597 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:48:54,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-14 02:48:54,649 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:59, output treesize:87 [2019-01-14 02:48:54,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:48:54,836 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2019-01-14 02:48:54,837 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 6 states. [2019-01-14 02:48:55,156 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 6 states. Result 32 states and 36 transitions. Complement of second has 20 states. [2019-01-14 02:48:55,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2019-01-14 02:48:55,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 02:48:55,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2019-01-14 02:48:55,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. Stem has 3 letters. Loop has 5 letters. [2019-01-14 02:48:55,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:48:55,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. Stem has 8 letters. Loop has 5 letters. [2019-01-14 02:48:55,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:48:55,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. Stem has 3 letters. Loop has 10 letters. [2019-01-14 02:48:55,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:48:55,164 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 36 transitions. [2019-01-14 02:48:55,168 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:48:55,170 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 0 states and 0 transitions. [2019-01-14 02:48:55,171 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:48:55,171 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:48:55,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:48:55,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:48:55,172 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:48:55,172 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:48:55,172 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:48:55,172 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:48:55,172 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:48:55,172 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:48:55,173 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:48:55,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:48:55 BoogieIcfgContainer [2019-01-14 02:48:55,179 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:48:55,179 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:48:55,179 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:48:55,180 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:48:55,181 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:48:49" (3/4) ... [2019-01-14 02:48:55,184 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:48:55,184 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:48:55,185 INFO L168 Benchmark]: Toolchain (without parser) took 6222.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 206.0 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -118.8 MB). Peak memory consumption was 87.2 MB. Max. memory is 11.5 GB. [2019-01-14 02:48:55,186 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:48:55,187 INFO L168 Benchmark]: CACSL2BoogieTranslator took 299.35 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:48:55,188 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.26 ms. Allocated memory is still 1.0 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:48:55,188 INFO L168 Benchmark]: Boogie Preprocessor took 28.13 ms. Allocated memory is still 1.0 GB. Free memory was 941.9 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-14 02:48:55,189 INFO L168 Benchmark]: RCFGBuilder took 429.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -183.1 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2019-01-14 02:48:55,190 INFO L168 Benchmark]: BuchiAutomizer took 5411.06 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 61.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.2 MB). Peak memory consumption was 110.0 MB. Max. memory is 11.5 GB. [2019-01-14 02:48:55,191 INFO L168 Benchmark]: Witness Printer took 4.87 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:48:55,198 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 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 299.35 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.26 ms. Allocated memory is still 1.0 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.13 ms. Allocated memory is still 1.0 GB. Free memory was 941.9 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 429.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -183.1 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5411.06 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 61.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.2 MB). Peak memory consumption was 110.0 MB. Max. memory is 11.5 GB. * Witness Printer took 4.87 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. * 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 2 * unknown-#memory_int-unknown[p][p] + 2 * unknown-#memory_int-unknown[q][q] + 1 and consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.3s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 4.2s. Construction of modules took 0.1s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 6 SDtfs, 5 SDslu, 5 SDs, 0 SdLazy, 41 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital209 mio100 ax100 hnf100 lsp97 ukn71 mio100 lsp25 div100 bol100 ite100 ukn100 eq186 hnf88 smp100 dnf147 smp93 tf100 neg88 sie148 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...