./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-linkedlists/nondet_ll_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_3829b4e6-7677-4090-bad5-c8cbdef8df28/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3829b4e6-7677-4090-bad5-c8cbdef8df28/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3829b4e6-7677-4090-bad5-c8cbdef8df28/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3829b4e6-7677-4090-bad5-c8cbdef8df28/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-linkedlists/nondet_ll_traverse-alloca_false-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3829b4e6-7677-4090-bad5-c8cbdef8df28/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3829b4e6-7677-4090-bad5-c8cbdef8df28/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 994980d673cadc47caecf39c679cfe156a013f75 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 03:03:18,086 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 03:03:18,087 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 03:03:18,095 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 03:03:18,095 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 03:03:18,096 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 03:03:18,097 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 03:03:18,098 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 03:03:18,099 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 03:03:18,100 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 03:03:18,100 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 03:03:18,101 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 03:03:18,101 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 03:03:18,102 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 03:03:18,103 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 03:03:18,103 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 03:03:18,104 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 03:03:18,105 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 03:03:18,106 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 03:03:18,107 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 03:03:18,108 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 03:03:18,109 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 03:03:18,110 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 03:03:18,111 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 03:03:18,111 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 03:03:18,111 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 03:03:18,112 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 03:03:18,113 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 03:03:18,113 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 03:03:18,114 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 03:03:18,114 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 03:03:18,115 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 03:03:18,115 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 03:03:18,115 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 03:03:18,116 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 03:03:18,116 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 03:03:18,116 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3829b4e6-7677-4090-bad5-c8cbdef8df28/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 03:03:18,127 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 03:03:18,127 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 03:03:18,128 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 03:03:18,128 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 03:03:18,128 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 03:03:18,129 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 03:03:18,129 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 03:03:18,129 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 03:03:18,129 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 03:03:18,129 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 03:03:18,129 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 03:03:18,130 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 03:03:18,130 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 03:03:18,130 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 03:03:18,130 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 03:03:18,130 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 03:03:18,130 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 03:03:18,130 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 03:03:18,131 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 03:03:18,131 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 03:03:18,131 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 03:03:18,131 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 03:03:18,131 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 03:03:18,131 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 03:03:18,131 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 03:03:18,132 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 03:03:18,132 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 03:03:18,132 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 03:03:18,133 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_3829b4e6-7677-4090-bad5-c8cbdef8df28/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 -> 994980d673cadc47caecf39c679cfe156a013f75 [2018-11-10 03:03:18,156 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 03:03:18,165 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 03:03:18,168 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 03:03:18,169 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 03:03:18,169 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 03:03:18,170 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3829b4e6-7677-4090-bad5-c8cbdef8df28/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-linkedlists/nondet_ll_traverse-alloca_false-termination.c.i [2018-11-10 03:03:18,214 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3829b4e6-7677-4090-bad5-c8cbdef8df28/bin-2019/uautomizer/data/67c299ff2/e09d671d4138487d8d1eccf346d2638e/FLAG1c7b08fef [2018-11-10 03:03:18,644 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 03:03:18,644 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3829b4e6-7677-4090-bad5-c8cbdef8df28/sv-benchmarks/c/termination-memory-linkedlists/nondet_ll_traverse-alloca_false-termination.c.i [2018-11-10 03:03:18,652 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3829b4e6-7677-4090-bad5-c8cbdef8df28/bin-2019/uautomizer/data/67c299ff2/e09d671d4138487d8d1eccf346d2638e/FLAG1c7b08fef [2018-11-10 03:03:18,664 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3829b4e6-7677-4090-bad5-c8cbdef8df28/bin-2019/uautomizer/data/67c299ff2/e09d671d4138487d8d1eccf346d2638e [2018-11-10 03:03:18,667 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 03:03:18,668 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 03:03:18,669 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 03:03:18,669 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 03:03:18,672 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 03:03:18,673 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:03:18" (1/1) ... [2018-11-10 03:03:18,675 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2af148b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:03:18, skipping insertion in model container [2018-11-10 03:03:18,675 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:03:18" (1/1) ... [2018-11-10 03:03:18,681 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 03:03:18,709 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 03:03:18,887 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:03:18,895 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 03:03:18,923 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:03:18,956 INFO L193 MainTranslator]: Completed translation [2018-11-10 03:03:18,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:03:18 WrapperNode [2018-11-10 03:03:18,957 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 03:03:18,957 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 03:03:18,957 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 03:03:18,957 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 03:03:19,003 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:03:18" (1/1) ... [2018-11-10 03:03:19,012 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:03:18" (1/1) ... [2018-11-10 03:03:19,025 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 03:03:19,025 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 03:03:19,025 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 03:03:19,025 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 03:03:19,030 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:03:18" (1/1) ... [2018-11-10 03:03:19,030 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:03:18" (1/1) ... [2018-11-10 03:03:19,032 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:03:18" (1/1) ... [2018-11-10 03:03:19,032 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:03:18" (1/1) ... [2018-11-10 03:03:19,035 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:03:18" (1/1) ... [2018-11-10 03:03:19,038 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:03:18" (1/1) ... [2018-11-10 03:03:19,038 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:03:18" (1/1) ... [2018-11-10 03:03:19,040 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 03:03:19,040 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 03:03:19,040 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 03:03:19,040 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 03:03:19,041 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:03:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3829b4e6-7677-4090-bad5-c8cbdef8df28/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 03:03:19,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 03:03:19,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-10 03:03:19,077 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-10 03:03:19,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 03:03:19,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 03:03:19,225 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 03:03:19,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:03:19 BoogieIcfgContainer [2018-11-10 03:03:19,226 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 03:03:19,227 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 03:03:19,227 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 03:03:19,229 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 03:03:19,230 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 03:03:19,230 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 03:03:18" (1/3) ... [2018-11-10 03:03:19,231 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7c128a0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 03:03:19, skipping insertion in model container [2018-11-10 03:03:19,231 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 03:03:19,231 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:03:18" (2/3) ... [2018-11-10 03:03:19,231 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7c128a0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 03:03:19, skipping insertion in model container [2018-11-10 03:03:19,231 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 03:03:19,232 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:03:19" (3/3) ... [2018-11-10 03:03:19,233 INFO L375 chiAutomizerObserver]: Analyzing ICFG nondet_ll_traverse-alloca_false-termination.c.i [2018-11-10 03:03:19,263 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 03:03:19,264 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 03:03:19,264 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 03:03:19,264 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 03:03:19,264 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 03:03:19,264 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 03:03:19,264 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 03:03:19,264 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 03:03:19,265 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 03:03:19,276 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2018-11-10 03:03:19,293 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-10 03:03:19,293 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:03:19,293 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:03:19,299 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 03:03:19,299 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 03:03:19,299 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 03:03:19,299 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2018-11-10 03:03:19,301 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-10 03:03:19,301 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:03:19,301 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:03:19,301 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 03:03:19,301 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 03:03:19,308 INFO L793 eck$LassoCheckResult]: Stem: 15#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_~head~1.base, main_~head~1.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7;assume { :begin_inline_init_nondet_ll } true;init_nondet_ll_#in~n := main_~n~0;havoc init_nondet_ll_#res.base, init_nondet_ll_#res.offset;havoc init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset, init_nondet_ll_#t~malloc4.base, init_nondet_ll_#t~malloc4.offset, init_nondet_ll_#t~post3, init_nondet_ll_~i~0, init_nondet_ll_~next_node~0.base, init_nondet_ll_~next_node~0.offset, init_nondet_ll_#t~nondet5, init_nondet_ll_~n, init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset;init_nondet_ll_~n := init_nondet_ll_#in~n;havoc init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset;#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];init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset := init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset; 20#L550true SUMMARY for call write~int(0, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset + 0, 4); srcloc: L550 23#L550-1true init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset := init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset;init_nondet_ll_~i~0 := 1; 3#L552-4true [2018-11-10 03:03:19,308 INFO L795 eck$LassoCheckResult]: Loop: 3#L552-4true assume true; 17#L552-1true assume !!(init_nondet_ll_~i~0 < init_nondet_ll_~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];init_nondet_ll_#t~malloc4.base, init_nondet_ll_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;init_nondet_ll_~next_node~0.base, init_nondet_ll_~next_node~0.offset := init_nondet_ll_#t~malloc4.base, init_nondet_ll_#t~malloc4.offset; 10#L554true SUMMARY for call write~int(init_nondet_ll_~i~0, init_nondet_ll_~next_node~0.base, init_nondet_ll_~next_node~0.offset + 0, 4); srcloc: L554 14#L554-1true SUMMARY for call write~$Pointer$(init_nondet_ll_~next_node~0.base, init_nondet_ll_~next_node~0.offset, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset + 4, 8); srcloc: L554-1 8#L555true init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset := init_nondet_ll_~next_node~0.base, init_nondet_ll_~next_node~0.offset; 24#L552-3true init_nondet_ll_#t~post3 := init_nondet_ll_~i~0;init_nondet_ll_~i~0 := init_nondet_ll_#t~post3 + 1;havoc init_nondet_ll_#t~post3; 3#L552-4true [2018-11-10 03:03:19,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:03:19,313 INFO L82 PathProgramCache]: Analyzing trace with hash 925540, now seen corresponding path program 1 times [2018-11-10 03:03:19,314 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:03:19,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:03:19,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:03:19,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:03:19,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:03:19,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:03:19,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:03:19,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:03:19,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1128974665, now seen corresponding path program 1 times [2018-11-10 03:03:19,396 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:03:19,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:03:19,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:03:19,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:03:19,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:03:19,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:03:19,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:03:19,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:03:19,419 INFO L82 PathProgramCache]: Analyzing trace with hash -686910868, now seen corresponding path program 1 times [2018-11-10 03:03:19,419 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:03:19,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:03:19,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:03:19,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:03:19,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:03:19,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:03:19,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:03:19,644 WARN L179 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2018-11-10 03:03:19,819 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:03:19,820 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:03:19,820 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:03:19,820 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:03:19,820 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:03:19,820 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:03:19,820 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:03:19,821 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:03:19,821 INFO L131 ssoRankerPreferences]: Filename of dumped script: nondet_ll_traverse-alloca_false-termination.c.i_Iteration1_Lasso [2018-11-10 03:03:19,821 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:03:19,821 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:03:19,843 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 03:03:19,848 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 03:03:19,851 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 03:03:19,853 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 03:03:19,854 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 03:03:19,865 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 03:03:19,867 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 03:03:19,868 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 03:03:20,098 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2018-11-10 03:03:20,098 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 03:03:20,099 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 03:03:20,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-10 03:03:20,102 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 03:03:20,104 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 03:03:20,362 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:03:20,366 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:03:20,368 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 03:03:20,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:03:20,369 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:03:20,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:03:20,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:03:20,370 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:03:20,372 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:03:20,372 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:03:20,374 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:03:20,375 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 03:03:20,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:03:20,375 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:03:20,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:03:20,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:03:20,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:03:20,376 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:03:20,376 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:03:20,378 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:03:20,378 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 03:03:20,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:03:20,379 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:03:20,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:03:20,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:03:20,379 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:03:20,380 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:03:20,380 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:03:20,380 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:03:20,381 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:03:20,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:03:20,381 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:03:20,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:03:20,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:03:20,382 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:03:20,382 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:03:20,382 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:03:20,383 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:03:20,383 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 03:03:20,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:03:20,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:03:20,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:03:20,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:03:20,386 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:03:20,386 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:03:20,389 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:03:20,390 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 03:03:20,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:03:20,390 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:03:20,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:03:20,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:03:20,391 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:03:20,391 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:03:20,391 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:03:20,392 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:03:20,392 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 03:03:20,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:03:20,393 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:03:20,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:03:20,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:03:20,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:03:20,393 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:03:20,394 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:03:20,394 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:03:20,395 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 03:03:20,395 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:03:20,395 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 03:03:20,395 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:03:20,396 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:03:20,405 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-10 03:03:20,405 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-10 03:03:20,463 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:03:20,463 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 03:03:20,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:03:20,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:03:20,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:03:20,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:03:20,466 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:03:20,466 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:03:20,470 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:03:20,470 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:03:20,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:03:20,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:03:20,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:03:20,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:03:20,472 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:03:20,473 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:03:20,477 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:03:20,477 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 03:03:20,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:03:20,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:03:20,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:03:20,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:03:20,480 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:03:20,481 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:03:20,506 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 03:03:20,516 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 03:03:20,516 INFO L444 ModelExtractionUtils]: 18 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 03:03:20,518 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 03:03:20,519 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 03:03:20,520 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 03:03:20,520 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_init_nondet_ll_~n, ULTIMATE.start_init_nondet_ll_~i~0) = 1*ULTIMATE.start_init_nondet_ll_~n - 1*ULTIMATE.start_init_nondet_ll_~i~0 Supporting invariants [] [2018-11-10 03:03:20,536 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-10 03:03:20,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:03:20,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:03:20,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:03:20,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:03:20,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:03:20,628 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 03:03:20,642 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 03:03:20,643 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states. Second operand 4 states. [2018-11-10 03:03:20,682 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states.. Second operand 4 states. Result 55 states and 65 transitions. Complement of second has 7 states. [2018-11-10 03:03:20,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 03:03:20,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 03:03:20,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2018-11-10 03:03:20,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 4 letters. Loop has 6 letters. [2018-11-10 03:03:20,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:03:20,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 10 letters. Loop has 6 letters. [2018-11-10 03:03:20,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:03:20,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 4 letters. Loop has 12 letters. [2018-11-10 03:03:20,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:03:20,688 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 65 transitions. [2018-11-10 03:03:20,690 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 03:03:20,692 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 21 states and 24 transitions. [2018-11-10 03:03:20,693 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-10 03:03:20,693 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-10 03:03:20,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 24 transitions. [2018-11-10 03:03:20,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:03:20,694 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2018-11-10 03:03:20,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 24 transitions. [2018-11-10 03:03:20,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-10 03:03:20,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-10 03:03:20,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2018-11-10 03:03:20,712 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2018-11-10 03:03:20,712 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2018-11-10 03:03:20,712 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 03:03:20,712 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 24 transitions. [2018-11-10 03:03:20,713 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 03:03:20,713 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:03:20,713 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:03:20,713 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:03:20,714 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 03:03:20,714 INFO L793 eck$LassoCheckResult]: Stem: 164#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 162#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_~head~1.base, main_~head~1.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7;assume { :begin_inline_init_nondet_ll } true;init_nondet_ll_#in~n := main_~n~0;havoc init_nondet_ll_#res.base, init_nondet_ll_#res.offset;havoc init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset, init_nondet_ll_#t~malloc4.base, init_nondet_ll_#t~malloc4.offset, init_nondet_ll_#t~post3, init_nondet_ll_~i~0, init_nondet_ll_~next_node~0.base, init_nondet_ll_~next_node~0.offset, init_nondet_ll_#t~nondet5, init_nondet_ll_~n, init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset;init_nondet_ll_~n := init_nondet_ll_#in~n;havoc init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset;#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];init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset := init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset; 163#L550 SUMMARY for call write~int(0, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset + 0, 4); srcloc: L550 167#L550-1 init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset := init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset;init_nondet_ll_~i~0 := 1; 147#L552-4 assume true; 149#L552-1 assume !(init_nondet_ll_~i~0 < init_nondet_ll_~n); 151#L552-5 assume init_nondet_ll_#t~nondet5 != 0;havoc init_nondet_ll_#t~nondet5; 152#L559 SUMMARY for call write~$Pointer$(init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset + 4, 8); srcloc: L559 166#L561-1 init_nondet_ll_#res.base, init_nondet_ll_#res.offset := init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset; 165#L562 main_#t~ret8.base, main_#t~ret8.offset := init_nondet_ll_#res.base, init_nondet_ll_#res.offset;assume { :end_inline_init_nondet_ll } true;main_~head~1.base, main_~head~1.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_~head~1.base, main_~head~1.offset;havoc traverse_#t~mem6.base, traverse_#t~mem6.offset, traverse_~head.base, traverse_~head.offset, traverse_~curr~1.base, traverse_~curr~1.offset;traverse_~head.base, traverse_~head.offset := traverse_#in~head.base, traverse_#in~head.offset;traverse_~curr~1.base, traverse_~curr~1.offset := traverse_~head.base, traverse_~head.offset; 156#L567-3 [2018-11-10 03:03:20,714 INFO L795 eck$LassoCheckResult]: Loop: 156#L567-3 assume true; 157#L567-1 assume !!(traverse_~curr~1.base != 0 || traverse_~curr~1.offset != 0); 154#L568 SUMMARY for call traverse_#t~mem6.base, traverse_#t~mem6.offset := read~$Pointer$(traverse_~curr~1.base, traverse_~curr~1.offset + 4, 8); srcloc: L568 155#L568-1 traverse_~curr~1.base, traverse_~curr~1.offset := traverse_#t~mem6.base, traverse_#t~mem6.offset;havoc traverse_#t~mem6.base, traverse_#t~mem6.offset; 156#L567-3 [2018-11-10 03:03:20,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:03:20,714 INFO L82 PathProgramCache]: Analyzing trace with hash -688449942, now seen corresponding path program 1 times [2018-11-10 03:03:20,714 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:03:20,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:03:20,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:03:20,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:03:20,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:03:20,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:03:20,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:03:20,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:03:20,731 INFO L82 PathProgramCache]: Analyzing trace with hash 2037736, now seen corresponding path program 1 times [2018-11-10 03:03:20,731 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:03:20,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:03:20,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:03:20,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:03:20,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:03:20,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:03:20,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:03:20,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:03:20,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1084042799, now seen corresponding path program 1 times [2018-11-10 03:03:20,738 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:03:20,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:03:20,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:03:20,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:03:20,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:03:20,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:03:20,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:03:21,039 WARN L179 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 99 [2018-11-10 03:03:21,110 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 03:03:21,113 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 03:03:21,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 03:03:21 BoogieIcfgContainer [2018-11-10 03:03:21,122 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 03:03:21,122 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 03:03:21,122 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 03:03:21,123 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 03:03:21,123 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:03:19" (3/4) ... [2018-11-10 03:03:21,126 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-10 03:03:21,162 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3829b4e6-7677-4090-bad5-c8cbdef8df28/bin-2019/uautomizer/witness.graphml [2018-11-10 03:03:21,162 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 03:03:21,163 INFO L168 Benchmark]: Toolchain (without parser) took 2494.97 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 255.9 MB). Free memory was 952.2 MB in the beginning and 1.2 GB in the end (delta: -220.6 MB). Peak memory consumption was 35.3 MB. Max. memory is 11.5 GB. [2018-11-10 03:03:21,163 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:03:21,164 INFO L168 Benchmark]: CACSL2BoogieTranslator took 287.86 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 930.7 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 03:03:21,164 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.8 MB). Free memory was 930.7 MB in the beginning and 1.2 GB in the end (delta: -232.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. [2018-11-10 03:03:21,165 INFO L168 Benchmark]: Boogie Preprocessor took 14.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-10 03:03:21,165 INFO L168 Benchmark]: RCFGBuilder took 186.28 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: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2018-11-10 03:03:21,166 INFO L168 Benchmark]: BuchiAutomizer took 1895.24 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 87.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -36.8 MB). Peak memory consumption was 306.3 MB. Max. memory is 11.5 GB. [2018-11-10 03:03:21,166 INFO L168 Benchmark]: Witness Printer took 39.74 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-10 03:03:21,169 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 287.86 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 930.7 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 67.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.8 MB). Free memory was 930.7 MB in the beginning and 1.2 GB in the end (delta: -232.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 186.28 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: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1895.24 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 87.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -36.8 MB). Peak memory consumption was 306.3 MB. Max. memory is 11.5 GB. * Witness Printer took 39.74 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. 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 n + -1 * i and consists of 5 locations. The remainder module has 21 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.8s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 1.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 21 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 21 SDtfs, 26 SDslu, 32 SDs, 0 SdLazy, 8 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital195 mio100 ax100 hnf100 lsp96 ukn83 mio100 lsp19 div100 bol100 ite100 ukn100 eq216 hnf89 smp100 dnf176 smp100 tf100 neg96 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 68ms VariablesStem: 4 VariablesLoop: 6 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 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: 567]: Nontermination argument in form of an infinite program execution. [2018-11-10 03:03:21,177 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 03:03:21,178 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 03:03:21,179 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 03:03:21,180 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@4a0e9899=0, curr=3, \result=0, head=0, n=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@70c5b03f=0, next_node=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@22549dc0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@284e0b03=0, NULL=12, NULL=0, \old(n)=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@22549dc0=3, \result=0, head=0, head=3, i=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4a0e9899=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@48fa189c=0, \result=3, head=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@6dedf37f=0, n=0, next_node=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@78f78f05=0, head=0, head=3, curr=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@48fa189c=0, NULL=0, head=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@284e0b03=0, curr=0, NULL=3, head=0, curr=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 567]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L573] int n = __VERIFIER_nondet_int(); [L574] CALL, EXPR init_nondet_ll(n) [L548] node_t* head; [L549] EXPR, FCALL malloc(sizeof(node_t)) [L549] node_t* curr = malloc(sizeof(node_t)); [L550] FCALL curr->val = 0 [L551] head = curr [L552] int i = 1; [L552] COND FALSE !(i < n) [L558] COND TRUE __VERIFIER_nondet_int() [L559] FCALL curr->next = head [L562] RET return head; [L574] EXPR init_nondet_ll(n) [L574] node_t* head = init_nondet_ll(n); [L575] CALL traverse(head) [L566] node_t* curr = head; Loop: [L567] COND TRUE curr != ((void *)0) [L568] EXPR, FCALL curr->next [L568] curr = curr->next End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...