./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-linkedlists/cll_traverse-alloca_false-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_35fd53d6-732f-497c-be73-c69e09912501/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_35fd53d6-732f-497c-be73-c69e09912501/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_35fd53d6-732f-497c-be73-c69e09912501/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_35fd53d6-732f-497c-be73-c69e09912501/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-linkedlists/cll_traverse-alloca_false-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_35fd53d6-732f-497c-be73-c69e09912501/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_35fd53d6-732f-497c-be73-c69e09912501/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 a2a51f996e4cf34954505c04e8fa9e53d244d46a .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-aa41828 [2018-11-22 23:22:52,379 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 23:22:52,380 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 23:22:52,386 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 23:22:52,386 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 23:22:52,387 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 23:22:52,387 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 23:22:52,389 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 23:22:52,390 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 23:22:52,390 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 23:22:52,391 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 23:22:52,391 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 23:22:52,392 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 23:22:52,392 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 23:22:52,393 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 23:22:52,394 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 23:22:52,394 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 23:22:52,395 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 23:22:52,397 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 23:22:52,398 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 23:22:52,399 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 23:22:52,399 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 23:22:52,401 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 23:22:52,401 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 23:22:52,401 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 23:22:52,402 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 23:22:52,402 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 23:22:52,403 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 23:22:52,404 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 23:22:52,404 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 23:22:52,404 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 23:22:52,405 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 23:22:52,405 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 23:22:52,405 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 23:22:52,406 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 23:22:52,406 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 23:22:52,406 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_35fd53d6-732f-497c-be73-c69e09912501/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-22 23:22:52,417 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 23:22:52,417 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 23:22:52,418 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 23:22:52,418 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 23:22:52,418 INFO L133 SettingsManager]: * Use SBE=true [2018-11-22 23:22:52,419 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-22 23:22:52,419 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-22 23:22:52,419 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-22 23:22:52,419 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-22 23:22:52,419 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-22 23:22:52,419 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-22 23:22:52,419 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 23:22:52,420 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-22 23:22:52,420 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 23:22:52,420 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 23:22:52,420 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-22 23:22:52,420 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-22 23:22:52,420 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-22 23:22:52,420 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 23:22:52,421 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-22 23:22:52,421 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 23:22:52,421 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-22 23:22:52,421 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 23:22:52,421 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 23:22:52,422 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-22 23:22:52,422 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 23:22:52,422 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-22 23:22:52,422 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-22 23:22:52,423 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-22 23:22:52,423 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_35fd53d6-732f-497c-be73-c69e09912501/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 -> a2a51f996e4cf34954505c04e8fa9e53d244d46a [2018-11-22 23:22:52,445 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 23:22:52,454 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 23:22:52,456 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 23:22:52,457 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 23:22:52,457 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 23:22:52,458 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_35fd53d6-732f-497c-be73-c69e09912501/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-linkedlists/cll_traverse-alloca_false-termination.c.i [2018-11-22 23:22:52,493 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_35fd53d6-732f-497c-be73-c69e09912501/bin-2019/uautomizer/data/c70b3ee1e/957224823da14eeb9ec460715f7e37ef/FLAG906d83ae8 [2018-11-22 23:22:52,927 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 23:22:52,928 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_35fd53d6-732f-497c-be73-c69e09912501/sv-benchmarks/c/termination-memory-linkedlists/cll_traverse-alloca_false-termination.c.i [2018-11-22 23:22:52,934 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_35fd53d6-732f-497c-be73-c69e09912501/bin-2019/uautomizer/data/c70b3ee1e/957224823da14eeb9ec460715f7e37ef/FLAG906d83ae8 [2018-11-22 23:22:52,943 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_35fd53d6-732f-497c-be73-c69e09912501/bin-2019/uautomizer/data/c70b3ee1e/957224823da14eeb9ec460715f7e37ef [2018-11-22 23:22:52,944 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 23:22:52,945 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 23:22:52,946 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 23:22:52,946 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 23:22:52,949 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 23:22:52,949 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:22:52" (1/1) ... [2018-11-22 23:22:52,951 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d97fd37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:22:52, skipping insertion in model container [2018-11-22 23:22:52,952 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:22:52" (1/1) ... [2018-11-22 23:22:52,958 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 23:22:52,985 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 23:22:53,169 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 23:22:53,179 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 23:22:53,254 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 23:22:53,284 INFO L195 MainTranslator]: Completed translation [2018-11-22 23:22:53,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:22:53 WrapperNode [2018-11-22 23:22:53,285 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 23:22:53,286 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 23:22:53,286 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 23:22:53,286 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 23:22:53,293 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:22:53" (1/1) ... [2018-11-22 23:22:53,304 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:22:53" (1/1) ... [2018-11-22 23:22:53,317 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 23:22:53,317 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 23:22:53,317 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 23:22:53,317 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 23:22:53,323 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:22:53" (1/1) ... [2018-11-22 23:22:53,323 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:22:53" (1/1) ... [2018-11-22 23:22:53,325 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:22:53" (1/1) ... [2018-11-22 23:22:53,325 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:22:53" (1/1) ... [2018-11-22 23:22:53,329 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:22:53" (1/1) ... [2018-11-22 23:22:53,333 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:22:53" (1/1) ... [2018-11-22 23:22:53,334 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:22:53" (1/1) ... [2018-11-22 23:22:53,336 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 23:22:53,336 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 23:22:53,336 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 23:22:53,336 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 23:22:53,337 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:22:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_35fd53d6-732f-497c-be73-c69e09912501/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-22 23:22:53,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-22 23:22:53,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-22 23:22:53,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-22 23:22:53,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-22 23:22:53,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 23:22:53,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 23:22:53,560 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 23:22:53,560 INFO L280 CfgBuilder]: Removed 10 assue(true) statements. [2018-11-22 23:22:53,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:22:53 BoogieIcfgContainer [2018-11-22 23:22:53,561 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 23:22:53,561 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-22 23:22:53,561 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-22 23:22:53,564 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-22 23:22:53,564 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 23:22:53,565 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.11 11:22:52" (1/3) ... [2018-11-22 23:22:53,565 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@32a45eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 11:22:53, skipping insertion in model container [2018-11-22 23:22:53,566 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 23:22:53,566 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:22:53" (2/3) ... [2018-11-22 23:22:53,566 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@32a45eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 11:22:53, skipping insertion in model container [2018-11-22 23:22:53,566 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 23:22:53,566 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:22:53" (3/3) ... [2018-11-22 23:22:53,568 INFO L375 chiAutomizerObserver]: Analyzing ICFG cll_traverse-alloca_false-termination.c.i [2018-11-22 23:22:53,610 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 23:22:53,611 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-22 23:22:53,611 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-22 23:22:53,611 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-22 23:22:53,611 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 23:22:53,611 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 23:22:53,611 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-22 23:22:53,612 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 23:22:53,612 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-22 23:22:53,624 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2018-11-22 23:22:53,646 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2018-11-22 23:22:53,646 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:22:53,646 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:22:53,652 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-22 23:22:53,652 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 23:22:53,652 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-22 23:22:53,652 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2018-11-22 23:22:53,653 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2018-11-22 23:22:53,653 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:22:53,653 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:22:53,653 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-22 23:22:53,653 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 23:22:53,660 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~nondet6, main_#t~ret7.base, main_#t~ret7.offset, main_~n~0, main_~head~1.base, main_~head~1.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6;init_cll_#in~n := main_~n~0;havoc init_cll_#res.base, init_cll_#res.offset;havoc init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset, init_cll_#t~malloc4.base, init_cll_#t~malloc4.offset, init_cll_#t~post3, init_cll_~i~0, init_cll_~next_node~0.base, init_cll_~next_node~0.offset, init_cll_~n, init_cll_~head~0.base, init_cll_~head~0.offset, init_cll_~curr~0.base, init_cll_~curr~0.offset;init_cll_~n := init_cll_#in~n;havoc init_cll_~head~0.base, init_cll_~head~0.offset;call init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset := #Ultimate.alloc(12);init_cll_~curr~0.base, init_cll_~curr~0.offset := init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset;call write~int(0, init_cll_~curr~0.base, init_cll_~curr~0.offset, 4);init_cll_~head~0.base, init_cll_~head~0.offset := init_cll_~curr~0.base, init_cll_~curr~0.offset;init_cll_~i~0 := 1; 12#L552-3true [2018-11-22 23:22:53,660 INFO L796 eck$LassoCheckResult]: Loop: 12#L552-3true assume !!(init_cll_~i~0 < init_cll_~n);call init_cll_#t~malloc4.base, init_cll_#t~malloc4.offset := #Ultimate.alloc(12);init_cll_~next_node~0.base, init_cll_~next_node~0.offset := init_cll_#t~malloc4.base, init_cll_#t~malloc4.offset;call write~int(init_cll_~i~0, init_cll_~next_node~0.base, init_cll_~next_node~0.offset, 4);call write~$Pointer$(init_cll_~next_node~0.base, init_cll_~next_node~0.offset, init_cll_~curr~0.base, 4 + init_cll_~curr~0.offset, 8);init_cll_~curr~0.base, init_cll_~curr~0.offset := init_cll_~next_node~0.base, init_cll_~next_node~0.offset; 10#L552-2true init_cll_#t~post3 := init_cll_~i~0;init_cll_~i~0 := 1 + init_cll_#t~post3;havoc init_cll_#t~post3; 12#L552-3true [2018-11-22 23:22:53,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:22:53,665 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-22 23:22:53,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:22:53,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:22:53,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:22:53,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:22:53,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:22:53,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:22:53,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:22:53,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:22:53,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2018-11-22 23:22:53,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:22:53,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:22:53,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:22:53,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:22:53,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:22:53,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:22:53,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:22:53,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:22:53,788 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2018-11-22 23:22:53,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:22:53,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:22:53,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:22:53,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:22:53,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:22:53,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:22:53,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:22:53,995 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2018-11-22 23:22:54,024 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 23:22:54,032 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 23:22:54,109 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 23:22:54,114 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 23:22:54,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-22 23:22:54,204 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:153, output treesize:155 [2018-11-22 23:22:54,399 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 23:22:54,400 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 23:22:54,400 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 23:22:54,400 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 23:22:54,400 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 23:22:54,400 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 23:22:54,400 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 23:22:54,400 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 23:22:54,400 INFO L131 ssoRankerPreferences]: Filename of dumped script: cll_traverse-alloca_false-termination.c.i_Iteration1_Lasso [2018-11-22 23:22:54,401 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 23:22:54,401 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 23:22:54,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-22 23:22:54,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-22 23:22:54,424 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-22 23:22:54,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-22 23:22:54,428 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-22 23:22:54,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-22 23:22:54,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-22 23:22:54,611 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-22 23:22:54,612 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-22 23:22:54,613 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-22 23:22:54,615 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-22 23:22:54,616 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-22 23:22:54,842 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 23:22:54,846 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 23:22:54,848 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-22 23:22:54,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:22:54,850 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:22:54,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:22:54,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:22:54,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:22:54,853 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:22:54,853 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:22:54,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:22:54,855 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-22 23:22:54,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:22:54,856 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:22:54,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:22:54,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:22:54,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:22:54,857 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:22:54,857 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:22:54,858 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:22:54,858 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-22 23:22:54,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:22:54,859 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:22:54,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:22:54,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:22:54,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:22:54,859 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:22:54,860 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:22:54,860 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:22:54,861 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:22:54,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:22:54,861 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:22:54,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:22:54,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:22:54,862 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:22:54,862 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:22:54,862 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:22:54,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:22:54,863 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-22 23:22:54,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:22:54,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:22:54,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:22:54,864 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:22:54,866 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:22:54,866 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:22:54,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:22:54,870 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-22 23:22:54,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:22:54,870 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:22:54,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:22:54,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:22:54,871 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:22:54,871 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:22:54,871 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:22:54,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:22:54,872 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:22:54,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:22:54,873 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:22:54,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:22:54,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:22:54,874 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:22:54,874 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:22:54,874 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:22:54,875 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:22:54,875 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-22 23:22:54,876 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:22:54,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:22:54,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:22:54,876 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:22:54,877 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:22:54,877 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:22:54,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:22:54,884 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-22 23:22:54,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:22:54,885 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:22:54,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:22:54,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:22:54,885 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:22:54,886 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:22:54,886 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:22:54,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:22:54,888 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-22 23:22:54,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:22:54,889 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 23:22:54,889 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:22:54,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:22:54,898 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-22 23:22:54,898 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-22 23:22:54,940 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:22:54,941 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-22 23:22:54,941 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:22:54,941 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:22:54,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:22:54,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:22:54,942 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:22:54,942 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:22:54,942 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:22:54,944 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:22:54,944 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-22 23:22:54,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:22:54,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:22:54,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:22:54,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:22:54,947 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:22:54,947 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:22:54,954 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:22:54,954 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-22 23:22:54,954 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:22:54,955 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:22:54,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:22:54,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:22:54,955 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:22:54,955 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:22:54,955 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:22:54,956 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:22:54,956 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-22 23:22:54,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:22:54,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:22:54,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:22:54,957 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:22:54,958 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:22:54,958 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:22:54,963 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:22:54,963 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-22 23:22:54,964 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:22:54,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:22:54,964 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:22:54,964 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:22:54,966 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:22:54,966 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:22:54,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:22:54,970 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-22 23:22:54,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:22:54,970 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:22:54,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:22:54,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:22:54,971 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:22:54,971 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:22:54,971 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:22:54,972 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:22:54,972 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:22:54,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:22:54,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:22:54,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:22:54,973 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:22:54,974 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:22:54,974 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:22:54,977 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:22:54,977 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-22 23:22:54,977 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:22:54,978 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:22:54,978 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:22:54,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:22:54,978 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:22:54,978 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:22:54,978 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:22:54,980 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:22:54,980 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-22 23:22:54,980 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:22:54,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:22:54,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:22:54,981 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:22:54,982 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:22:54,983 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:22:54,993 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 23:22:55,005 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-22 23:22:55,005 INFO L444 ModelExtractionUtils]: 10 out of 16 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-22 23:22:55,007 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 23:22:55,008 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-22 23:22:55,008 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 23:22:55,009 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_init_cll_~n, ULTIMATE.start_init_cll_~i~0) = 1*ULTIMATE.start_init_cll_~n - 1*ULTIMATE.start_init_cll_~i~0 Supporting invariants [] [2018-11-22 23:22:55,028 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-22 23:22:55,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:22:55,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:22:55,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:22:55,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:22:55,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:22:55,128 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-22 23:22:55,142 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-22 23:22:55,164 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 3 states. [2018-11-22 23:22:55,216 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states.. Second operand 3 states. Result 27 states and 36 transitions. Complement of second has 7 states. [2018-11-22 23:22:55,216 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-22 23:22:55,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-22 23:22:55,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2018-11-22 23:22:55,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 2 letters. Loop has 2 letters. [2018-11-22 23:22:55,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 23:22:55,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 4 letters. Loop has 2 letters. [2018-11-22 23:22:55,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 23:22:55,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 2 letters. Loop has 4 letters. [2018-11-22 23:22:55,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 23:22:55,220 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 36 transitions. [2018-11-22 23:22:55,222 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-22 23:22:55,225 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 8 states and 10 transitions. [2018-11-22 23:22:55,226 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-22 23:22:55,226 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-22 23:22:55,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2018-11-22 23:22:55,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 23:22:55,227 INFO L705 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-11-22 23:22:55,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2018-11-22 23:22:55,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-11-22 23:22:55,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-22 23:22:55,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2018-11-22 23:22:55,244 INFO L728 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-11-22 23:22:55,245 INFO L608 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-11-22 23:22:55,245 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-22 23:22:55,245 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2018-11-22 23:22:55,245 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-22 23:22:55,245 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:22:55,245 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:22:55,246 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-22 23:22:55,246 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-22 23:22:55,246 INFO L794 eck$LassoCheckResult]: Stem: 93#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 89#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~ret7.base, main_#t~ret7.offset, main_~n~0, main_~head~1.base, main_~head~1.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6;init_cll_#in~n := main_~n~0;havoc init_cll_#res.base, init_cll_#res.offset;havoc init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset, init_cll_#t~malloc4.base, init_cll_#t~malloc4.offset, init_cll_#t~post3, init_cll_~i~0, init_cll_~next_node~0.base, init_cll_~next_node~0.offset, init_cll_~n, init_cll_~head~0.base, init_cll_~head~0.offset, init_cll_~curr~0.base, init_cll_~curr~0.offset;init_cll_~n := init_cll_#in~n;havoc init_cll_~head~0.base, init_cll_~head~0.offset;call init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset := #Ultimate.alloc(12);init_cll_~curr~0.base, init_cll_~curr~0.offset := init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset;call write~int(0, init_cll_~curr~0.base, init_cll_~curr~0.offset, 4);init_cll_~head~0.base, init_cll_~head~0.offset := init_cll_~curr~0.base, init_cll_~curr~0.offset;init_cll_~i~0 := 1; 90#L552-3 assume !(init_cll_~i~0 < init_cll_~n); 91#L552-4 call write~$Pointer$(init_cll_~head~0.base, init_cll_~head~0.offset, init_cll_~curr~0.base, 4 + init_cll_~curr~0.offset, 8);init_cll_#res.base, init_cll_#res.offset := init_cll_~head~0.base, init_cll_~head~0.offset; 92#L559 main_#t~ret7.base, main_#t~ret7.offset := init_cll_#res.base, init_cll_#res.offset;main_~head~1.base, main_~head~1.offset := main_#t~ret7.base, main_#t~ret7.offset;havoc main_#t~ret7.base, main_#t~ret7.offset;traverse_#in~head.base, traverse_#in~head.offset := main_~head~1.base, main_~head~1.offset;havoc traverse_#t~mem5.base, traverse_#t~mem5.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; 94#L564-2 [2018-11-22 23:22:55,246 INFO L796 eck$LassoCheckResult]: Loop: 94#L564-2 assume !!(traverse_~curr~1.base != 0 || traverse_~curr~1.offset != 0);call traverse_#t~mem5.base, traverse_#t~mem5.offset := read~$Pointer$(traverse_~curr~1.base, 4 + traverse_~curr~1.offset, 8);traverse_~curr~1.base, traverse_~curr~1.offset := traverse_#t~mem5.base, traverse_#t~mem5.offset;havoc traverse_#t~mem5.base, traverse_#t~mem5.offset; 94#L564-2 [2018-11-22 23:22:55,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:22:55,246 INFO L82 PathProgramCache]: Analyzing trace with hash 28696935, now seen corresponding path program 1 times [2018-11-22 23:22:55,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:22:55,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:22:55,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:22:55,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:22:55,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:22:55,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:22:55,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:22:55,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:22:55,262 INFO L82 PathProgramCache]: Analyzing trace with hash 58, now seen corresponding path program 1 times [2018-11-22 23:22:55,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:22:55,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:22:55,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:22:55,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:22:55,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:22:55,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:22:55,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:22:55,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:22:55,267 INFO L82 PathProgramCache]: Analyzing trace with hash 889605012, now seen corresponding path program 1 times [2018-11-22 23:22:55,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:22:55,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:22:55,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:22:55,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:22:55,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:22:55,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:22:55,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:22:55,541 WARN L180 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 105 [2018-11-22 23:22:55,545 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 23:22:55,551 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 23:22:55,631 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 23:22:55,636 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 23:22:55,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-22 23:22:55,698 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:177, output treesize:153 ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; [?] havoc main_#res;havoc main_#t~nondet6, main_#t~ret7.base, main_#t~ret7.offset, main_~n~0, main_~head~1.base, main_~head~1.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6;init_cll_#in~n := main_~n~0;havoc init_cll_#res.base, init_cll_#res.offset;havoc init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset, init_cll_#t~malloc4.base, init_cll_#t~malloc4.offset, init_cll_#t~post3, init_cll_~i~0, init_cll_~next_node~0.base, init_cll_~next_node~0.offset, init_cll_~n, init_cll_~head~0.base, init_cll_~head~0.offset, init_cll_~curr~0.base, init_cll_~curr~0.offset;init_cll_~n := init_cll_#in~n;havoc init_cll_~head~0.base, init_cll_~head~0.offset;call init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset := #Ultimate.alloc(12);init_cll_~curr~0.base, init_cll_~curr~0.offset := init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset;call write~int(0, init_cll_~curr~0.base, init_cll_~curr~0.offset, 4);init_cll_~head~0.base, init_cll_~head~0.offset := init_cll_~curr~0.base, init_cll_~curr~0.offset;init_cll_~i~0 := 1; [?] assume !(init_cll_~i~0 < init_cll_~n); [?] call write~$Pointer$(init_cll_~head~0.base, init_cll_~head~0.offset, init_cll_~curr~0.base, 4 + init_cll_~curr~0.offset, 8);init_cll_#res.base, init_cll_#res.offset := init_cll_~head~0.base, init_cll_~head~0.offset; [?] main_#t~ret7.base, main_#t~ret7.offset := init_cll_#res.base, init_cll_#res.offset;main_~head~1.base, main_~head~1.offset := main_#t~ret7.base, main_#t~ret7.offset;havoc main_#t~ret7.base, main_#t~ret7.offset;traverse_#in~head.base, traverse_#in~head.offset := main_~head~1.base, main_~head~1.offset;havoc traverse_#t~mem5.base, traverse_#t~mem5.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; [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet6, main_#t~ret7.base, main_#t~ret7.offset, main_~n~0, main_~head~1.base, main_~head~1.offset; [L570] main_~n~0 := main_#t~nondet6; [L570] havoc main_#t~nondet6; [L571] init_cll_#in~n := main_~n~0; [L571] havoc init_cll_#res.base, init_cll_#res.offset; [L571] havoc init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset, init_cll_#t~malloc4.base, init_cll_#t~malloc4.offset, init_cll_#t~post3, init_cll_~i~0, init_cll_~next_node~0.base, init_cll_~next_node~0.offset, init_cll_~n, init_cll_~head~0.base, init_cll_~head~0.offset, init_cll_~curr~0.base, init_cll_~curr~0.offset; [L546-L560] init_cll_~n := init_cll_#in~n; [L548] havoc init_cll_~head~0.base, init_cll_~head~0.offset; [L549] call init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset := #Ultimate.alloc(12); [L549] init_cll_~curr~0.base, init_cll_~curr~0.offset := init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset; [L550] call write~int(0, init_cll_~curr~0.base, init_cll_~curr~0.offset, 4); [L551] init_cll_~head~0.base, init_cll_~head~0.offset := init_cll_~curr~0.base, init_cll_~curr~0.offset; [L552] init_cll_~i~0 := 1; [L552-L557] assume !(init_cll_~i~0 < init_cll_~n); [L558] call write~$Pointer$(init_cll_~head~0.base, init_cll_~head~0.offset, init_cll_~curr~0.base, 4 + init_cll_~curr~0.offset, 8); [L559] init_cll_#res.base, init_cll_#res.offset := init_cll_~head~0.base, init_cll_~head~0.offset; [L571] main_#t~ret7.base, main_#t~ret7.offset := init_cll_#res.base, init_cll_#res.offset; [L571] main_~head~1.base, main_~head~1.offset := main_#t~ret7.base, main_#t~ret7.offset; [L571] havoc main_#t~ret7.base, main_#t~ret7.offset; [L572] traverse_#in~head.base, traverse_#in~head.offset := main_~head~1.base, main_~head~1.offset; [L572] havoc traverse_#t~mem5.base, traverse_#t~mem5.offset, traverse_~head.base, traverse_~head.offset, traverse_~curr~1.base, traverse_~curr~1.offset; [L561-L567] traverse_~head.base, traverse_~head.offset := traverse_#in~head.base, traverse_#in~head.offset; [L563] traverse_~curr~1.base, traverse_~curr~1.offset := traverse_~head.base, traverse_~head.offset; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet6, main_#t~ret7.base, main_#t~ret7.offset, main_~n~0, main_~head~1.base, main_~head~1.offset; [L570] main_~n~0 := main_#t~nondet6; [L570] havoc main_#t~nondet6; [L571] init_cll_#in~n := main_~n~0; [L571] havoc init_cll_#res.base, init_cll_#res.offset; [L571] havoc init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset, init_cll_#t~malloc4.base, init_cll_#t~malloc4.offset, init_cll_#t~post3, init_cll_~i~0, init_cll_~next_node~0.base, init_cll_~next_node~0.offset, init_cll_~n, init_cll_~head~0.base, init_cll_~head~0.offset, init_cll_~curr~0.base, init_cll_~curr~0.offset; [L546-L560] init_cll_~n := init_cll_#in~n; [L548] havoc init_cll_~head~0.base, init_cll_~head~0.offset; [L549] call init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset := #Ultimate.alloc(12); [L549] init_cll_~curr~0.base, init_cll_~curr~0.offset := init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset; [L550] call write~int(0, init_cll_~curr~0.base, init_cll_~curr~0.offset, 4); [L551] init_cll_~head~0.base, init_cll_~head~0.offset := init_cll_~curr~0.base, init_cll_~curr~0.offset; [L552] init_cll_~i~0 := 1; [L552-L557] assume !(init_cll_~i~0 < init_cll_~n); [L558] call write~$Pointer$(init_cll_~head~0.base, init_cll_~head~0.offset, init_cll_~curr~0.base, 4 + init_cll_~curr~0.offset, 8); [L559] init_cll_#res.base, init_cll_#res.offset := init_cll_~head~0.base, init_cll_~head~0.offset; [L571] main_#t~ret7.base, main_#t~ret7.offset := init_cll_#res.base, init_cll_#res.offset; [L571] main_~head~1.base, main_~head~1.offset := main_#t~ret7.base, main_#t~ret7.offset; [L571] havoc main_#t~ret7.base, main_#t~ret7.offset; [L572] traverse_#in~head.base, traverse_#in~head.offset := main_~head~1.base, main_~head~1.offset; [L572] havoc traverse_#t~mem5.base, traverse_#t~mem5.offset, traverse_~head.base, traverse_~head.offset, traverse_~curr~1.base, traverse_~curr~1.offset; [L561-L567] traverse_~head.base, traverse_~head.offset := traverse_#in~head.base, traverse_#in~head.offset; [L563] traverse_~curr~1.base, traverse_~curr~1.offset := traverse_~head.base, traverse_~head.offset; [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet6, main_#t~ret7, main_~n~0, main_~head~1; [L570] main_~n~0 := main_#t~nondet6; [L570] havoc main_#t~nondet6; [L571] init_cll_#in~n := main_~n~0; [L571] havoc init_cll_#res; [L571] havoc init_cll_#t~malloc2, init_cll_#t~malloc4, init_cll_#t~post3, init_cll_~i~0, init_cll_~next_node~0, init_cll_~n, init_cll_~head~0, init_cll_~curr~0; [L546-L560] init_cll_~n := init_cll_#in~n; [L548] havoc init_cll_~head~0; [L549] FCALL call init_cll_#t~malloc2 := #Ultimate.alloc(12); [L549] init_cll_~curr~0 := init_cll_#t~malloc2; [L550] FCALL call write~int(0, { base: init_cll_~curr~0!base, offset: init_cll_~curr~0!offset }, 4); [L551] init_cll_~head~0 := init_cll_~curr~0; [L552] init_cll_~i~0 := 1; [L552-L557] COND TRUE !(init_cll_~i~0 < init_cll_~n) [L558] FCALL call write~$Pointer$(init_cll_~head~0, { base: init_cll_~curr~0!base, offset: 4 + init_cll_~curr~0!offset }, 8); [L559] init_cll_#res := init_cll_~head~0; [L571] main_#t~ret7 := init_cll_#res; [L571] main_~head~1 := main_#t~ret7; [L571] havoc main_#t~ret7; [L572] traverse_#in~head := main_~head~1; [L572] havoc traverse_#t~mem5, traverse_~head, traverse_~curr~1; [L561-L567] traverse_~head := traverse_#in~head; [L563] traverse_~curr~1 := traverse_~head; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet6, main_#t~ret7, main_~n~0, main_~head~1; [L570] main_~n~0 := main_#t~nondet6; [L570] havoc main_#t~nondet6; [L571] init_cll_#in~n := main_~n~0; [L571] havoc init_cll_#res; [L571] havoc init_cll_#t~malloc2, init_cll_#t~malloc4, init_cll_#t~post3, init_cll_~i~0, init_cll_~next_node~0, init_cll_~n, init_cll_~head~0, init_cll_~curr~0; [L546-L560] init_cll_~n := init_cll_#in~n; [L548] havoc init_cll_~head~0; [L549] FCALL call init_cll_#t~malloc2 := #Ultimate.alloc(12); [L549] init_cll_~curr~0 := init_cll_#t~malloc2; [L550] FCALL call write~int(0, { base: init_cll_~curr~0!base, offset: init_cll_~curr~0!offset }, 4); [L551] init_cll_~head~0 := init_cll_~curr~0; [L552] init_cll_~i~0 := 1; [L552-L557] COND TRUE !(init_cll_~i~0 < init_cll_~n) [L558] FCALL call write~$Pointer$(init_cll_~head~0, { base: init_cll_~curr~0!base, offset: 4 + init_cll_~curr~0!offset }, 8); [L559] init_cll_#res := init_cll_~head~0; [L571] main_#t~ret7 := init_cll_#res; [L571] main_~head~1 := main_#t~ret7; [L571] havoc main_#t~ret7; [L572] traverse_#in~head := main_~head~1; [L572] havoc traverse_#t~mem5, traverse_~head, traverse_~curr~1; [L561-L567] traverse_~head := traverse_#in~head; [L563] traverse_~curr~1 := traverse_~head; [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L570] ~n~0 := #t~nondet6; [L570] havoc #t~nondet6; [L546-L560] ~n := #in~n; [L548] havoc ~head~0; [L549] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L549] ~curr~0 := #t~malloc2; [L550] FCALL call write~int(0, { base: ~curr~0!base, offset: ~curr~0!offset }, 4); [L551] ~head~0 := ~curr~0; [L552] ~i~0 := 1; [L552-L557] COND TRUE !(~i~0 < ~n) [L558] FCALL call write~$Pointer$(~head~0, { base: ~curr~0!base, offset: 4 + ~curr~0!offset }, 8); [L559] #res := ~head~0; [L571] ~head~1 := #t~ret7; [L571] havoc #t~ret7; [L561-L567] ~head := #in~head; [L563] ~curr~1 := ~head; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L570] ~n~0 := #t~nondet6; [L570] havoc #t~nondet6; [L546-L560] ~n := #in~n; [L548] havoc ~head~0; [L549] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L549] ~curr~0 := #t~malloc2; [L550] FCALL call write~int(0, { base: ~curr~0!base, offset: ~curr~0!offset }, 4); [L551] ~head~0 := ~curr~0; [L552] ~i~0 := 1; [L552-L557] COND TRUE !(~i~0 < ~n) [L558] FCALL call write~$Pointer$(~head~0, { base: ~curr~0!base, offset: 4 + ~curr~0!offset }, 8); [L559] #res := ~head~0; [L571] ~head~1 := #t~ret7; [L571] havoc #t~ret7; [L561-L567] ~head := #in~head; [L563] ~curr~1 := ~head; [L570] int n = __VERIFIER_nondet_int(); [L548] node_t* head; [L549] node_t* curr = malloc(sizeof(node_t)); [L550] curr->val = 0 [L551] head = curr [L552] int i = 1; [L552] COND FALSE !(i < n) [L558] curr->next = head [L559] return head; [L571] node_t* head = init_cll(n); [L563] node_t* curr = head; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !!(traverse_~curr~1.base != 0 || traverse_~curr~1.offset != 0);call traverse_#t~mem5.base, traverse_#t~mem5.offset := read~$Pointer$(traverse_~curr~1.base, 4 + traverse_~curr~1.offset, 8);traverse_~curr~1.base, traverse_~curr~1.offset := traverse_#t~mem5.base, traverse_#t~mem5.offset;havoc traverse_#t~mem5.base, traverse_#t~mem5.offset; [L564-L566] assume !!(traverse_~curr~1.base != 0 || traverse_~curr~1.offset != 0); [L565] call traverse_#t~mem5.base, traverse_#t~mem5.offset := read~$Pointer$(traverse_~curr~1.base, 4 + traverse_~curr~1.offset, 8); [L565] traverse_~curr~1.base, traverse_~curr~1.offset := traverse_#t~mem5.base, traverse_#t~mem5.offset; [L565] havoc traverse_#t~mem5.base, traverse_#t~mem5.offset; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L564-L566] assume !!(traverse_~curr~1.base != 0 || traverse_~curr~1.offset != 0); [L565] call traverse_#t~mem5.base, traverse_#t~mem5.offset := read~$Pointer$(traverse_~curr~1.base, 4 + traverse_~curr~1.offset, 8); [L565] traverse_~curr~1.base, traverse_~curr~1.offset := traverse_#t~mem5.base, traverse_#t~mem5.offset; [L565] havoc traverse_#t~mem5.base, traverse_#t~mem5.offset; [L564-L566] COND FALSE !(!(traverse_~curr~1 != { base: 0, offset: 0 })) [L565] FCALL call traverse_#t~mem5 := read~$Pointer$({ base: traverse_~curr~1!base, offset: 4 + traverse_~curr~1!offset }, 8); [L565] traverse_~curr~1 := traverse_#t~mem5; [L565] havoc traverse_#t~mem5; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L564-L566] COND FALSE !(!(traverse_~curr~1 != { base: 0, offset: 0 })) [L565] FCALL call traverse_#t~mem5 := read~$Pointer$({ base: traverse_~curr~1!base, offset: 4 + traverse_~curr~1!offset }, 8); [L565] traverse_~curr~1 := traverse_#t~mem5; [L565] havoc traverse_#t~mem5; [L564-L566] COND FALSE !(!(~curr~1 != { base: 0, offset: 0 })) [L565] FCALL call #t~mem5 := read~$Pointer$({ base: ~curr~1!base, offset: 4 + ~curr~1!offset }, 8); [L565] ~curr~1 := #t~mem5; [L565] havoc #t~mem5; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L564-L566] COND FALSE !(!(~curr~1 != { base: 0, offset: 0 })) [L565] FCALL call #t~mem5 := read~$Pointer$({ base: ~curr~1!base, offset: 4 + ~curr~1!offset }, 8); [L565] ~curr~1 := #t~mem5; [L565] havoc #t~mem5; [L564] COND TRUE curr != ((void *)0) [L565] EXPR curr->next [L565] curr = curr->next ----- [2018-11-22 23:22:55,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.11 11:22:55 BoogieIcfgContainer [2018-11-22 23:22:55,782 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-22 23:22:55,783 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 23:22:55,783 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 23:22:55,783 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 23:22:55,783 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:22:53" (3/4) ... [2018-11-22 23:22:55,786 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; [?] havoc main_#res;havoc main_#t~nondet6, main_#t~ret7.base, main_#t~ret7.offset, main_~n~0, main_~head~1.base, main_~head~1.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6;init_cll_#in~n := main_~n~0;havoc init_cll_#res.base, init_cll_#res.offset;havoc init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset, init_cll_#t~malloc4.base, init_cll_#t~malloc4.offset, init_cll_#t~post3, init_cll_~i~0, init_cll_~next_node~0.base, init_cll_~next_node~0.offset, init_cll_~n, init_cll_~head~0.base, init_cll_~head~0.offset, init_cll_~curr~0.base, init_cll_~curr~0.offset;init_cll_~n := init_cll_#in~n;havoc init_cll_~head~0.base, init_cll_~head~0.offset;call init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset := #Ultimate.alloc(12);init_cll_~curr~0.base, init_cll_~curr~0.offset := init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset;call write~int(0, init_cll_~curr~0.base, init_cll_~curr~0.offset, 4);init_cll_~head~0.base, init_cll_~head~0.offset := init_cll_~curr~0.base, init_cll_~curr~0.offset;init_cll_~i~0 := 1; [?] assume !(init_cll_~i~0 < init_cll_~n); [?] call write~$Pointer$(init_cll_~head~0.base, init_cll_~head~0.offset, init_cll_~curr~0.base, 4 + init_cll_~curr~0.offset, 8);init_cll_#res.base, init_cll_#res.offset := init_cll_~head~0.base, init_cll_~head~0.offset; [?] main_#t~ret7.base, main_#t~ret7.offset := init_cll_#res.base, init_cll_#res.offset;main_~head~1.base, main_~head~1.offset := main_#t~ret7.base, main_#t~ret7.offset;havoc main_#t~ret7.base, main_#t~ret7.offset;traverse_#in~head.base, traverse_#in~head.offset := main_~head~1.base, main_~head~1.offset;havoc traverse_#t~mem5.base, traverse_#t~mem5.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; [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet6, main_#t~ret7.base, main_#t~ret7.offset, main_~n~0, main_~head~1.base, main_~head~1.offset; [L570] main_~n~0 := main_#t~nondet6; [L570] havoc main_#t~nondet6; [L571] init_cll_#in~n := main_~n~0; [L571] havoc init_cll_#res.base, init_cll_#res.offset; [L571] havoc init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset, init_cll_#t~malloc4.base, init_cll_#t~malloc4.offset, init_cll_#t~post3, init_cll_~i~0, init_cll_~next_node~0.base, init_cll_~next_node~0.offset, init_cll_~n, init_cll_~head~0.base, init_cll_~head~0.offset, init_cll_~curr~0.base, init_cll_~curr~0.offset; [L546-L560] init_cll_~n := init_cll_#in~n; [L548] havoc init_cll_~head~0.base, init_cll_~head~0.offset; [L549] call init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset := #Ultimate.alloc(12); [L549] init_cll_~curr~0.base, init_cll_~curr~0.offset := init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset; [L550] call write~int(0, init_cll_~curr~0.base, init_cll_~curr~0.offset, 4); [L551] init_cll_~head~0.base, init_cll_~head~0.offset := init_cll_~curr~0.base, init_cll_~curr~0.offset; [L552] init_cll_~i~0 := 1; [L552-L557] assume !(init_cll_~i~0 < init_cll_~n); [L558] call write~$Pointer$(init_cll_~head~0.base, init_cll_~head~0.offset, init_cll_~curr~0.base, 4 + init_cll_~curr~0.offset, 8); [L559] init_cll_#res.base, init_cll_#res.offset := init_cll_~head~0.base, init_cll_~head~0.offset; [L571] main_#t~ret7.base, main_#t~ret7.offset := init_cll_#res.base, init_cll_#res.offset; [L571] main_~head~1.base, main_~head~1.offset := main_#t~ret7.base, main_#t~ret7.offset; [L571] havoc main_#t~ret7.base, main_#t~ret7.offset; [L572] traverse_#in~head.base, traverse_#in~head.offset := main_~head~1.base, main_~head~1.offset; [L572] havoc traverse_#t~mem5.base, traverse_#t~mem5.offset, traverse_~head.base, traverse_~head.offset, traverse_~curr~1.base, traverse_~curr~1.offset; [L561-L567] traverse_~head.base, traverse_~head.offset := traverse_#in~head.base, traverse_#in~head.offset; [L563] traverse_~curr~1.base, traverse_~curr~1.offset := traverse_~head.base, traverse_~head.offset; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet6, main_#t~ret7.base, main_#t~ret7.offset, main_~n~0, main_~head~1.base, main_~head~1.offset; [L570] main_~n~0 := main_#t~nondet6; [L570] havoc main_#t~nondet6; [L571] init_cll_#in~n := main_~n~0; [L571] havoc init_cll_#res.base, init_cll_#res.offset; [L571] havoc init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset, init_cll_#t~malloc4.base, init_cll_#t~malloc4.offset, init_cll_#t~post3, init_cll_~i~0, init_cll_~next_node~0.base, init_cll_~next_node~0.offset, init_cll_~n, init_cll_~head~0.base, init_cll_~head~0.offset, init_cll_~curr~0.base, init_cll_~curr~0.offset; [L546-L560] init_cll_~n := init_cll_#in~n; [L548] havoc init_cll_~head~0.base, init_cll_~head~0.offset; [L549] call init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset := #Ultimate.alloc(12); [L549] init_cll_~curr~0.base, init_cll_~curr~0.offset := init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset; [L550] call write~int(0, init_cll_~curr~0.base, init_cll_~curr~0.offset, 4); [L551] init_cll_~head~0.base, init_cll_~head~0.offset := init_cll_~curr~0.base, init_cll_~curr~0.offset; [L552] init_cll_~i~0 := 1; [L552-L557] assume !(init_cll_~i~0 < init_cll_~n); [L558] call write~$Pointer$(init_cll_~head~0.base, init_cll_~head~0.offset, init_cll_~curr~0.base, 4 + init_cll_~curr~0.offset, 8); [L559] init_cll_#res.base, init_cll_#res.offset := init_cll_~head~0.base, init_cll_~head~0.offset; [L571] main_#t~ret7.base, main_#t~ret7.offset := init_cll_#res.base, init_cll_#res.offset; [L571] main_~head~1.base, main_~head~1.offset := main_#t~ret7.base, main_#t~ret7.offset; [L571] havoc main_#t~ret7.base, main_#t~ret7.offset; [L572] traverse_#in~head.base, traverse_#in~head.offset := main_~head~1.base, main_~head~1.offset; [L572] havoc traverse_#t~mem5.base, traverse_#t~mem5.offset, traverse_~head.base, traverse_~head.offset, traverse_~curr~1.base, traverse_~curr~1.offset; [L561-L567] traverse_~head.base, traverse_~head.offset := traverse_#in~head.base, traverse_#in~head.offset; [L563] traverse_~curr~1.base, traverse_~curr~1.offset := traverse_~head.base, traverse_~head.offset; [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet6, main_#t~ret7, main_~n~0, main_~head~1; [L570] main_~n~0 := main_#t~nondet6; [L570] havoc main_#t~nondet6; [L571] init_cll_#in~n := main_~n~0; [L571] havoc init_cll_#res; [L571] havoc init_cll_#t~malloc2, init_cll_#t~malloc4, init_cll_#t~post3, init_cll_~i~0, init_cll_~next_node~0, init_cll_~n, init_cll_~head~0, init_cll_~curr~0; [L546-L560] init_cll_~n := init_cll_#in~n; [L548] havoc init_cll_~head~0; [L549] FCALL call init_cll_#t~malloc2 := #Ultimate.alloc(12); [L549] init_cll_~curr~0 := init_cll_#t~malloc2; [L550] FCALL call write~int(0, { base: init_cll_~curr~0!base, offset: init_cll_~curr~0!offset }, 4); [L551] init_cll_~head~0 := init_cll_~curr~0; [L552] init_cll_~i~0 := 1; [L552-L557] COND TRUE !(init_cll_~i~0 < init_cll_~n) [L558] FCALL call write~$Pointer$(init_cll_~head~0, { base: init_cll_~curr~0!base, offset: 4 + init_cll_~curr~0!offset }, 8); [L559] init_cll_#res := init_cll_~head~0; [L571] main_#t~ret7 := init_cll_#res; [L571] main_~head~1 := main_#t~ret7; [L571] havoc main_#t~ret7; [L572] traverse_#in~head := main_~head~1; [L572] havoc traverse_#t~mem5, traverse_~head, traverse_~curr~1; [L561-L567] traverse_~head := traverse_#in~head; [L563] traverse_~curr~1 := traverse_~head; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet6, main_#t~ret7, main_~n~0, main_~head~1; [L570] main_~n~0 := main_#t~nondet6; [L570] havoc main_#t~nondet6; [L571] init_cll_#in~n := main_~n~0; [L571] havoc init_cll_#res; [L571] havoc init_cll_#t~malloc2, init_cll_#t~malloc4, init_cll_#t~post3, init_cll_~i~0, init_cll_~next_node~0, init_cll_~n, init_cll_~head~0, init_cll_~curr~0; [L546-L560] init_cll_~n := init_cll_#in~n; [L548] havoc init_cll_~head~0; [L549] FCALL call init_cll_#t~malloc2 := #Ultimate.alloc(12); [L549] init_cll_~curr~0 := init_cll_#t~malloc2; [L550] FCALL call write~int(0, { base: init_cll_~curr~0!base, offset: init_cll_~curr~0!offset }, 4); [L551] init_cll_~head~0 := init_cll_~curr~0; [L552] init_cll_~i~0 := 1; [L552-L557] COND TRUE !(init_cll_~i~0 < init_cll_~n) [L558] FCALL call write~$Pointer$(init_cll_~head~0, { base: init_cll_~curr~0!base, offset: 4 + init_cll_~curr~0!offset }, 8); [L559] init_cll_#res := init_cll_~head~0; [L571] main_#t~ret7 := init_cll_#res; [L571] main_~head~1 := main_#t~ret7; [L571] havoc main_#t~ret7; [L572] traverse_#in~head := main_~head~1; [L572] havoc traverse_#t~mem5, traverse_~head, traverse_~curr~1; [L561-L567] traverse_~head := traverse_#in~head; [L563] traverse_~curr~1 := traverse_~head; [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L570] ~n~0 := #t~nondet6; [L570] havoc #t~nondet6; [L546-L560] ~n := #in~n; [L548] havoc ~head~0; [L549] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L549] ~curr~0 := #t~malloc2; [L550] FCALL call write~int(0, { base: ~curr~0!base, offset: ~curr~0!offset }, 4); [L551] ~head~0 := ~curr~0; [L552] ~i~0 := 1; [L552-L557] COND TRUE !(~i~0 < ~n) [L558] FCALL call write~$Pointer$(~head~0, { base: ~curr~0!base, offset: 4 + ~curr~0!offset }, 8); [L559] #res := ~head~0; [L571] ~head~1 := #t~ret7; [L571] havoc #t~ret7; [L561-L567] ~head := #in~head; [L563] ~curr~1 := ~head; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L570] ~n~0 := #t~nondet6; [L570] havoc #t~nondet6; [L546-L560] ~n := #in~n; [L548] havoc ~head~0; [L549] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L549] ~curr~0 := #t~malloc2; [L550] FCALL call write~int(0, { base: ~curr~0!base, offset: ~curr~0!offset }, 4); [L551] ~head~0 := ~curr~0; [L552] ~i~0 := 1; [L552-L557] COND TRUE !(~i~0 < ~n) [L558] FCALL call write~$Pointer$(~head~0, { base: ~curr~0!base, offset: 4 + ~curr~0!offset }, 8); [L559] #res := ~head~0; [L571] ~head~1 := #t~ret7; [L571] havoc #t~ret7; [L561-L567] ~head := #in~head; [L563] ~curr~1 := ~head; [L570] int n = __VERIFIER_nondet_int(); [L548] node_t* head; [L549] node_t* curr = malloc(sizeof(node_t)); [L550] curr->val = 0 [L551] head = curr [L552] int i = 1; [L552] COND FALSE !(i < n) [L558] curr->next = head [L559] return head; [L571] node_t* head = init_cll(n); [L563] node_t* curr = head; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !!(traverse_~curr~1.base != 0 || traverse_~curr~1.offset != 0);call traverse_#t~mem5.base, traverse_#t~mem5.offset := read~$Pointer$(traverse_~curr~1.base, 4 + traverse_~curr~1.offset, 8);traverse_~curr~1.base, traverse_~curr~1.offset := traverse_#t~mem5.base, traverse_#t~mem5.offset;havoc traverse_#t~mem5.base, traverse_#t~mem5.offset; [L564-L566] assume !!(traverse_~curr~1.base != 0 || traverse_~curr~1.offset != 0); [L565] call traverse_#t~mem5.base, traverse_#t~mem5.offset := read~$Pointer$(traverse_~curr~1.base, 4 + traverse_~curr~1.offset, 8); [L565] traverse_~curr~1.base, traverse_~curr~1.offset := traverse_#t~mem5.base, traverse_#t~mem5.offset; [L565] havoc traverse_#t~mem5.base, traverse_#t~mem5.offset; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L564-L566] assume !!(traverse_~curr~1.base != 0 || traverse_~curr~1.offset != 0); [L565] call traverse_#t~mem5.base, traverse_#t~mem5.offset := read~$Pointer$(traverse_~curr~1.base, 4 + traverse_~curr~1.offset, 8); [L565] traverse_~curr~1.base, traverse_~curr~1.offset := traverse_#t~mem5.base, traverse_#t~mem5.offset; [L565] havoc traverse_#t~mem5.base, traverse_#t~mem5.offset; [L564-L566] COND FALSE !(!(traverse_~curr~1 != { base: 0, offset: 0 })) [L565] FCALL call traverse_#t~mem5 := read~$Pointer$({ base: traverse_~curr~1!base, offset: 4 + traverse_~curr~1!offset }, 8); [L565] traverse_~curr~1 := traverse_#t~mem5; [L565] havoc traverse_#t~mem5; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L564-L566] COND FALSE !(!(traverse_~curr~1 != { base: 0, offset: 0 })) [L565] FCALL call traverse_#t~mem5 := read~$Pointer$({ base: traverse_~curr~1!base, offset: 4 + traverse_~curr~1!offset }, 8); [L565] traverse_~curr~1 := traverse_#t~mem5; [L565] havoc traverse_#t~mem5; [L564-L566] COND FALSE !(!(~curr~1 != { base: 0, offset: 0 })) [L565] FCALL call #t~mem5 := read~$Pointer$({ base: ~curr~1!base, offset: 4 + ~curr~1!offset }, 8); [L565] ~curr~1 := #t~mem5; [L565] havoc #t~mem5; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L564-L566] COND FALSE !(!(~curr~1 != { base: 0, offset: 0 })) [L565] FCALL call #t~mem5 := read~$Pointer$({ base: ~curr~1!base, offset: 4 + ~curr~1!offset }, 8); [L565] ~curr~1 := #t~mem5; [L565] havoc #t~mem5; [L564] COND TRUE curr != ((void *)0) [L565] EXPR curr->next [L565] curr = curr->next ----- [2018-11-22 23:22:55,820 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_35fd53d6-732f-497c-be73-c69e09912501/bin-2019/uautomizer/witness.graphml [2018-11-22 23:22:55,821 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 23:22:55,821 INFO L168 Benchmark]: Toolchain (without parser) took 2876.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 956.6 MB in the beginning and 1.0 GB in the end (delta: -57.1 MB). Peak memory consumption was 84.4 MB. Max. memory is 11.5 GB. [2018-11-22 23:22:55,822 INFO L168 Benchmark]: CDTParser took 0.10 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-22 23:22:55,822 INFO L168 Benchmark]: CACSL2BoogieTranslator took 339.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -173.9 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. [2018-11-22 23:22:55,823 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-22 23:22:55,823 INFO L168 Benchmark]: Boogie Preprocessor took 19.02 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 23:22:55,824 INFO L168 Benchmark]: RCFGBuilder took 224.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-11-22 23:22:55,824 INFO L168 Benchmark]: BuchiAutomizer took 2221.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 85.5 MB). Peak memory consumption was 85.5 MB. Max. memory is 11.5 GB. [2018-11-22 23:22:55,825 INFO L168 Benchmark]: Witness Printer took 38.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-22 23:22:55,828 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.10 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 339.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -173.9 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.02 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 224.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2221.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 85.5 MB). Peak memory consumption was 85.5 MB. Max. memory is 11.5 GB. * Witness Printer took 38.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function n + -1 * i and consists of 5 locations. The remainder module has 8 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.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. 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 8 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 9 SDtfs, 9 SDslu, 14 SDs, 0 SdLazy, 6 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital254 mio100 ax100 hnf100 lsp97 ukn41 mio100 lsp24 div100 bol100 ite100 ukn100 eq196 hnf87 smp100 dnf162 smp100 tf100 neg94 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 51ms VariablesStem: 3 VariablesLoop: 3 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: 564]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {i=1, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@78ffed61=0, \result=0, next_node=0, \result=2, next_node=0, head=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1940bda=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@78ffed61=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7f3c090a=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@3816825=0, head=0, head=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@271f782b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@271f782b=0, curr=0, \old(n)=0, n=0, head=2, n=0, head=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@58a09f4a=0, head=0, head=2, curr=2, NULL=0, curr=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@58a09f4a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7f3c090a=0, curr=2, head=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 564]: Nonterminating execution ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; [?] havoc main_#res;havoc main_#t~nondet6, main_#t~ret7.base, main_#t~ret7.offset, main_~n~0, main_~head~1.base, main_~head~1.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6;init_cll_#in~n := main_~n~0;havoc init_cll_#res.base, init_cll_#res.offset;havoc init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset, init_cll_#t~malloc4.base, init_cll_#t~malloc4.offset, init_cll_#t~post3, init_cll_~i~0, init_cll_~next_node~0.base, init_cll_~next_node~0.offset, init_cll_~n, init_cll_~head~0.base, init_cll_~head~0.offset, init_cll_~curr~0.base, init_cll_~curr~0.offset;init_cll_~n := init_cll_#in~n;havoc init_cll_~head~0.base, init_cll_~head~0.offset;call init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset := #Ultimate.alloc(12);init_cll_~curr~0.base, init_cll_~curr~0.offset := init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset;call write~int(0, init_cll_~curr~0.base, init_cll_~curr~0.offset, 4);init_cll_~head~0.base, init_cll_~head~0.offset := init_cll_~curr~0.base, init_cll_~curr~0.offset;init_cll_~i~0 := 1; [?] assume !(init_cll_~i~0 < init_cll_~n); [?] call write~$Pointer$(init_cll_~head~0.base, init_cll_~head~0.offset, init_cll_~curr~0.base, 4 + init_cll_~curr~0.offset, 8);init_cll_#res.base, init_cll_#res.offset := init_cll_~head~0.base, init_cll_~head~0.offset; [?] main_#t~ret7.base, main_#t~ret7.offset := init_cll_#res.base, init_cll_#res.offset;main_~head~1.base, main_~head~1.offset := main_#t~ret7.base, main_#t~ret7.offset;havoc main_#t~ret7.base, main_#t~ret7.offset;traverse_#in~head.base, traverse_#in~head.offset := main_~head~1.base, main_~head~1.offset;havoc traverse_#t~mem5.base, traverse_#t~mem5.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; [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet6, main_#t~ret7.base, main_#t~ret7.offset, main_~n~0, main_~head~1.base, main_~head~1.offset; [L570] main_~n~0 := main_#t~nondet6; [L570] havoc main_#t~nondet6; [L571] init_cll_#in~n := main_~n~0; [L571] havoc init_cll_#res.base, init_cll_#res.offset; [L571] havoc init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset, init_cll_#t~malloc4.base, init_cll_#t~malloc4.offset, init_cll_#t~post3, init_cll_~i~0, init_cll_~next_node~0.base, init_cll_~next_node~0.offset, init_cll_~n, init_cll_~head~0.base, init_cll_~head~0.offset, init_cll_~curr~0.base, init_cll_~curr~0.offset; [L546-L560] init_cll_~n := init_cll_#in~n; [L548] havoc init_cll_~head~0.base, init_cll_~head~0.offset; [L549] call init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset := #Ultimate.alloc(12); [L549] init_cll_~curr~0.base, init_cll_~curr~0.offset := init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset; [L550] call write~int(0, init_cll_~curr~0.base, init_cll_~curr~0.offset, 4); [L551] init_cll_~head~0.base, init_cll_~head~0.offset := init_cll_~curr~0.base, init_cll_~curr~0.offset; [L552] init_cll_~i~0 := 1; [L552-L557] assume !(init_cll_~i~0 < init_cll_~n); [L558] call write~$Pointer$(init_cll_~head~0.base, init_cll_~head~0.offset, init_cll_~curr~0.base, 4 + init_cll_~curr~0.offset, 8); [L559] init_cll_#res.base, init_cll_#res.offset := init_cll_~head~0.base, init_cll_~head~0.offset; [L571] main_#t~ret7.base, main_#t~ret7.offset := init_cll_#res.base, init_cll_#res.offset; [L571] main_~head~1.base, main_~head~1.offset := main_#t~ret7.base, main_#t~ret7.offset; [L571] havoc main_#t~ret7.base, main_#t~ret7.offset; [L572] traverse_#in~head.base, traverse_#in~head.offset := main_~head~1.base, main_~head~1.offset; [L572] havoc traverse_#t~mem5.base, traverse_#t~mem5.offset, traverse_~head.base, traverse_~head.offset, traverse_~curr~1.base, traverse_~curr~1.offset; [L561-L567] traverse_~head.base, traverse_~head.offset := traverse_#in~head.base, traverse_#in~head.offset; [L563] traverse_~curr~1.base, traverse_~curr~1.offset := traverse_~head.base, traverse_~head.offset; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet6, main_#t~ret7.base, main_#t~ret7.offset, main_~n~0, main_~head~1.base, main_~head~1.offset; [L570] main_~n~0 := main_#t~nondet6; [L570] havoc main_#t~nondet6; [L571] init_cll_#in~n := main_~n~0; [L571] havoc init_cll_#res.base, init_cll_#res.offset; [L571] havoc init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset, init_cll_#t~malloc4.base, init_cll_#t~malloc4.offset, init_cll_#t~post3, init_cll_~i~0, init_cll_~next_node~0.base, init_cll_~next_node~0.offset, init_cll_~n, init_cll_~head~0.base, init_cll_~head~0.offset, init_cll_~curr~0.base, init_cll_~curr~0.offset; [L546-L560] init_cll_~n := init_cll_#in~n; [L548] havoc init_cll_~head~0.base, init_cll_~head~0.offset; [L549] call init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset := #Ultimate.alloc(12); [L549] init_cll_~curr~0.base, init_cll_~curr~0.offset := init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset; [L550] call write~int(0, init_cll_~curr~0.base, init_cll_~curr~0.offset, 4); [L551] init_cll_~head~0.base, init_cll_~head~0.offset := init_cll_~curr~0.base, init_cll_~curr~0.offset; [L552] init_cll_~i~0 := 1; [L552-L557] assume !(init_cll_~i~0 < init_cll_~n); [L558] call write~$Pointer$(init_cll_~head~0.base, init_cll_~head~0.offset, init_cll_~curr~0.base, 4 + init_cll_~curr~0.offset, 8); [L559] init_cll_#res.base, init_cll_#res.offset := init_cll_~head~0.base, init_cll_~head~0.offset; [L571] main_#t~ret7.base, main_#t~ret7.offset := init_cll_#res.base, init_cll_#res.offset; [L571] main_~head~1.base, main_~head~1.offset := main_#t~ret7.base, main_#t~ret7.offset; [L571] havoc main_#t~ret7.base, main_#t~ret7.offset; [L572] traverse_#in~head.base, traverse_#in~head.offset := main_~head~1.base, main_~head~1.offset; [L572] havoc traverse_#t~mem5.base, traverse_#t~mem5.offset, traverse_~head.base, traverse_~head.offset, traverse_~curr~1.base, traverse_~curr~1.offset; [L561-L567] traverse_~head.base, traverse_~head.offset := traverse_#in~head.base, traverse_#in~head.offset; [L563] traverse_~curr~1.base, traverse_~curr~1.offset := traverse_~head.base, traverse_~head.offset; [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet6, main_#t~ret7, main_~n~0, main_~head~1; [L570] main_~n~0 := main_#t~nondet6; [L570] havoc main_#t~nondet6; [L571] init_cll_#in~n := main_~n~0; [L571] havoc init_cll_#res; [L571] havoc init_cll_#t~malloc2, init_cll_#t~malloc4, init_cll_#t~post3, init_cll_~i~0, init_cll_~next_node~0, init_cll_~n, init_cll_~head~0, init_cll_~curr~0; [L546-L560] init_cll_~n := init_cll_#in~n; [L548] havoc init_cll_~head~0; [L549] FCALL call init_cll_#t~malloc2 := #Ultimate.alloc(12); [L549] init_cll_~curr~0 := init_cll_#t~malloc2; [L550] FCALL call write~int(0, { base: init_cll_~curr~0!base, offset: init_cll_~curr~0!offset }, 4); [L551] init_cll_~head~0 := init_cll_~curr~0; [L552] init_cll_~i~0 := 1; [L552-L557] COND TRUE !(init_cll_~i~0 < init_cll_~n) [L558] FCALL call write~$Pointer$(init_cll_~head~0, { base: init_cll_~curr~0!base, offset: 4 + init_cll_~curr~0!offset }, 8); [L559] init_cll_#res := init_cll_~head~0; [L571] main_#t~ret7 := init_cll_#res; [L571] main_~head~1 := main_#t~ret7; [L571] havoc main_#t~ret7; [L572] traverse_#in~head := main_~head~1; [L572] havoc traverse_#t~mem5, traverse_~head, traverse_~curr~1; [L561-L567] traverse_~head := traverse_#in~head; [L563] traverse_~curr~1 := traverse_~head; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet6, main_#t~ret7, main_~n~0, main_~head~1; [L570] main_~n~0 := main_#t~nondet6; [L570] havoc main_#t~nondet6; [L571] init_cll_#in~n := main_~n~0; [L571] havoc init_cll_#res; [L571] havoc init_cll_#t~malloc2, init_cll_#t~malloc4, init_cll_#t~post3, init_cll_~i~0, init_cll_~next_node~0, init_cll_~n, init_cll_~head~0, init_cll_~curr~0; [L546-L560] init_cll_~n := init_cll_#in~n; [L548] havoc init_cll_~head~0; [L549] FCALL call init_cll_#t~malloc2 := #Ultimate.alloc(12); [L549] init_cll_~curr~0 := init_cll_#t~malloc2; [L550] FCALL call write~int(0, { base: init_cll_~curr~0!base, offset: init_cll_~curr~0!offset }, 4); [L551] init_cll_~head~0 := init_cll_~curr~0; [L552] init_cll_~i~0 := 1; [L552-L557] COND TRUE !(init_cll_~i~0 < init_cll_~n) [L558] FCALL call write~$Pointer$(init_cll_~head~0, { base: init_cll_~curr~0!base, offset: 4 + init_cll_~curr~0!offset }, 8); [L559] init_cll_#res := init_cll_~head~0; [L571] main_#t~ret7 := init_cll_#res; [L571] main_~head~1 := main_#t~ret7; [L571] havoc main_#t~ret7; [L572] traverse_#in~head := main_~head~1; [L572] havoc traverse_#t~mem5, traverse_~head, traverse_~curr~1; [L561-L567] traverse_~head := traverse_#in~head; [L563] traverse_~curr~1 := traverse_~head; [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L570] ~n~0 := #t~nondet6; [L570] havoc #t~nondet6; [L546-L560] ~n := #in~n; [L548] havoc ~head~0; [L549] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L549] ~curr~0 := #t~malloc2; [L550] FCALL call write~int(0, { base: ~curr~0!base, offset: ~curr~0!offset }, 4); [L551] ~head~0 := ~curr~0; [L552] ~i~0 := 1; [L552-L557] COND TRUE !(~i~0 < ~n) [L558] FCALL call write~$Pointer$(~head~0, { base: ~curr~0!base, offset: 4 + ~curr~0!offset }, 8); [L559] #res := ~head~0; [L571] ~head~1 := #t~ret7; [L571] havoc #t~ret7; [L561-L567] ~head := #in~head; [L563] ~curr~1 := ~head; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L570] ~n~0 := #t~nondet6; [L570] havoc #t~nondet6; [L546-L560] ~n := #in~n; [L548] havoc ~head~0; [L549] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L549] ~curr~0 := #t~malloc2; [L550] FCALL call write~int(0, { base: ~curr~0!base, offset: ~curr~0!offset }, 4); [L551] ~head~0 := ~curr~0; [L552] ~i~0 := 1; [L552-L557] COND TRUE !(~i~0 < ~n) [L558] FCALL call write~$Pointer$(~head~0, { base: ~curr~0!base, offset: 4 + ~curr~0!offset }, 8); [L559] #res := ~head~0; [L571] ~head~1 := #t~ret7; [L571] havoc #t~ret7; [L561-L567] ~head := #in~head; [L563] ~curr~1 := ~head; [L570] int n = __VERIFIER_nondet_int(); [L548] node_t* head; [L549] node_t* curr = malloc(sizeof(node_t)); [L550] curr->val = 0 [L551] head = curr [L552] int i = 1; [L552] COND FALSE !(i < n) [L558] curr->next = head [L559] return head; [L571] node_t* head = init_cll(n); [L563] node_t* curr = head; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !!(traverse_~curr~1.base != 0 || traverse_~curr~1.offset != 0);call traverse_#t~mem5.base, traverse_#t~mem5.offset := read~$Pointer$(traverse_~curr~1.base, 4 + traverse_~curr~1.offset, 8);traverse_~curr~1.base, traverse_~curr~1.offset := traverse_#t~mem5.base, traverse_#t~mem5.offset;havoc traverse_#t~mem5.base, traverse_#t~mem5.offset; [L564-L566] assume !!(traverse_~curr~1.base != 0 || traverse_~curr~1.offset != 0); [L565] call traverse_#t~mem5.base, traverse_#t~mem5.offset := read~$Pointer$(traverse_~curr~1.base, 4 + traverse_~curr~1.offset, 8); [L565] traverse_~curr~1.base, traverse_~curr~1.offset := traverse_#t~mem5.base, traverse_#t~mem5.offset; [L565] havoc traverse_#t~mem5.base, traverse_#t~mem5.offset; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L564-L566] assume !!(traverse_~curr~1.base != 0 || traverse_~curr~1.offset != 0); [L565] call traverse_#t~mem5.base, traverse_#t~mem5.offset := read~$Pointer$(traverse_~curr~1.base, 4 + traverse_~curr~1.offset, 8); [L565] traverse_~curr~1.base, traverse_~curr~1.offset := traverse_#t~mem5.base, traverse_#t~mem5.offset; [L565] havoc traverse_#t~mem5.base, traverse_#t~mem5.offset; [L564-L566] COND FALSE !(!(traverse_~curr~1 != { base: 0, offset: 0 })) [L565] FCALL call traverse_#t~mem5 := read~$Pointer$({ base: traverse_~curr~1!base, offset: 4 + traverse_~curr~1!offset }, 8); [L565] traverse_~curr~1 := traverse_#t~mem5; [L565] havoc traverse_#t~mem5; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L564-L566] COND FALSE !(!(traverse_~curr~1 != { base: 0, offset: 0 })) [L565] FCALL call traverse_#t~mem5 := read~$Pointer$({ base: traverse_~curr~1!base, offset: 4 + traverse_~curr~1!offset }, 8); [L565] traverse_~curr~1 := traverse_#t~mem5; [L565] havoc traverse_#t~mem5; [L564-L566] COND FALSE !(!(~curr~1 != { base: 0, offset: 0 })) [L565] FCALL call #t~mem5 := read~$Pointer$({ base: ~curr~1!base, offset: 4 + ~curr~1!offset }, 8); [L565] ~curr~1 := #t~mem5; [L565] havoc #t~mem5; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L564-L566] COND FALSE !(!(~curr~1 != { base: 0, offset: 0 })) [L565] FCALL call #t~mem5 := read~$Pointer$({ base: ~curr~1!base, offset: 4 + ~curr~1!offset }, 8); [L565] ~curr~1 := #t~mem5; [L565] havoc #t~mem5; [L564] COND TRUE curr != ((void *)0) [L565] EXPR curr->next [L565] curr = curr->next ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; [?] havoc main_#res;havoc main_#t~nondet6, main_#t~ret7.base, main_#t~ret7.offset, main_~n~0, main_~head~1.base, main_~head~1.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6;init_cll_#in~n := main_~n~0;havoc init_cll_#res.base, init_cll_#res.offset;havoc init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset, init_cll_#t~malloc4.base, init_cll_#t~malloc4.offset, init_cll_#t~post3, init_cll_~i~0, init_cll_~next_node~0.base, init_cll_~next_node~0.offset, init_cll_~n, init_cll_~head~0.base, init_cll_~head~0.offset, init_cll_~curr~0.base, init_cll_~curr~0.offset;init_cll_~n := init_cll_#in~n;havoc init_cll_~head~0.base, init_cll_~head~0.offset;call init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset := #Ultimate.alloc(12);init_cll_~curr~0.base, init_cll_~curr~0.offset := init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset;call write~int(0, init_cll_~curr~0.base, init_cll_~curr~0.offset, 4);init_cll_~head~0.base, init_cll_~head~0.offset := init_cll_~curr~0.base, init_cll_~curr~0.offset;init_cll_~i~0 := 1; [?] assume !(init_cll_~i~0 < init_cll_~n); [?] call write~$Pointer$(init_cll_~head~0.base, init_cll_~head~0.offset, init_cll_~curr~0.base, 4 + init_cll_~curr~0.offset, 8);init_cll_#res.base, init_cll_#res.offset := init_cll_~head~0.base, init_cll_~head~0.offset; [?] main_#t~ret7.base, main_#t~ret7.offset := init_cll_#res.base, init_cll_#res.offset;main_~head~1.base, main_~head~1.offset := main_#t~ret7.base, main_#t~ret7.offset;havoc main_#t~ret7.base, main_#t~ret7.offset;traverse_#in~head.base, traverse_#in~head.offset := main_~head~1.base, main_~head~1.offset;havoc traverse_#t~mem5.base, traverse_#t~mem5.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; [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet6, main_#t~ret7.base, main_#t~ret7.offset, main_~n~0, main_~head~1.base, main_~head~1.offset; [L570] main_~n~0 := main_#t~nondet6; [L570] havoc main_#t~nondet6; [L571] init_cll_#in~n := main_~n~0; [L571] havoc init_cll_#res.base, init_cll_#res.offset; [L571] havoc init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset, init_cll_#t~malloc4.base, init_cll_#t~malloc4.offset, init_cll_#t~post3, init_cll_~i~0, init_cll_~next_node~0.base, init_cll_~next_node~0.offset, init_cll_~n, init_cll_~head~0.base, init_cll_~head~0.offset, init_cll_~curr~0.base, init_cll_~curr~0.offset; [L546-L560] init_cll_~n := init_cll_#in~n; [L548] havoc init_cll_~head~0.base, init_cll_~head~0.offset; [L549] call init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset := #Ultimate.alloc(12); [L549] init_cll_~curr~0.base, init_cll_~curr~0.offset := init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset; [L550] call write~int(0, init_cll_~curr~0.base, init_cll_~curr~0.offset, 4); [L551] init_cll_~head~0.base, init_cll_~head~0.offset := init_cll_~curr~0.base, init_cll_~curr~0.offset; [L552] init_cll_~i~0 := 1; [L552-L557] assume !(init_cll_~i~0 < init_cll_~n); [L558] call write~$Pointer$(init_cll_~head~0.base, init_cll_~head~0.offset, init_cll_~curr~0.base, 4 + init_cll_~curr~0.offset, 8); [L559] init_cll_#res.base, init_cll_#res.offset := init_cll_~head~0.base, init_cll_~head~0.offset; [L571] main_#t~ret7.base, main_#t~ret7.offset := init_cll_#res.base, init_cll_#res.offset; [L571] main_~head~1.base, main_~head~1.offset := main_#t~ret7.base, main_#t~ret7.offset; [L571] havoc main_#t~ret7.base, main_#t~ret7.offset; [L572] traverse_#in~head.base, traverse_#in~head.offset := main_~head~1.base, main_~head~1.offset; [L572] havoc traverse_#t~mem5.base, traverse_#t~mem5.offset, traverse_~head.base, traverse_~head.offset, traverse_~curr~1.base, traverse_~curr~1.offset; [L561-L567] traverse_~head.base, traverse_~head.offset := traverse_#in~head.base, traverse_#in~head.offset; [L563] traverse_~curr~1.base, traverse_~curr~1.offset := traverse_~head.base, traverse_~head.offset; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet6, main_#t~ret7.base, main_#t~ret7.offset, main_~n~0, main_~head~1.base, main_~head~1.offset; [L570] main_~n~0 := main_#t~nondet6; [L570] havoc main_#t~nondet6; [L571] init_cll_#in~n := main_~n~0; [L571] havoc init_cll_#res.base, init_cll_#res.offset; [L571] havoc init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset, init_cll_#t~malloc4.base, init_cll_#t~malloc4.offset, init_cll_#t~post3, init_cll_~i~0, init_cll_~next_node~0.base, init_cll_~next_node~0.offset, init_cll_~n, init_cll_~head~0.base, init_cll_~head~0.offset, init_cll_~curr~0.base, init_cll_~curr~0.offset; [L546-L560] init_cll_~n := init_cll_#in~n; [L548] havoc init_cll_~head~0.base, init_cll_~head~0.offset; [L549] call init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset := #Ultimate.alloc(12); [L549] init_cll_~curr~0.base, init_cll_~curr~0.offset := init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset; [L550] call write~int(0, init_cll_~curr~0.base, init_cll_~curr~0.offset, 4); [L551] init_cll_~head~0.base, init_cll_~head~0.offset := init_cll_~curr~0.base, init_cll_~curr~0.offset; [L552] init_cll_~i~0 := 1; [L552-L557] assume !(init_cll_~i~0 < init_cll_~n); [L558] call write~$Pointer$(init_cll_~head~0.base, init_cll_~head~0.offset, init_cll_~curr~0.base, 4 + init_cll_~curr~0.offset, 8); [L559] init_cll_#res.base, init_cll_#res.offset := init_cll_~head~0.base, init_cll_~head~0.offset; [L571] main_#t~ret7.base, main_#t~ret7.offset := init_cll_#res.base, init_cll_#res.offset; [L571] main_~head~1.base, main_~head~1.offset := main_#t~ret7.base, main_#t~ret7.offset; [L571] havoc main_#t~ret7.base, main_#t~ret7.offset; [L572] traverse_#in~head.base, traverse_#in~head.offset := main_~head~1.base, main_~head~1.offset; [L572] havoc traverse_#t~mem5.base, traverse_#t~mem5.offset, traverse_~head.base, traverse_~head.offset, traverse_~curr~1.base, traverse_~curr~1.offset; [L561-L567] traverse_~head.base, traverse_~head.offset := traverse_#in~head.base, traverse_#in~head.offset; [L563] traverse_~curr~1.base, traverse_~curr~1.offset := traverse_~head.base, traverse_~head.offset; [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet6, main_#t~ret7, main_~n~0, main_~head~1; [L570] main_~n~0 := main_#t~nondet6; [L570] havoc main_#t~nondet6; [L571] init_cll_#in~n := main_~n~0; [L571] havoc init_cll_#res; [L571] havoc init_cll_#t~malloc2, init_cll_#t~malloc4, init_cll_#t~post3, init_cll_~i~0, init_cll_~next_node~0, init_cll_~n, init_cll_~head~0, init_cll_~curr~0; [L546-L560] init_cll_~n := init_cll_#in~n; [L548] havoc init_cll_~head~0; [L549] FCALL call init_cll_#t~malloc2 := #Ultimate.alloc(12); [L549] init_cll_~curr~0 := init_cll_#t~malloc2; [L550] FCALL call write~int(0, { base: init_cll_~curr~0!base, offset: init_cll_~curr~0!offset }, 4); [L551] init_cll_~head~0 := init_cll_~curr~0; [L552] init_cll_~i~0 := 1; [L552-L557] COND TRUE !(init_cll_~i~0 < init_cll_~n) [L558] FCALL call write~$Pointer$(init_cll_~head~0, { base: init_cll_~curr~0!base, offset: 4 + init_cll_~curr~0!offset }, 8); [L559] init_cll_#res := init_cll_~head~0; [L571] main_#t~ret7 := init_cll_#res; [L571] main_~head~1 := main_#t~ret7; [L571] havoc main_#t~ret7; [L572] traverse_#in~head := main_~head~1; [L572] havoc traverse_#t~mem5, traverse_~head, traverse_~curr~1; [L561-L567] traverse_~head := traverse_#in~head; [L563] traverse_~curr~1 := traverse_~head; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet6, main_#t~ret7, main_~n~0, main_~head~1; [L570] main_~n~0 := main_#t~nondet6; [L570] havoc main_#t~nondet6; [L571] init_cll_#in~n := main_~n~0; [L571] havoc init_cll_#res; [L571] havoc init_cll_#t~malloc2, init_cll_#t~malloc4, init_cll_#t~post3, init_cll_~i~0, init_cll_~next_node~0, init_cll_~n, init_cll_~head~0, init_cll_~curr~0; [L546-L560] init_cll_~n := init_cll_#in~n; [L548] havoc init_cll_~head~0; [L549] FCALL call init_cll_#t~malloc2 := #Ultimate.alloc(12); [L549] init_cll_~curr~0 := init_cll_#t~malloc2; [L550] FCALL call write~int(0, { base: init_cll_~curr~0!base, offset: init_cll_~curr~0!offset }, 4); [L551] init_cll_~head~0 := init_cll_~curr~0; [L552] init_cll_~i~0 := 1; [L552-L557] COND TRUE !(init_cll_~i~0 < init_cll_~n) [L558] FCALL call write~$Pointer$(init_cll_~head~0, { base: init_cll_~curr~0!base, offset: 4 + init_cll_~curr~0!offset }, 8); [L559] init_cll_#res := init_cll_~head~0; [L571] main_#t~ret7 := init_cll_#res; [L571] main_~head~1 := main_#t~ret7; [L571] havoc main_#t~ret7; [L572] traverse_#in~head := main_~head~1; [L572] havoc traverse_#t~mem5, traverse_~head, traverse_~curr~1; [L561-L567] traverse_~head := traverse_#in~head; [L563] traverse_~curr~1 := traverse_~head; [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L570] ~n~0 := #t~nondet6; [L570] havoc #t~nondet6; [L546-L560] ~n := #in~n; [L548] havoc ~head~0; [L549] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L549] ~curr~0 := #t~malloc2; [L550] FCALL call write~int(0, { base: ~curr~0!base, offset: ~curr~0!offset }, 4); [L551] ~head~0 := ~curr~0; [L552] ~i~0 := 1; [L552-L557] COND TRUE !(~i~0 < ~n) [L558] FCALL call write~$Pointer$(~head~0, { base: ~curr~0!base, offset: 4 + ~curr~0!offset }, 8); [L559] #res := ~head~0; [L571] ~head~1 := #t~ret7; [L571] havoc #t~ret7; [L561-L567] ~head := #in~head; [L563] ~curr~1 := ~head; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L570] ~n~0 := #t~nondet6; [L570] havoc #t~nondet6; [L546-L560] ~n := #in~n; [L548] havoc ~head~0; [L549] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L549] ~curr~0 := #t~malloc2; [L550] FCALL call write~int(0, { base: ~curr~0!base, offset: ~curr~0!offset }, 4); [L551] ~head~0 := ~curr~0; [L552] ~i~0 := 1; [L552-L557] COND TRUE !(~i~0 < ~n) [L558] FCALL call write~$Pointer$(~head~0, { base: ~curr~0!base, offset: 4 + ~curr~0!offset }, 8); [L559] #res := ~head~0; [L571] ~head~1 := #t~ret7; [L571] havoc #t~ret7; [L561-L567] ~head := #in~head; [L563] ~curr~1 := ~head; [L570] int n = __VERIFIER_nondet_int(); [L548] node_t* head; [L549] node_t* curr = malloc(sizeof(node_t)); [L550] curr->val = 0 [L551] head = curr [L552] int i = 1; [L552] COND FALSE !(i < n) [L558] curr->next = head [L559] return head; [L571] node_t* head = init_cll(n); [L563] node_t* curr = head; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !!(traverse_~curr~1.base != 0 || traverse_~curr~1.offset != 0);call traverse_#t~mem5.base, traverse_#t~mem5.offset := read~$Pointer$(traverse_~curr~1.base, 4 + traverse_~curr~1.offset, 8);traverse_~curr~1.base, traverse_~curr~1.offset := traverse_#t~mem5.base, traverse_#t~mem5.offset;havoc traverse_#t~mem5.base, traverse_#t~mem5.offset; [L564-L566] assume !!(traverse_~curr~1.base != 0 || traverse_~curr~1.offset != 0); [L565] call traverse_#t~mem5.base, traverse_#t~mem5.offset := read~$Pointer$(traverse_~curr~1.base, 4 + traverse_~curr~1.offset, 8); [L565] traverse_~curr~1.base, traverse_~curr~1.offset := traverse_#t~mem5.base, traverse_#t~mem5.offset; [L565] havoc traverse_#t~mem5.base, traverse_#t~mem5.offset; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L564-L566] assume !!(traverse_~curr~1.base != 0 || traverse_~curr~1.offset != 0); [L565] call traverse_#t~mem5.base, traverse_#t~mem5.offset := read~$Pointer$(traverse_~curr~1.base, 4 + traverse_~curr~1.offset, 8); [L565] traverse_~curr~1.base, traverse_~curr~1.offset := traverse_#t~mem5.base, traverse_#t~mem5.offset; [L565] havoc traverse_#t~mem5.base, traverse_#t~mem5.offset; [L564-L566] COND FALSE !(!(traverse_~curr~1 != { base: 0, offset: 0 })) [L565] FCALL call traverse_#t~mem5 := read~$Pointer$({ base: traverse_~curr~1!base, offset: 4 + traverse_~curr~1!offset }, 8); [L565] traverse_~curr~1 := traverse_#t~mem5; [L565] havoc traverse_#t~mem5; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L564-L566] COND FALSE !(!(traverse_~curr~1 != { base: 0, offset: 0 })) [L565] FCALL call traverse_#t~mem5 := read~$Pointer$({ base: traverse_~curr~1!base, offset: 4 + traverse_~curr~1!offset }, 8); [L565] traverse_~curr~1 := traverse_#t~mem5; [L565] havoc traverse_#t~mem5; [L564-L566] COND FALSE !(!(~curr~1 != { base: 0, offset: 0 })) [L565] FCALL call #t~mem5 := read~$Pointer$({ base: ~curr~1!base, offset: 4 + ~curr~1!offset }, 8); [L565] ~curr~1 := #t~mem5; [L565] havoc #t~mem5; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L564-L566] COND FALSE !(!(~curr~1 != { base: 0, offset: 0 })) [L565] FCALL call #t~mem5 := read~$Pointer$({ base: ~curr~1!base, offset: 4 + ~curr~1!offset }, 8); [L565] ~curr~1 := #t~mem5; [L565] havoc #t~mem5; [L564] COND TRUE curr != ((void *)0) [L565] EXPR curr->next [L565] curr = curr->next ----- Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L570] int n = __VERIFIER_nondet_int(); [L548] node_t* head; [L549] node_t* curr = malloc(sizeof(node_t)); [L550] curr->val = 0 [L551] head = curr [L552] int i = 1; [L552] COND FALSE !(i < n) [L558] curr->next = head [L559] return head; [L571] node_t* head = init_cll(n); [L563] node_t* curr = head; Loop: [L564] COND TRUE curr != ((void *)0) [L565] EXPR curr->next [L565] curr = curr->next End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...