./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-linkedlists/nondet_ll_search-alloca_false-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_13208ec5-e59c-4791-9485-094c8d32017f/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_13208ec5-e59c-4791-9485-094c8d32017f/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_13208ec5-e59c-4791-9485-094c8d32017f/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_13208ec5-e59c-4791-9485-094c8d32017f/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-linkedlists/nondet_ll_search-alloca_false-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_13208ec5-e59c-4791-9485-094c8d32017f/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_13208ec5-e59c-4791-9485-094c8d32017f/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 29a51818b617f99bc080ce25bd5bb0f6016d86c9 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 10:28:56,164 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 10:28:56,165 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 10:28:56,172 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 10:28:56,172 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 10:28:56,173 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 10:28:56,173 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 10:28:56,174 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 10:28:56,175 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 10:28:56,176 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 10:28:56,177 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 10:28:56,177 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 10:28:56,177 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 10:28:56,178 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 10:28:56,179 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 10:28:56,179 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 10:28:56,180 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 10:28:56,181 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 10:28:56,182 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 10:28:56,183 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 10:28:56,184 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 10:28:56,185 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 10:28:56,186 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 10:28:56,186 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 10:28:56,186 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 10:28:56,187 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 10:28:56,188 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 10:28:56,188 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 10:28:56,189 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 10:28:56,189 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 10:28:56,190 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 10:28:56,190 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 10:28:56,190 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 10:28:56,190 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 10:28:56,191 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 10:28:56,192 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 10:28:56,192 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_13208ec5-e59c-4791-9485-094c8d32017f/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 10:28:56,201 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 10:28:56,202 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 10:28:56,202 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 10:28:56,203 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 10:28:56,203 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 10:28:56,203 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 10:28:56,203 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 10:28:56,203 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 10:28:56,203 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 10:28:56,203 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 10:28:56,204 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 10:28:56,204 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 10:28:56,204 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 10:28:56,204 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 10:28:56,204 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 10:28:56,204 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 10:28:56,204 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 10:28:56,204 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 10:28:56,205 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 10:28:56,205 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 10:28:56,205 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 10:28:56,205 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 10:28:56,205 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 10:28:56,205 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 10:28:56,205 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 10:28:56,206 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 10:28:56,206 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 10:28:56,206 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 10:28:56,206 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_13208ec5-e59c-4791-9485-094c8d32017f/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 -> 29a51818b617f99bc080ce25bd5bb0f6016d86c9 [2018-11-10 10:28:56,228 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 10:28:56,237 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 10:28:56,239 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 10:28:56,240 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 10:28:56,241 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 10:28:56,241 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_13208ec5-e59c-4791-9485-094c8d32017f/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-linkedlists/nondet_ll_search-alloca_false-termination.c.i [2018-11-10 10:28:56,275 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_13208ec5-e59c-4791-9485-094c8d32017f/bin-2019/uautomizer/data/44617eeda/515c1ecd39884fcc8474ba3827b5af8e/FLAGf8e727b23 [2018-11-10 10:28:56,630 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 10:28:56,631 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_13208ec5-e59c-4791-9485-094c8d32017f/sv-benchmarks/c/termination-memory-linkedlists/nondet_ll_search-alloca_false-termination.c.i [2018-11-10 10:28:56,639 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_13208ec5-e59c-4791-9485-094c8d32017f/bin-2019/uautomizer/data/44617eeda/515c1ecd39884fcc8474ba3827b5af8e/FLAGf8e727b23 [2018-11-10 10:28:56,650 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_13208ec5-e59c-4791-9485-094c8d32017f/bin-2019/uautomizer/data/44617eeda/515c1ecd39884fcc8474ba3827b5af8e [2018-11-10 10:28:56,653 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 10:28:56,654 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 10:28:56,655 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 10:28:56,655 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 10:28:56,658 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 10:28:56,659 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:28:56" (1/1) ... [2018-11-10 10:28:56,661 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4943cf3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:56, skipping insertion in model container [2018-11-10 10:28:56,661 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:28:56" (1/1) ... [2018-11-10 10:28:56,669 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 10:28:56,699 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 10:28:56,903 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:28:56,911 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 10:28:56,942 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:28:56,970 INFO L193 MainTranslator]: Completed translation [2018-11-10 10:28:56,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:56 WrapperNode [2018-11-10 10:28:56,971 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 10:28:56,971 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 10:28:56,972 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 10:28:56,972 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 10:28:57,017 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:56" (1/1) ... [2018-11-10 10:28:57,030 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:56" (1/1) ... [2018-11-10 10:28:57,047 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 10:28:57,048 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 10:28:57,048 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 10:28:57,048 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 10:28:57,055 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:56" (1/1) ... [2018-11-10 10:28:57,055 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:56" (1/1) ... [2018-11-10 10:28:57,058 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:56" (1/1) ... [2018-11-10 10:28:57,058 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:56" (1/1) ... [2018-11-10 10:28:57,063 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:56" (1/1) ... [2018-11-10 10:28:57,067 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:56" (1/1) ... [2018-11-10 10:28:57,068 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:56" (1/1) ... [2018-11-10 10:28:57,070 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 10:28:57,070 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 10:28:57,070 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 10:28:57,071 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 10:28:57,071 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_13208ec5-e59c-4791-9485-094c8d32017f/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:28:57,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 10:28:57,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 10:28:57,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-10 10:28:57,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-10 10:28:57,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 10:28:57,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 10:28:57,291 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 10:28:57,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:28:57 BoogieIcfgContainer [2018-11-10 10:28:57,292 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 10:28:57,292 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 10:28:57,292 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 10:28:57,294 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 10:28:57,295 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 10:28:57,295 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 10:28:56" (1/3) ... [2018-11-10 10:28:57,295 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@39904222 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:28:57, skipping insertion in model container [2018-11-10 10:28:57,296 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 10:28:57,296 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:56" (2/3) ... [2018-11-10 10:28:57,296 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@39904222 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:28:57, skipping insertion in model container [2018-11-10 10:28:57,296 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 10:28:57,296 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:28:57" (3/3) ... [2018-11-10 10:28:57,297 INFO L375 chiAutomizerObserver]: Analyzing ICFG nondet_ll_search-alloca_false-termination.c.i [2018-11-10 10:28:57,335 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 10:28:57,335 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 10:28:57,335 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 10:28:57,336 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 10:28:57,336 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 10:28:57,336 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 10:28:57,336 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 10:28:57,336 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 10:28:57,336 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 10:28:57,344 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2018-11-10 10:28:57,358 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-11-10 10:28:57,358 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:28:57,358 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:28:57,363 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 10:28:57,363 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 10:28:57,363 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 10:28:57,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2018-11-10 10:28:57,364 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-11-10 10:28:57,364 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:28:57,364 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:28:57,365 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 10:28:57,365 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 10:28:57,371 INFO L793 eck$LassoCheckResult]: Stem: 28#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet9, main_#t~ret10.base, main_#t~ret10.offset, main_#t~nondet11, main_~n~0, main_~head~1.base, main_~head~1.offset;main_~n~0 := main_#t~nondet9;havoc main_#t~nondet9;assume { :begin_inline_init_nondet_ll } true;init_nondet_ll_#in~n := main_~n~0;havoc init_nondet_ll_#res.base, init_nondet_ll_#res.offset;havoc init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset, init_nondet_ll_#t~malloc4.base, init_nondet_ll_#t~malloc4.offset, init_nondet_ll_#t~post3, init_nondet_ll_~i~0, init_nondet_ll_~next_node~0.base, init_nondet_ll_~next_node~0.offset, init_nondet_ll_#t~nondet5, init_nondet_ll_~n, init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset;init_nondet_ll_~n := init_nondet_ll_#in~n;havoc init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 12;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset := init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset; 16#L550true SUMMARY for call write~int(0, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset + 0, 4); srcloc: L550 19#L550-1true init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset := init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset;init_nondet_ll_~i~0 := 1; 3#L552-4true [2018-11-10 10:28:57,371 INFO L795 eck$LassoCheckResult]: Loop: 3#L552-4true assume true; 12#L552-1true assume !!(init_nondet_ll_~i~0 < init_nondet_ll_~n);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 12;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];init_nondet_ll_#t~malloc4.base, init_nondet_ll_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;init_nondet_ll_~next_node~0.base, init_nondet_ll_~next_node~0.offset := init_nondet_ll_#t~malloc4.base, init_nondet_ll_#t~malloc4.offset; 26#L554true SUMMARY for call write~int(init_nondet_ll_~i~0, init_nondet_ll_~next_node~0.base, init_nondet_ll_~next_node~0.offset + 0, 4); srcloc: L554 10#L554-1true SUMMARY for call write~$Pointer$(init_nondet_ll_~next_node~0.base, init_nondet_ll_~next_node~0.offset, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset + 4, 8); srcloc: L554-1 7#L555true init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset := init_nondet_ll_~next_node~0.base, init_nondet_ll_~next_node~0.offset; 20#L552-3true init_nondet_ll_#t~post3 := init_nondet_ll_~i~0;init_nondet_ll_~i~0 := init_nondet_ll_#t~post3 + 1;havoc init_nondet_ll_#t~post3; 3#L552-4true [2018-11-10 10:28:57,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:28:57,377 INFO L82 PathProgramCache]: Analyzing trace with hash 925540, now seen corresponding path program 1 times [2018-11-10 10:28:57,378 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:28:57,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:28:57,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:57,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:28:57,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:57,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:28:57,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:28:57,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:28:57,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1128974665, now seen corresponding path program 1 times [2018-11-10 10:28:57,459 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:28:57,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:28:57,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:57,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:28:57,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:57,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:28:57,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:28:57,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:28:57,484 INFO L82 PathProgramCache]: Analyzing trace with hash -686910868, now seen corresponding path program 1 times [2018-11-10 10:28:57,484 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:28:57,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:28:57,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:57,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:28:57,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:57,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:28:57,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:28:57,687 WARN L179 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2018-11-10 10:28:57,881 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 10:28:57,882 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 10:28:57,882 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 10:28:57,883 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 10:28:57,883 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 10:28:57,883 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:28:57,883 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 10:28:57,883 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 10:28:57,883 INFO L131 ssoRankerPreferences]: Filename of dumped script: nondet_ll_search-alloca_false-termination.c.i_Iteration1_Lasso [2018-11-10 10:28:57,883 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 10:28:57,884 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 10:28:57,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:28:57,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:28:58,134 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2018-11-10 10:28:58,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:28:58,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:28:58,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:28:58,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:28:58,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:28:58,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:28:58,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:28:58,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:28:58,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:28:58,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:28:58,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:28:58,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:28:58,429 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 10:28:58,433 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 10:28:58,434 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:28:58,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:58,436 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:28:58,436 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:28:58,436 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:58,436 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:58,438 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:28:58,438 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:28:58,440 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:28:58,441 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:28:58,442 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:58,442 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 10:28:58,442 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:28:58,442 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:58,453 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-10 10:28:58,453 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-10 10:28:58,512 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:28:58,512 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:28:58,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:58,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:28:58,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:58,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:58,514 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:28:58,515 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:28:58,520 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:28:58,521 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:28:58,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:58,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:28:58,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:58,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:58,523 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:28:58,523 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:28:58,527 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:28:58,527 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:28:58,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:58,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:28:58,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:58,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:58,530 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:28:58,530 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:28:58,544 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 10:28:58,556 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 10:28:58,556 INFO L444 ModelExtractionUtils]: 18 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 10:28:58,558 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 10:28:58,559 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 10:28:58,559 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 10:28:58,560 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_init_nondet_ll_~n, ULTIMATE.start_init_nondet_ll_~i~0) = 1*ULTIMATE.start_init_nondet_ll_~n - 1*ULTIMATE.start_init_nondet_ll_~i~0 Supporting invariants [] [2018-11-10 10:28:58,571 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-10 10:28:58,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:28:58,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:28:58,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:28:58,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:28:58,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:28:58,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:28:58,645 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 10:28:58,646 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states. Second operand 4 states. [2018-11-10 10:28:58,686 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states.. Second operand 4 states. Result 67 states and 80 transitions. Complement of second has 7 states. [2018-11-10 10:28:58,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 10:28:58,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 10:28:58,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2018-11-10 10:28:58,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 52 transitions. Stem has 4 letters. Loop has 6 letters. [2018-11-10 10:28:58,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:28:58,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 52 transitions. Stem has 10 letters. Loop has 6 letters. [2018-11-10 10:28:58,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:28:58,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 52 transitions. Stem has 4 letters. Loop has 12 letters. [2018-11-10 10:28:58,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:28:58,693 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 80 transitions. [2018-11-10 10:28:58,695 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-10 10:28:58,699 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 25 states and 29 transitions. [2018-11-10 10:28:58,700 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-10 10:28:58,700 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-10 10:28:58,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 29 transitions. [2018-11-10 10:28:58,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 10:28:58,701 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-11-10 10:28:58,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 29 transitions. [2018-11-10 10:28:58,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-10 10:28:58,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-10 10:28:58,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2018-11-10 10:28:58,723 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-11-10 10:28:58,724 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-11-10 10:28:58,724 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 10:28:58,724 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 29 transitions. [2018-11-10 10:28:58,724 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-10 10:28:58,724 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:28:58,724 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:28:58,725 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:28:58,725 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 10:28:58,725 INFO L793 eck$LassoCheckResult]: Stem: 184#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 182#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet9, main_#t~ret10.base, main_#t~ret10.offset, main_#t~nondet11, main_~n~0, main_~head~1.base, main_~head~1.offset;main_~n~0 := main_#t~nondet9;havoc main_#t~nondet9;assume { :begin_inline_init_nondet_ll } true;init_nondet_ll_#in~n := main_~n~0;havoc init_nondet_ll_#res.base, init_nondet_ll_#res.offset;havoc init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset, init_nondet_ll_#t~malloc4.base, init_nondet_ll_#t~malloc4.offset, init_nondet_ll_#t~post3, init_nondet_ll_~i~0, init_nondet_ll_~next_node~0.base, init_nondet_ll_~next_node~0.offset, init_nondet_ll_#t~nondet5, init_nondet_ll_~n, init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset;init_nondet_ll_~n := init_nondet_ll_#in~n;havoc init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 12;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset := init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset; 183#L550 SUMMARY for call write~int(0, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset + 0, 4); srcloc: L550 187#L550-1 init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset := init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset;init_nondet_ll_~i~0 := 1; 163#L552-4 assume true; 165#L552-1 assume !(init_nondet_ll_~i~0 < init_nondet_ll_~n); 167#L552-5 assume init_nondet_ll_#t~nondet5 != 0;havoc init_nondet_ll_#t~nondet5; 168#L559 SUMMARY for call write~$Pointer$(init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset + 4, 8); srcloc: L559 186#L561-1 init_nondet_ll_#res.base, init_nondet_ll_#res.offset := init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset; 185#L562 main_#t~ret10.base, main_#t~ret10.offset := init_nondet_ll_#res.base, init_nondet_ll_#res.offset;assume { :end_inline_init_nondet_ll } true;main_~head~1.base, main_~head~1.offset := main_#t~ret10.base, main_#t~ret10.offset;havoc main_#t~ret10.base, main_#t~ret10.offset;assume { :begin_inline_safe_search } true;safe_search_#in~head.base, safe_search_#in~head.offset, safe_search_#in~i := main_~head~1.base, main_~head~1.offset, main_#t~nondet11;havoc safe_search_#t~mem8.base, safe_search_#t~mem8.offset, safe_search_#t~mem6, safe_search_#t~short7, safe_search_~head.base, safe_search_~head.offset, safe_search_~i, safe_search_~curr~1.base, safe_search_~curr~1.offset;safe_search_~head.base, safe_search_~head.offset := safe_search_#in~head.base, safe_search_#in~head.offset;safe_search_~i := safe_search_#in~i;safe_search_~curr~1.base, safe_search_~curr~1.offset := safe_search_~head.base, safe_search_~head.offset; 172#L567-8 [2018-11-10 10:28:58,725 INFO L795 eck$LassoCheckResult]: Loop: 172#L567-8 assume true; 173#L567-1 safe_search_#t~short7 := safe_search_~curr~1.base != 0 || safe_search_~curr~1.offset != 0; 174#L567-2 assume !safe_search_#t~short7; 178#L567-6 assume !!safe_search_#t~short7;havoc safe_search_#t~mem6;havoc safe_search_#t~short7; 170#L568 SUMMARY for call safe_search_#t~mem8.base, safe_search_#t~mem8.offset := read~$Pointer$(safe_search_~curr~1.base, safe_search_~curr~1.offset + 4, 8); srcloc: L568 171#L568-1 safe_search_~curr~1.base, safe_search_~curr~1.offset := safe_search_#t~mem8.base, safe_search_#t~mem8.offset;havoc safe_search_#t~mem8.base, safe_search_#t~mem8.offset; 172#L567-8 [2018-11-10 10:28:58,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:28:58,725 INFO L82 PathProgramCache]: Analyzing trace with hash -688449942, now seen corresponding path program 1 times [2018-11-10 10:28:58,725 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:28:58,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:28:58,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:58,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:28:58,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:58,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:28:58,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:28:58,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:28:58,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1954638186, now seen corresponding path program 1 times [2018-11-10 10:28:58,744 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:28:58,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:28:58,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:58,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:28:58,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:58,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:28:58,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:28:58,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:28:58,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:28:58,779 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 10:28:58,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:28:58,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:28:58,782 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-10 10:28:58,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:28:58,796 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2018-11-10 10:28:58,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:28:58,796 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 29 transitions. [2018-11-10 10:28:58,797 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-10 10:28:58,798 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 25 states and 28 transitions. [2018-11-10 10:28:58,798 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-10 10:28:58,798 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-10 10:28:58,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 28 transitions. [2018-11-10 10:28:58,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 10:28:58,798 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-11-10 10:28:58,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 28 transitions. [2018-11-10 10:28:58,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-10 10:28:58,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-10 10:28:58,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-11-10 10:28:58,800 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-11-10 10:28:58,800 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-11-10 10:28:58,800 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 10:28:58,800 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 28 transitions. [2018-11-10 10:28:58,801 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-10 10:28:58,801 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:28:58,801 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:28:58,801 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:28:58,801 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:28:58,802 INFO L793 eck$LassoCheckResult]: Stem: 240#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 237#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet9, main_#t~ret10.base, main_#t~ret10.offset, main_#t~nondet11, main_~n~0, main_~head~1.base, main_~head~1.offset;main_~n~0 := main_#t~nondet9;havoc main_#t~nondet9;assume { :begin_inline_init_nondet_ll } true;init_nondet_ll_#in~n := main_~n~0;havoc init_nondet_ll_#res.base, init_nondet_ll_#res.offset;havoc init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset, init_nondet_ll_#t~malloc4.base, init_nondet_ll_#t~malloc4.offset, init_nondet_ll_#t~post3, init_nondet_ll_~i~0, init_nondet_ll_~next_node~0.base, init_nondet_ll_~next_node~0.offset, init_nondet_ll_#t~nondet5, init_nondet_ll_~n, init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset;init_nondet_ll_~n := init_nondet_ll_#in~n;havoc init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 12;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset := init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset; 238#L550 SUMMARY for call write~int(0, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset + 0, 4); srcloc: L550 244#L550-1 init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset := init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset;init_nondet_ll_~i~0 := 1; 220#L552-4 assume true; 222#L552-1 assume !(init_nondet_ll_~i~0 < init_nondet_ll_~n); 224#L552-5 assume init_nondet_ll_#t~nondet5 != 0;havoc init_nondet_ll_#t~nondet5; 225#L559 SUMMARY for call write~$Pointer$(init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset + 4, 8); srcloc: L559 243#L561-1 init_nondet_ll_#res.base, init_nondet_ll_#res.offset := init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset; 242#L562 main_#t~ret10.base, main_#t~ret10.offset := init_nondet_ll_#res.base, init_nondet_ll_#res.offset;assume { :end_inline_init_nondet_ll } true;main_~head~1.base, main_~head~1.offset := main_#t~ret10.base, main_#t~ret10.offset;havoc main_#t~ret10.base, main_#t~ret10.offset;assume { :begin_inline_safe_search } true;safe_search_#in~head.base, safe_search_#in~head.offset, safe_search_#in~i := main_~head~1.base, main_~head~1.offset, main_#t~nondet11;havoc safe_search_#t~mem8.base, safe_search_#t~mem8.offset, safe_search_#t~mem6, safe_search_#t~short7, safe_search_~head.base, safe_search_~head.offset, safe_search_~i, safe_search_~curr~1.base, safe_search_~curr~1.offset;safe_search_~head.base, safe_search_~head.offset := safe_search_#in~head.base, safe_search_#in~head.offset;safe_search_~i := safe_search_#in~i;safe_search_~curr~1.base, safe_search_~curr~1.offset := safe_search_~head.base, safe_search_~head.offset; 229#L567-8 [2018-11-10 10:28:58,802 INFO L795 eck$LassoCheckResult]: Loop: 229#L567-8 assume true; 230#L567-1 safe_search_#t~short7 := safe_search_~curr~1.base != 0 || safe_search_~curr~1.offset != 0; 231#L567-2 assume safe_search_#t~short7; 234#L567-3 SUMMARY for call safe_search_#t~mem6 := read~int(safe_search_~curr~1.base, safe_search_~curr~1.offset + 0, 4); srcloc: L567-3 239#L567-4 safe_search_#t~short7 := safe_search_#t~mem6 != safe_search_~i; 241#L567-6 assume !!safe_search_#t~short7;havoc safe_search_#t~mem6;havoc safe_search_#t~short7; 227#L568 SUMMARY for call safe_search_#t~mem8.base, safe_search_#t~mem8.offset := read~$Pointer$(safe_search_~curr~1.base, safe_search_~curr~1.offset + 4, 8); srcloc: L568 228#L568-1 safe_search_~curr~1.base, safe_search_~curr~1.offset := safe_search_#t~mem8.base, safe_search_#t~mem8.offset;havoc safe_search_#t~mem8.base, safe_search_#t~mem8.offset; 229#L567-8 [2018-11-10 10:28:58,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:28:58,802 INFO L82 PathProgramCache]: Analyzing trace with hash -688449942, now seen corresponding path program 2 times [2018-11-10 10:28:58,802 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:28:58,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:28:58,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:58,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:28:58,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:58,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:28:58,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:28:58,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:28:58,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1383491725, now seen corresponding path program 1 times [2018-11-10 10:28:58,818 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:28:58,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:28:58,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:58,819 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:28:58,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:58,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:28:58,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:28:58,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:28:58,827 INFO L82 PathProgramCache]: Analyzing trace with hash -200735242, now seen corresponding path program 1 times [2018-11-10 10:28:58,827 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:28:58,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:28:58,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:58,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:28:58,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:58,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:28:58,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:28:59,177 WARN L179 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 104 [2018-11-10 10:28:59,256 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 10:28:59,259 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 10:28:59,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 10:28:59 BoogieIcfgContainer [2018-11-10 10:28:59,270 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 10:28:59,270 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 10:28:59,270 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 10:28:59,270 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 10:28:59,271 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:28:57" (3/4) ... [2018-11-10 10:28:59,273 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-10 10:28:59,303 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_13208ec5-e59c-4791-9485-094c8d32017f/bin-2019/uautomizer/witness.graphml [2018-11-10 10:28:59,303 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 10:28:59,303 INFO L168 Benchmark]: Toolchain (without parser) took 2650.22 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 232.8 MB). Free memory was 952.2 MB in the beginning and 1.1 GB in the end (delta: -187.6 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. [2018-11-10 10:28:59,304 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:28:59,304 INFO L168 Benchmark]: CACSL2BoogieTranslator took 316.37 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 930.5 MB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. [2018-11-10 10:28:59,305 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 930.5 MB in the beginning and 1.1 GB in the end (delta: -215.6 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-11-10 10:28:59,305 INFO L168 Benchmark]: Boogie Preprocessor took 22.34 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-10 10:28:59,305 INFO L168 Benchmark]: RCFGBuilder took 221.41 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: 22.7 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. [2018-11-10 10:28:59,306 INFO L168 Benchmark]: BuchiAutomizer took 1977.93 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 80.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -21.8 MB). Peak memory consumption was 315.1 MB. Max. memory is 11.5 GB. [2018-11-10 10:28:59,307 INFO L168 Benchmark]: Witness Printer took 32.76 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-10 10:28:59,309 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 316.37 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 930.5 MB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 76.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 930.5 MB in the beginning and 1.1 GB in the end (delta: -215.6 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.34 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 221.41 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: 22.7 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1977.93 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 80.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -21.8 MB). Peak memory consumption was 315.1 MB. Max. memory is 11.5 GB. * Witness Printer took 32.76 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 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. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 25 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.9s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 52 SDtfs, 31 SDslu, 62 SDs, 0 SdLazy, 13 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital195 mio100 ax100 hnf100 lsp96 ukn83 mio100 lsp19 div100 bol100 ite100 ukn100 eq216 hnf89 smp100 dnf176 smp100 tf100 neg96 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 70ms VariablesStem: 4 VariablesLoop: 6 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 567]: Nontermination argument in form of an infinite program execution. [2018-11-10 10:28:59,318 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 10:28:59,319 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 10:28:59,320 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 10:28:59,320 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {NULL=0, curr=2, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@e5ff793=0, head=2, head=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@8abfad1=0, n=0, next_node=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1e21eda1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@602a0d25=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@26aac720=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7394cff5=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@19f5a469=0, NULL=12, NULL=0, \old(n)=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1e21eda1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@26aac720=2, \result=0, i=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2a0c2eb9=0, i=3, \result=2, head=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@1a51f798=0, n=0, next_node=0, head=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7f25339d=0, curr=0, NULL=0, head=2, head=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@19f5a469=0, \old(i)=3, NULL=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@8abfad1=0, head=0, head=0, curr=2, curr=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 567]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L573] int n = __VERIFIER_nondet_int(); [L574] CALL, EXPR init_nondet_ll(n) [L548] node_t* head; [L549] EXPR, FCALL malloc(sizeof(node_t)) [L549] node_t* curr = malloc(sizeof(node_t)); [L550] FCALL curr->val = 0 [L551] head = curr [L552] int i = 1; [L552] COND FALSE !(i < n) [L558] COND TRUE __VERIFIER_nondet_int() [L559] FCALL curr->next = head [L562] RET return head; [L574] EXPR init_nondet_ll(n) [L574] node_t* head = init_nondet_ll(n); [L575] CALL safe_search(head, __VERIFIER_nondet_int()) [L566] node_t* curr = head; Loop: [L567] curr != ((void *)0) && curr->val != i [L567] EXPR, FCALL curr->val [L567] curr != ((void *)0) && curr->val != i [L567] COND TRUE curr != ((void *)0) && curr->val != i [L568] EXPR, FCALL curr->next [L568] curr = curr->next End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...