./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-linkedlists/cll_by_lseg_traverse-alloca_false-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e 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-linkedlists/cll_by_lseg_traverse-alloca_false-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 65da722a2ea59f5974c3b0082ca57aa0ffbedb9a ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:21:52,966 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:21:52,968 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:21:52,988 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:21:52,989 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:21:52,990 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:21:52,991 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:21:52,993 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:21:52,996 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:21:53,002 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:21:53,004 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:21:53,006 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:21:53,007 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:21:53,007 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:21:53,011 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:21:53,012 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:21:53,013 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:21:53,017 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:21:53,022 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:21:53,024 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:21:53,025 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:21:53,027 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:21:53,033 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:21:53,033 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:21:53,033 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:21:53,034 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:21:53,037 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:21:53,038 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:21:53,038 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:21:53,043 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:21:53,043 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:21:53,046 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:21:53,047 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:21:53,047 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:21:53,048 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:21:53,049 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:21:53,049 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 23:21:53,078 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:21:53,078 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:21:53,083 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:21:53,083 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:21:53,085 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:21:53,085 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:21:53,085 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:21:53,085 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:21:53,085 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:21:53,086 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:21:53,086 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:21:53,086 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:21:53,086 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:21:53,086 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:21:53,086 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:21:53,087 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:21:53,087 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:21:53,088 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:21:53,088 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:21:53,088 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:21:53,088 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:21:53,088 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:21:53,089 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:21:53,089 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:21:53,089 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:21:53,089 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:21:53,089 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:21:53,090 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:21:53,091 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:21:53,091 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 -> 65da722a2ea59f5974c3b0082ca57aa0ffbedb9a [2018-11-28 23:21:53,154 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:21:53,169 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:21:53,174 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:21:53,175 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:21:53,176 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:21:53,177 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-linkedlists/cll_by_lseg_traverse-alloca_false-termination.c.i [2018-11-28 23:21:53,232 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d84187c3c/ddccec1d12314fbc8fe4e30cef5e7c7a/FLAG87324be0a [2018-11-28 23:21:53,691 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:21:53,692 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-linkedlists/cll_by_lseg_traverse-alloca_false-termination.c.i [2018-11-28 23:21:53,708 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d84187c3c/ddccec1d12314fbc8fe4e30cef5e7c7a/FLAG87324be0a [2018-11-28 23:21:54,004 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d84187c3c/ddccec1d12314fbc8fe4e30cef5e7c7a [2018-11-28 23:21:54,009 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:21:54,011 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:21:54,012 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:21:54,012 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:21:54,016 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:21:54,017 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:21:54" (1/1) ... [2018-11-28 23:21:54,021 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69b6dfdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:54, skipping insertion in model container [2018-11-28 23:21:54,021 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:21:54" (1/1) ... [2018-11-28 23:21:54,030 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:21:54,095 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:21:54,472 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:21:54,499 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:21:54,587 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:21:54,665 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:21:54,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:54 WrapperNode [2018-11-28 23:21:54,666 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:21:54,666 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:21:54,667 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:21:54,667 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:21:54,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:54" (1/1) ... [2018-11-28 23:21:54,779 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:54" (1/1) ... [2018-11-28 23:21:54,808 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:21:54,809 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:21:54,809 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:21:54,809 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:21:54,822 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:54" (1/1) ... [2018-11-28 23:21:54,822 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:54" (1/1) ... [2018-11-28 23:21:54,830 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:54" (1/1) ... [2018-11-28 23:21:54,833 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:54" (1/1) ... [2018-11-28 23:21:54,850 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:54" (1/1) ... [2018-11-28 23:21:54,855 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:54" (1/1) ... [2018-11-28 23:21:54,857 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:54" (1/1) ... [2018-11-28 23:21:54,865 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:21:54,868 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:21:54,869 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:21:54,869 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:21:54,870 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:54" (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 [2018-11-28 23:21:54,946 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:21:54,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:21:54,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 23:21:54,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 23:21:54,947 INFO L130 BoogieDeclarations]: Found specification of procedure new_lseg [2018-11-28 23:21:54,947 INFO L138 BoogieDeclarations]: Found implementation of procedure new_lseg [2018-11-28 23:21:54,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:21:54,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:21:55,406 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:21:55,406 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-11-28 23:21:55,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:21:55 BoogieIcfgContainer [2018-11-28 23:21:55,407 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:21:55,407 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:21:55,408 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:21:55,412 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:21:55,413 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:21:55,413 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:21:54" (1/3) ... [2018-11-28 23:21:55,414 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5206bc18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:21:55, skipping insertion in model container [2018-11-28 23:21:55,414 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:21:55,414 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:54" (2/3) ... [2018-11-28 23:21:55,417 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5206bc18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:21:55, skipping insertion in model container [2018-11-28 23:21:55,417 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:21:55,417 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:21:55" (3/3) ... [2018-11-28 23:21:55,421 INFO L375 chiAutomizerObserver]: Analyzing ICFG cll_by_lseg_traverse-alloca_false-termination.c.i [2018-11-28 23:21:55,497 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:21:55,498 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:21:55,498 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:21:55,498 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:21:55,499 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:21:55,499 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:21:55,499 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:21:55,499 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:21:55,499 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:21:55,517 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-28 23:21:55,557 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-28 23:21:55,557 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:21:55,557 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:21:55,567 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 23:21:55,568 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:21:55,568 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:21:55,569 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-28 23:21:55,572 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-28 23:21:55,573 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:21:55,573 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:21:55,573 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 23:21:55,573 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:21:55,583 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~ret8.base, main_#t~ret8.offset, main_~n~0, main_~x~2.base, main_~x~2.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 12#L572true assume !(main_~n~0 < 1);new_cll_#in~n := main_~n~0;havoc new_cll_#res.base, new_cll_#res.offset;havoc new_cll_#t~malloc4.base, new_cll_#t~malloc4.offset, new_cll_#t~ret5.base, new_cll_#t~ret5.offset, new_cll_~n, new_cll_~x~1.base, new_cll_~x~1.offset;new_cll_~n := new_cll_#in~n;call new_cll_#t~malloc4.base, new_cll_#t~malloc4.offset := #Ultimate.alloc(12);new_cll_~x~1.base, new_cll_~x~1.offset := new_cll_#t~malloc4.base, new_cll_#t~malloc4.offset;call write~int(new_cll_~n, new_cll_~x~1.base, new_cll_~x~1.offset, 4); 18#L559true call new_cll_#t~ret5.base, new_cll_#t~ret5.offset := new_lseg(new_cll_~x~1.base, new_cll_~x~1.offset, new_cll_~n - 1);< 14#new_lsegENTRYtrue [2018-11-28 23:21:55,583 INFO L796 eck$LassoCheckResult]: Loop: 14#new_lsegENTRYtrue ~p.base, ~p.offset := #in~p.base, #in~p.offset;~n := #in~n; 10#L548true assume !(0 == ~n);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(~n, ~x~0.base, ~x~0.offset, 4); 15#L552true call #t~ret3.base, #t~ret3.offset := new_lseg(~p.base, ~p.offset, ~n - 1);< 14#new_lsegENTRYtrue [2018-11-28 23:21:55,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:55,592 INFO L82 PathProgramCache]: Analyzing trace with hash 925696, now seen corresponding path program 1 times [2018-11-28 23:21:55,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:55,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:55,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:55,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:21:55,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:55,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:55,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:55,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:55,786 INFO L82 PathProgramCache]: Analyzing trace with hash 57729, now seen corresponding path program 1 times [2018-11-28 23:21:55,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:55,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:55,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:55,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:21:55,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:55,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:55,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:55,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:55,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1807633698, now seen corresponding path program 1 times [2018-11-28 23:21:55,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:55,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:55,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:55,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:21:55,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:55,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:55,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:56,345 WARN L180 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2018-11-28 23:21:56,629 WARN L180 SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2018-11-28 23:21:56,775 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-28 23:21:57,126 WARN L180 SmtUtils]: Spent 335.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2018-11-28 23:21:57,297 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-11-28 23:21:57,590 WARN L180 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 79 [2018-11-28 23:21:57,738 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2018-11-28 23:21:57,972 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2018-11-28 23:21:58,065 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:21:58,066 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:21:58,067 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:21:58,067 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:21:58,067 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:21:58,067 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:21:58,067 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:21:58,068 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:21:58,068 INFO L131 ssoRankerPreferences]: Filename of dumped script: cll_by_lseg_traverse-alloca_false-termination.c.i_Iteration1_Lasso [2018-11-28 23:21:58,068 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:21:58,068 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:21:58,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:58,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:58,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:58,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:58,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:58,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:58,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:58,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:58,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:58,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:58,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:58,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:58,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:58,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:58,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:58,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:58,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:58,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:58,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:58,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:58,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:58,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:58,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:58,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:58,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:58,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:58,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:58,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:58,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:58,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:58,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:58,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:58,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:58,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:58,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:58,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:58,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:58,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:58,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:58,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:58,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:58,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:58,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:58,972 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:21:58,977 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:21:58,979 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:58,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:58,982 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:58,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:58,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:58,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:58,985 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:58,985 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:58,990 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:58,991 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:58,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:58,991 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:58,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:58,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:58,993 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:58,994 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:58,994 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:58,995 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:58,996 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:58,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:58,997 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:58,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:58,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:58,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:58,998 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:58,998 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:59,000 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:59,001 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:59,002 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:59,002 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:59,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:59,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:59,002 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:59,003 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:59,003 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:59,006 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:59,007 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:59,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:59,008 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:59,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:59,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:59,008 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:59,010 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:59,011 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:59,012 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:59,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 [2018-11-28 23:21:59,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:59,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:59,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:59,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:59,016 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:59,017 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:59,017 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:59,018 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:59,020 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:59,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:59,021 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:59,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:59,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:59,021 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:59,023 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:59,024 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:59,024 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:59,025 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:59,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:59,026 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:59,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:59,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:59,026 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:59,027 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:59,027 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:59,029 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:59,029 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:59,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:59,031 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:59,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:59,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:59,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:59,032 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:59,032 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:59,033 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:59,033 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:59,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:59,035 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:59,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:59,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:59,036 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:59,037 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:59,037 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:59,038 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:59,038 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:59,039 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:59,039 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:59,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:59,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:59,039 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:59,042 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:59,042 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:59,043 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:59,044 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:59,044 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:59,044 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:59,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:59,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:59,045 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:59,045 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:59,045 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:59,046 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:59,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 [2018-11-28 23:21:59,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:59,047 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:59,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:59,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:59,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:59,048 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:59,048 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:59,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:59,050 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:59,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:59,050 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:59,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:59,051 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:59,051 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:59,051 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:59,052 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:59,053 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:59,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 [2018-11-28 23:21:59,054 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:59,054 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:59,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:59,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:59,054 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:59,055 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:59,055 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:59,056 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:59,056 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:59,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:59,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:59,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:59,057 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:59,059 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:59,060 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:59,063 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:59,064 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:59,065 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:59,065 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:59,065 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:59,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:59,065 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:59,066 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:59,066 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:59,067 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:59,068 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:59,068 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:59,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:59,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:59,069 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:59,071 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:59,072 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:59,086 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:59,087 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:59,087 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:59,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:59,088 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:59,088 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:59,091 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:59,091 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:59,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:59,099 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:59,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:59,101 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:21:59,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:59,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:59,104 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:21:59,105 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:59,115 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:59,116 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:59,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:59,117 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:59,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:59,117 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:59,121 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:59,121 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:59,134 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:59,135 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:59,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:59,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:59,137 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:21:59,137 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:59,147 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-28 23:21:59,147 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-28 23:21:59,333 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:21:59,380 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:21:59,381 INFO L444 ModelExtractionUtils]: 17 out of 21 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:21:59,384 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:21:59,392 INFO L440 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2018-11-28 23:21:59,394 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:21:59,395 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(new_lseg_#in~n) = 1*new_lseg_#in~n Supporting invariants [1*new_lseg_#in~n >= 0] [2018-11-28 23:21:59,425 INFO L297 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2018-11-28 23:21:59,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:59,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:21:59,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:21:59,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:21:59,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:21:59,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:21:59,792 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-28 23:21:59,794 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 5 states. [2018-11-28 23:22:00,061 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 5 states. Result 35 states and 41 transitions. Complement of second has 13 states. [2018-11-28 23:22:00,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:22:00,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:22:00,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2018-11-28 23:22:00,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 4 letters. Loop has 3 letters. [2018-11-28 23:22:00,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:22:00,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-28 23:22:00,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:22:00,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 4 letters. Loop has 6 letters. [2018-11-28 23:22:00,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:22:00,070 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 41 transitions. [2018-11-28 23:22:00,076 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-28 23:22:00,085 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 22 states and 27 transitions. [2018-11-28 23:22:00,087 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-28 23:22:00,088 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-28 23:22:00,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 27 transitions. [2018-11-28 23:22:00,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:22:00,089 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-11-28 23:22:00,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 27 transitions. [2018-11-28 23:22:00,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2018-11-28 23:22:00,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-28 23:22:00,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-11-28 23:22:00,165 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-28 23:22:00,165 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-28 23:22:00,165 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:22:00,166 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2018-11-28 23:22:00,168 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-28 23:22:00,168 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:22:00,168 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:22:00,169 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:22:00,169 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-28 23:22:00,171 INFO L794 eck$LassoCheckResult]: Stem: 132#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 130#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~ret8.base, main_#t~ret8.offset, main_~n~0, main_~x~2.base, main_~x~2.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 131#L572 assume !(main_~n~0 < 1);new_cll_#in~n := main_~n~0;havoc new_cll_#res.base, new_cll_#res.offset;havoc new_cll_#t~malloc4.base, new_cll_#t~malloc4.offset, new_cll_#t~ret5.base, new_cll_#t~ret5.offset, new_cll_~n, new_cll_~x~1.base, new_cll_~x~1.offset;new_cll_~n := new_cll_#in~n;call new_cll_#t~malloc4.base, new_cll_#t~malloc4.offset := #Ultimate.alloc(12);new_cll_~x~1.base, new_cll_~x~1.offset := new_cll_#t~malloc4.base, new_cll_#t~malloc4.offset;call write~int(new_cll_~n, new_cll_~x~1.base, new_cll_~x~1.offset, 4); 136#L559 call new_cll_#t~ret5.base, new_cll_#t~ret5.offset := new_lseg(new_cll_~x~1.base, new_cll_~x~1.offset, new_cll_~n - 1);< 137#new_lsegENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~n := #in~n; 138#L548 assume 0 == ~n;#res.base, #res.offset := ~p.base, ~p.offset; 143#new_lsegFINAL assume true; 141#new_lsegEXIT >#37#return; 127#L559-1 call write~$Pointer$(new_cll_#t~ret5.base, new_cll_#t~ret5.offset, new_cll_~x~1.base, 4 + new_cll_~x~1.offset, 8);havoc new_cll_#t~ret5.base, new_cll_#t~ret5.offset;new_cll_#res.base, new_cll_#res.offset := new_cll_~x~1.base, new_cll_~x~1.offset; 128#L560 main_#t~ret8.base, main_#t~ret8.offset := new_cll_#res.base, new_cll_#res.offset;main_~x~2.base, main_~x~2.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset;traverse_#in~head.base, traverse_#in~head.offset := main_~x~2.base, main_~x~2.offset;havoc traverse_#t~mem6.base, traverse_#t~mem6.offset, traverse_~head.base, traverse_~head.offset, traverse_~curr~0.base, traverse_~curr~0.offset;traverse_~head.base, traverse_~head.offset := traverse_#in~head.base, traverse_#in~head.offset;traverse_~curr~0.base, traverse_~curr~0.offset := traverse_~head.base, traverse_~head.offset; 133#L565-2 [2018-11-28 23:22:00,171 INFO L796 eck$LassoCheckResult]: Loop: 133#L565-2 assume !!(traverse_~curr~0.base != 0 || traverse_~curr~0.offset != 0);call traverse_#t~mem6.base, traverse_#t~mem6.offset := read~$Pointer$(traverse_~curr~0.base, 4 + traverse_~curr~0.offset, 8);traverse_~curr~0.base, traverse_~curr~0.offset := traverse_#t~mem6.base, traverse_#t~mem6.offset;havoc traverse_#t~mem6.base, traverse_#t~mem6.offset; 133#L565-2 [2018-11-28 23:22:00,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:22:00,173 INFO L82 PathProgramCache]: Analyzing trace with hash 914562823, now seen corresponding path program 1 times [2018-11-28 23:22:00,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:22:00,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:22:00,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:00,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:22:00,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:00,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:00,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:00,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:22:00,213 INFO L82 PathProgramCache]: Analyzing trace with hash 51, now seen corresponding path program 1 times [2018-11-28 23:22:00,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:22:00,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:22:00,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:00,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:22:00,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:00,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:00,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:00,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:22:00,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1713323539, now seen corresponding path program 1 times [2018-11-28 23:22:00,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:22:00,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:22:00,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:00,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:22:00,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:00,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:00,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:00,647 WARN L180 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-11-28 23:22:01,404 WARN L180 SmtUtils]: Spent 662.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 141 [2018-11-28 23:22:01,423 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 23:22:01,446 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 23:22:01,571 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 23:22:01,587 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 23:22:01,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 23:22:01,691 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:160, output treesize:136 [2018-11-28 23:22:01,810 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2018-11-28 23:22:01,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:22:01 BoogieIcfgContainer [2018-11-28 23:22:01,846 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:22:01,846 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:22:01,847 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:22:01,847 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:22:01,847 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:21:55" (3/4) ... [2018-11-28 23:22:01,852 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-28 23:22:01,953 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 23:22:01,953 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:22:01,957 INFO L168 Benchmark]: Toolchain (without parser) took 7944.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 201.9 MB). Free memory was 951.3 MB in the beginning and 1.0 GB in the end (delta: -72.1 MB). Peak memory consumption was 129.8 MB. Max. memory is 11.5 GB. [2018-11-28 23:22:01,958 INFO L168 Benchmark]: CDTParser took 0.18 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. [2018-11-28 23:22:01,958 INFO L168 Benchmark]: CACSL2BoogieTranslator took 654.52 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 924.5 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-28 23:22:01,959 INFO L168 Benchmark]: Boogie Procedure Inliner took 142.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 924.5 MB in the beginning and 1.1 GB in the end (delta: -189.2 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. [2018-11-28 23:22:01,960 INFO L168 Benchmark]: Boogie Preprocessor took 58.32 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. [2018-11-28 23:22:01,961 INFO L168 Benchmark]: RCFGBuilder took 538.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2018-11-28 23:22:01,962 INFO L168 Benchmark]: BuchiAutomizer took 6438.68 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 76.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 71.7 MB). Peak memory consumption was 148.2 MB. Max. memory is 11.5 GB. [2018-11-28 23:22:01,963 INFO L168 Benchmark]: Witness Printer took 106.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2018-11-28 23:22:01,970 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.18 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 654.52 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 924.5 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 142.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 924.5 MB in the beginning and 1.1 GB in the end (delta: -189.2 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 58.32 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 538.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6438.68 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 76.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 71.7 MB). Peak memory consumption was 148.2 MB. Max. memory is 11.5 GB. * Witness Printer took 106.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * 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) and one nonterminating remainder module.One deterministic module has affine ranking function \old(n) and consists of 5 locations. The remainder module has 20 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.3s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 5.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 20 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 9 SDtfs, 11 SDslu, 7 SDs, 0 SdLazy, 18 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital191 mio100 ax100 hnf100 lsp93 ukn43 mio100 lsp32 div100 bol100 ite100 ukn100 eq196 hnf91 smp100 dnf139 smp100 tf100 neg96 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 259ms VariablesStem: 3 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 565]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2c46a616=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@54b92ff0=0, curr=2, \result=0, x=0, x=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@10e352fe=0, x=2, \old(n)=1, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@788070aa=0, x=2, head=0, head=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2c46a616=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@425ffdc7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@788070aa=2, n=1, head=0, head=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@425ffdc7=0, NULL=0, n=1, \result=2, curr=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@54b92ff0=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 565]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L571] int n = __VERIFIER_nondet_int(); [L572] COND FALSE !(n < 1) [L557] node_t* x = malloc(sizeof(node_t)); [L558] x->val = n [L559] CALL, EXPR new_lseg(x,n-1) [L548] COND TRUE n==0 [L549] return p; [L559] RET, EXPR new_lseg(x,n-1) [L559] x->next = new_lseg(x,n-1) [L560] return x; [L575] node_t* x = new_cll(n); [L564] node_t* curr = head; Loop: [L565] COND TRUE curr != ((void *)0) [L566] EXPR curr->next [L566] curr = curr->next End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...