./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-linkedlists/cll_by_lseg_traverse-alloca_false-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_6deb143c-1563-4289-9f80-3cbc306d3855/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6deb143c-1563-4289-9f80-3cbc306d3855/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6deb143c-1563-4289-9f80-3cbc306d3855/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6deb143c-1563-4289-9f80-3cbc306d3855/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-linkedlists/cll_by_lseg_traverse-alloca_false-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_6deb143c-1563-4289-9f80-3cbc306d3855/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6deb143c-1563-4289-9f80-3cbc306d3855/bin-2019/uautomizer --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.23-1dbac8b [2018-11-10 00:47:47,285 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 00:47:47,286 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 00:47:47,294 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 00:47:47,294 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 00:47:47,295 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 00:47:47,296 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 00:47:47,297 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 00:47:47,298 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 00:47:47,298 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 00:47:47,299 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 00:47:47,299 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 00:47:47,300 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 00:47:47,301 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 00:47:47,301 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 00:47:47,302 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 00:47:47,302 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 00:47:47,304 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 00:47:47,305 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 00:47:47,306 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 00:47:47,307 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 00:47:47,308 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 00:47:47,309 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 00:47:47,309 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 00:47:47,310 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 00:47:47,310 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 00:47:47,311 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 00:47:47,311 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 00:47:47,312 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 00:47:47,313 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 00:47:47,313 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 00:47:47,314 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 00:47:47,314 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 00:47:47,314 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 00:47:47,315 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 00:47:47,315 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 00:47:47,315 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6deb143c-1563-4289-9f80-3cbc306d3855/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 00:47:47,327 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 00:47:47,327 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 00:47:47,328 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 00:47:47,328 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 00:47:47,328 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 00:47:47,328 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 00:47:47,328 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 00:47:47,328 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 00:47:47,329 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 00:47:47,329 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 00:47:47,329 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 00:47:47,329 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 00:47:47,329 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 00:47:47,329 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 00:47:47,329 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 00:47:47,329 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 00:47:47,330 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 00:47:47,330 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 00:47:47,330 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 00:47:47,330 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 00:47:47,330 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 00:47:47,330 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 00:47:47,330 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 00:47:47,330 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 00:47:47,331 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 00:47:47,331 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 00:47:47,331 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 00:47:47,331 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 00:47:47,332 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_6deb143c-1563-4289-9f80-3cbc306d3855/bin-2019/uautomizer 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-10 00:47:47,353 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 00:47:47,361 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 00:47:47,364 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 00:47:47,365 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 00:47:47,365 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 00:47:47,365 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6deb143c-1563-4289-9f80-3cbc306d3855/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-linkedlists/cll_by_lseg_traverse-alloca_false-termination.c.i [2018-11-10 00:47:47,401 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6deb143c-1563-4289-9f80-3cbc306d3855/bin-2019/uautomizer/data/cca3ed3c0/146d127710744ae9a31c80dc93ae9cc9/FLAGb8e2ddcc0 [2018-11-10 00:47:47,833 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 00:47:47,834 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6deb143c-1563-4289-9f80-3cbc306d3855/sv-benchmarks/c/termination-memory-linkedlists/cll_by_lseg_traverse-alloca_false-termination.c.i [2018-11-10 00:47:47,840 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6deb143c-1563-4289-9f80-3cbc306d3855/bin-2019/uautomizer/data/cca3ed3c0/146d127710744ae9a31c80dc93ae9cc9/FLAGb8e2ddcc0 [2018-11-10 00:47:47,852 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6deb143c-1563-4289-9f80-3cbc306d3855/bin-2019/uautomizer/data/cca3ed3c0/146d127710744ae9a31c80dc93ae9cc9 [2018-11-10 00:47:47,854 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 00:47:47,855 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 00:47:47,855 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 00:47:47,855 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 00:47:47,858 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 00:47:47,859 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:47:47" (1/1) ... [2018-11-10 00:47:47,861 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19c38c2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:47:47, skipping insertion in model container [2018-11-10 00:47:47,861 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:47:47" (1/1) ... [2018-11-10 00:47:47,869 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 00:47:47,898 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 00:47:48,094 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 00:47:48,102 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 00:47:48,129 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 00:47:48,162 INFO L193 MainTranslator]: Completed translation [2018-11-10 00:47:48,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:47:48 WrapperNode [2018-11-10 00:47:48,163 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 00:47:48,163 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 00:47:48,163 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 00:47:48,163 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 00:47:48,171 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:47:48" (1/1) ... [2018-11-10 00:47:48,222 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:47:48" (1/1) ... [2018-11-10 00:47:48,236 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 00:47:48,237 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 00:47:48,237 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 00:47:48,237 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 00:47:48,242 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:47:48" (1/1) ... [2018-11-10 00:47:48,242 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:47:48" (1/1) ... [2018-11-10 00:47:48,244 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:47:48" (1/1) ... [2018-11-10 00:47:48,244 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:47:48" (1/1) ... [2018-11-10 00:47:48,247 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:47:48" (1/1) ... [2018-11-10 00:47:48,250 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:47:48" (1/1) ... [2018-11-10 00:47:48,251 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:47:48" (1/1) ... [2018-11-10 00:47:48,252 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 00:47:48,253 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 00:47:48,253 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 00:47:48,253 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 00:47:48,253 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:47:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6deb143c-1563-4289-9f80-3cbc306d3855/bin-2019/uautomizer/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-10 00:47:48,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 00:47:48,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-10 00:47:48,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-10 00:47:48,293 INFO L130 BoogieDeclarations]: Found specification of procedure new_lseg [2018-11-10 00:47:48,293 INFO L138 BoogieDeclarations]: Found implementation of procedure new_lseg [2018-11-10 00:47:48,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 00:47:48,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 00:47:48,462 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 00:47:48,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:47:48 BoogieIcfgContainer [2018-11-10 00:47:48,463 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 00:47:48,463 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 00:47:48,463 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 00:47:48,466 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 00:47:48,467 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 00:47:48,467 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 12:47:47" (1/3) ... [2018-11-10 00:47:48,468 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@696ede35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:47:48, skipping insertion in model container [2018-11-10 00:47:48,468 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 00:47:48,468 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:47:48" (2/3) ... [2018-11-10 00:47:48,469 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@696ede35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:47:48, skipping insertion in model container [2018-11-10 00:47:48,469 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 00:47:48,469 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:47:48" (3/3) ... [2018-11-10 00:47:48,470 INFO L375 chiAutomizerObserver]: Analyzing ICFG cll_by_lseg_traverse-alloca_false-termination.c.i [2018-11-10 00:47:48,504 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 00:47:48,505 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 00:47:48,505 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 00:47:48,505 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 00:47:48,505 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 00:47:48,505 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 00:47:48,505 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 00:47:48,505 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 00:47:48,506 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 00:47:48,518 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2018-11-10 00:47:48,539 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-10 00:47:48,540 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 00:47:48,540 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 00:47:48,547 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 00:47:48,547 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 00:47:48,547 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 00:47:48,547 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2018-11-10 00:47:48,549 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-10 00:47:48,549 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 00:47:48,549 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 00:47:48,549 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 00:47:48,550 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 00:47:48,555 INFO L793 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 18#L572true assume !(main_~n~0 < 1);assume { :begin_inline_new_cll } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 12;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];new_cll_#t~malloc4.base, new_cll_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;new_cll_~x~1.base, new_cll_~x~1.offset := new_cll_#t~malloc4.base, new_cll_#t~malloc4.offset; 3#L558true SUMMARY for call write~int(new_cll_~n, new_cll_~x~1.base, new_cll_~x~1.offset + 0, 4); srcloc: L558 6#L558-1true 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);< 20#new_lsegENTRYtrue [2018-11-10 00:47:48,555 INFO L795 eck$LassoCheckResult]: Loop: 20#new_lsegENTRYtrue ~p.base, ~p.offset := #in~p.base, #in~p.offset;~n := #in~n; 15#L548true assume !(~n == 0);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 12;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset; 25#L551true SUMMARY for call write~int(~n, ~x~0.base, ~x~0.offset + 0, 4); srcloc: L551 12#L551-1true call #t~ret3.base, #t~ret3.offset := new_lseg(~p.base, ~p.offset, ~n - 1);< 20#new_lsegENTRYtrue [2018-11-10 00:47:48,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:47:48,559 INFO L82 PathProgramCache]: Analyzing trace with hash 28695751, now seen corresponding path program 1 times [2018-11-10 00:47:48,560 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:47:48,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:47:48,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:47:48,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:47:48,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:47:48,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:47:48,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:47:48,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:47:48,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1943404, now seen corresponding path program 1 times [2018-11-10 00:47:48,655 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:47:48,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:47:48,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:47:48,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:47:48,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:47:48,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:47:48,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:47:48,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:47:48,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1181462834, now seen corresponding path program 1 times [2018-11-10 00:47:48,675 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:47:48,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:47:48,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:47:48,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:47:48,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:47:48,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:47:48,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:47:48,888 WARN L179 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2018-11-10 00:47:49,217 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2018-11-10 00:47:49,375 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 00:47:49,376 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 00:47:49,376 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 00:47:49,376 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 00:47:49,376 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 00:47:49,377 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 00:47:49,377 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 00:47:49,377 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 00:47:49,377 INFO L131 ssoRankerPreferences]: Filename of dumped script: cll_by_lseg_traverse-alloca_false-termination.c.i_Iteration1_Lasso [2018-11-10 00:47:49,377 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 00:47:49,377 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 00:47:49,396 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-10 00:47:49,410 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-10 00:47:49,418 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-10 00:47:49,420 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-10 00:47:49,421 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-10 00:47:49,422 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-10 00:47:49,423 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-10 00:47:49,426 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-10 00:47:49,430 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-10 00:47:49,431 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-10 00:47:49,433 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-10 00:47:49,435 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-10 00:47:49,437 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-10 00:47:49,438 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-10 00:47:49,440 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-10 00:47:49,442 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-10 00:47:49,443 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-10 00:47:49,487 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-10 00:47:49,489 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-10 00:47:49,490 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-10 00:47:49,492 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-10 00:47:49,493 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-10 00:47:49,494 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-10 00:47:49,496 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-10 00:47:49,497 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-10 00:47:49,499 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-10 00:47:49,500 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-10 00:47:49,501 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-10 00:47:49,503 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-10 00:47:49,504 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-10 00:47:49,505 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-10 00:47:49,506 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-10 00:47:49,508 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-10 00:47:49,510 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-10 00:47:49,511 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-10 00:47:49,512 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-10 00:47:49,513 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-10 00:47:49,514 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-10 00:47:49,515 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-10 00:47:49,518 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-10 00:47:49,520 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-10 00:47:49,521 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-10 00:47:49,522 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-10 00:47:49,523 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-10 00:47:49,525 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-10 00:47:49,526 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-10 00:47:49,528 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-10 00:47:49,530 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-10 00:47:49,531 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-10 00:47:49,533 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-10 00:47:49,539 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-10 00:47:49,541 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-10 00:47:49,542 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-10 00:47:49,544 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-10 00:47:49,703 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 00:47:49,706 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 00:47:49,707 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-10 00:47:49,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:47:49,709 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:47:49,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:47:49,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:47:49,709 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:47:49,711 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:47:49,711 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:47:49,713 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:47:49,714 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-10 00:47:49,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:47:49,714 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:47:49,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:47:49,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:47:49,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:47:49,715 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:47:49,715 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:47:49,716 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:47:49,717 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-10 00:47:49,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:47:49,717 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:47:49,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:47:49,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:47:49,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:47:49,718 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:47:49,718 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:47:49,719 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:47:49,719 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-10 00:47:49,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:47:49,720 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:47:49,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:47:49,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:47:49,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:47:49,721 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:47:49,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:47:49,722 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:47:49,722 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-10 00:47:49,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:47:49,722 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:47:49,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:47:49,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:47:49,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:47:49,723 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:47:49,723 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:47:49,724 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:47:49,724 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-10 00:47:49,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:47:49,725 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:47:49,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:47:49,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:47:49,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:47:49,725 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:47:49,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:47:49,726 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:47:49,726 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-10 00:47:49,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:47:49,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:47:49,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:47:49,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:47:49,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:47:49,727 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:47:49,727 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:47:49,728 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:47:49,728 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-10 00:47:49,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:47:49,729 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:47:49,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:47:49,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:47:49,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:47:49,729 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:47:49,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:47:49,730 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:47:49,730 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-10 00:47:49,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:47:49,731 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:47:49,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:47:49,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:47:49,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:47:49,731 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:47:49,731 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:47:49,732 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:47:49,732 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-10 00:47:49,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:47:49,733 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:47:49,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:47:49,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:47:49,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:47:49,734 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:47:49,734 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:47:49,735 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:47:49,735 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-10 00:47:49,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:47:49,736 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:47:49,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:47:49,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:47:49,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:47:49,736 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:47:49,737 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:47:49,737 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:47:49,738 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-10 00:47:49,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:47:49,738 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:47:49,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:47:49,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:47:49,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:47:49,739 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:47:49,739 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:47:49,740 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:47:49,740 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-10 00:47:49,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:47:49,741 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:47:49,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:47:49,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:47:49,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:47:49,741 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:47:49,741 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:47:49,742 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:47:49,742 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-10 00:47:49,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:47:49,743 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:47:49,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:47:49,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:47:49,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:47:49,744 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:47:49,744 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:47:49,745 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:47:49,745 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-10 00:47:49,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:47:49,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:47:49,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:47:49,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:47:49,748 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:47:49,748 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 00:47:49,752 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:47:49,752 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-10 00:47:49,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:47:49,753 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:47:49,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:47:49,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:47:49,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:47:49,755 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:47:49,756 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:47:49,757 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:47:49,757 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-10 00:47:49,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:47:49,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:47:49,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:47:49,758 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:47:49,759 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:47:49,760 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 00:47:49,765 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:47:49,766 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-10 00:47:49,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:47:49,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:47:49,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:47:49,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:47:49,768 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:47:49,768 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 00:47:49,779 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:47:49,780 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-10 00:47:49,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:47:49,780 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 00:47:49,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:47:49,781 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:47:49,782 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 00:47:49,782 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 00:47:49,788 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:47:49,788 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-10 00:47:49,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:47:49,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:47:49,789 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 00:47:49,789 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:47:49,794 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-10 00:47:49,794 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-10 00:47:49,854 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 00:47:49,881 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-10 00:47:49,881 INFO L444 ModelExtractionUtils]: 15 out of 21 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-10 00:47:49,883 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 00:47:49,886 INFO L440 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2018-11-10 00:47:49,887 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 00:47:49,887 INFO L519 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-10 00:47:49,915 INFO L297 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2018-11-10 00:47:49,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:47:49,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:47:49,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:47:50,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:47:50,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:47:50,039 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-10 00:47:50,052 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-10 00:47:50,054 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states. Second operand 5 states. [2018-11-10 00:47:50,159 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states.. Second operand 5 states. Result 45 states and 51 transitions. Complement of second has 13 states. [2018-11-10 00:47:50,160 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-10 00:47:50,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 00:47:50,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2018-11-10 00:47:50,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 5 letters. Loop has 4 letters. [2018-11-10 00:47:50,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 00:47:50,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 9 letters. Loop has 4 letters. [2018-11-10 00:47:50,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 00:47:50,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 5 letters. Loop has 8 letters. [2018-11-10 00:47:50,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 00:47:50,165 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 51 transitions. [2018-11-10 00:47:50,167 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 00:47:50,171 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 30 states and 35 transitions. [2018-11-10 00:47:50,171 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-10 00:47:50,172 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-10 00:47:50,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 35 transitions. [2018-11-10 00:47:50,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 00:47:50,173 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 35 transitions. [2018-11-10 00:47:50,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 35 transitions. [2018-11-10 00:47:50,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2018-11-10 00:47:50,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-10 00:47:50,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-11-10 00:47:50,192 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-11-10 00:47:50,192 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-11-10 00:47:50,192 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 00:47:50,192 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 30 transitions. [2018-11-10 00:47:50,193 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 00:47:50,193 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 00:47:50,193 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 00:47:50,194 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:47:50,194 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 00:47:50,194 INFO L793 eck$LassoCheckResult]: Stem: 163#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 161#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 162#L572 assume !(main_~n~0 < 1);assume { :begin_inline_new_cll } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 12;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];new_cll_#t~malloc4.base, new_cll_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;new_cll_~x~1.base, new_cll_~x~1.offset := new_cll_#t~malloc4.base, new_cll_#t~malloc4.offset; 150#L558 SUMMARY for call write~int(new_cll_~n, new_cll_~x~1.base, new_cll_~x~1.offset + 0, 4); srcloc: L558 151#L558-1 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);< 154#new_lsegENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~n := #in~n; 168#L548 assume ~n == 0;#res.base, #res.offset := ~p.base, ~p.offset; 173#new_lsegFINAL assume true; 171#new_lsegEXIT >#44#return; 170#L559 SUMMARY for call write~$Pointer$(new_cll_#t~ret5.base, new_cll_#t~ret5.offset, new_cll_~x~1.base, new_cll_~x~1.offset + 4, 8); srcloc: L559 152#L559-1 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; 153#L560 main_#t~ret8.base, main_#t~ret8.offset := new_cll_#res.base, new_cll_#res.offset;assume { :end_inline_new_cll } true;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;assume { :begin_inline_traverse } true;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; 157#L565-3 [2018-11-10 00:47:50,194 INFO L795 eck$LassoCheckResult]: Loop: 157#L565-3 assume true; 160#L565-1 assume !!(traverse_~curr~0.base != 0 || traverse_~curr~0.offset != 0); 155#L566 SUMMARY for call traverse_#t~mem6.base, traverse_#t~mem6.offset := read~$Pointer$(traverse_~curr~0.base, traverse_~curr~0.offset + 4, 8); srcloc: L566 156#L566-1 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; 157#L565-3 [2018-11-10 00:47:50,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:47:50,195 INFO L82 PathProgramCache]: Analyzing trace with hash -322657920, now seen corresponding path program 1 times [2018-11-10 00:47:50,195 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:47:50,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:47:50,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:47:50,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:47:50,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:47:50,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:47:50,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:47:50,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:47:50,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1452840, now seen corresponding path program 1 times [2018-11-10 00:47:50,216 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:47:50,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:47:50,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:47:50,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:47:50,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:47:50,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:47:50,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:47:50,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:47:50,224 INFO L82 PathProgramCache]: Analyzing trace with hash -828377817, now seen corresponding path program 1 times [2018-11-10 00:47:50,224 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:47:50,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:47:50,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:47:50,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:47:50,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:47:50,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:47:50,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:47:50,578 WARN L179 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 128 [2018-11-10 00:47:50,639 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 00:47:50,640 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 00:47:50,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 12:47:50 BoogieIcfgContainer [2018-11-10 00:47:50,650 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 00:47:50,651 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 00:47:50,651 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 00:47:50,651 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 00:47:50,651 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:47:48" (3/4) ... [2018-11-10 00:47:50,654 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-10 00:47:50,689 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_6deb143c-1563-4289-9f80-3cbc306d3855/bin-2019/uautomizer/witness.graphml [2018-11-10 00:47:50,689 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 00:47:50,689 INFO L168 Benchmark]: Toolchain (without parser) took 2835.09 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 230.7 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -97.9 MB). Peak memory consumption was 132.8 MB. Max. memory is 11.5 GB. [2018-11-10 00:47:50,690 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 00:47:50,690 INFO L168 Benchmark]: CACSL2BoogieTranslator took 307.69 ms. Allocated memory is still 1.0 GB. Free memory was 956.4 MB in the beginning and 934.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 00:47:50,691 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 934.9 MB in the beginning and 1.2 GB in the end (delta: -217.4 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. [2018-11-10 00:47:50,691 INFO L168 Benchmark]: Boogie Preprocessor took 15.74 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 00:47:50,691 INFO L168 Benchmark]: RCFGBuilder took 210.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. [2018-11-10 00:47:50,692 INFO L168 Benchmark]: BuchiAutomizer took 2187.38 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 72.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 75.5 MB). Peak memory consumption was 147.9 MB. Max. memory is 11.5 GB. [2018-11-10 00:47:50,692 INFO L168 Benchmark]: Witness Printer took 38.05 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 00:47:50,694 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 307.69 ms. Allocated memory is still 1.0 GB. Free memory was 956.4 MB in the beginning and 934.9 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 73.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 934.9 MB in the beginning and 1.2 GB in the end (delta: -217.4 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.74 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 210.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2187.38 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 72.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 75.5 MB). Peak memory consumption was 147.9 MB. Max. memory is 11.5 GB. * Witness Printer took 38.05 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * 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 27 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.1s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 1.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 27 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 9 SDtfs, 16 SDslu, 7 SDs, 0 SdLazy, 19 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital143 mio100 ax100 hnf100 lsp79 ukn63 mio100 lsp34 div100 bol100 ite100 ukn100 eq196 hnf91 smp100 dnf139 smp100 tf100 neg96 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 98ms 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. [2018-11-10 00:47:50,702 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 00:47:50,703 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 00:47:50,704 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 00:47:50,705 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled 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@648cffab=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@71925848=0, curr=3, \result=0, x=0, x=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@38cea45c=0, x=3, \old(n)=1, \result=0, NULL=12, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3300311c=0, x=3, head=0, head=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@648cffab=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@44d34c0f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3300311c=3, n=1, head=0, head=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@44d34c0f=0, NULL=0, NULL=3, n=1, \result=3, curr=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@71925848=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) [L575] CALL, EXPR new_cll(n) [L557] EXPR, FCALL malloc(sizeof(node_t)) [L557] node_t* x = malloc(sizeof(node_t)); [L558] FCALL x->val = n [L559] CALL, EXPR new_lseg(x,n-1) [L548] COND TRUE n==0 [L549] RET return p; [L559] EXPR new_lseg(x,n-1) [L559] FCALL x->next = new_lseg(x,n-1) [L560] RET return x; [L575] EXPR new_cll(n) [L575] node_t* x = new_cll(n); [L576] CALL traverse(x) [L564] node_t* curr = head; Loop: [L565] COND TRUE curr != ((void *)0) [L566] EXPR, FCALL curr->next [L566] curr = curr->next End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...