./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_6cb3083b-4e5c-4f6a-8ff5-583da16477fe/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_6cb3083b-4e5c-4f6a-8ff5-583da16477fe/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6cb3083b-4e5c-4f6a-8ff5-583da16477fe/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6cb3083b-4e5c-4f6a-8ff5-583da16477fe/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i -s /tmp/vcloud-vcloud-master/worker/run_dir_6cb3083b-4e5c-4f6a-8ff5-583da16477fe/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6cb3083b-4e5c-4f6a-8ff5-583da16477fe/bin/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 32bit --witnessprinter.graph.data.programhash fba36da5e1e25c0eb21d7d749a840ca84da8c0fc .............................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-25 08:52:49,342 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:52:49,344 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:52:49,354 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:52:49,354 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:52:49,355 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:52:49,357 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:52:49,358 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:52:49,360 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:52:49,361 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:52:49,362 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:52:49,363 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:52:49,363 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:52:49,364 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:52:49,365 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:52:49,366 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:52:49,367 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:52:49,367 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:52:49,369 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:52:49,371 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:52:49,373 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:52:49,373 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:52:49,374 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:52:49,375 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:52:49,378 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:52:49,378 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:52:49,378 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:52:49,379 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:52:49,379 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:52:49,380 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:52:49,380 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:52:49,381 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:52:49,381 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:52:49,382 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:52:49,383 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:52:49,383 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:52:49,384 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:52:49,384 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:52:49,384 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:52:49,385 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:52:49,385 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:52:49,386 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6cb3083b-4e5c-4f6a-8ff5-583da16477fe/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-25 08:52:49,400 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:52:49,401 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:52:49,401 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:52:49,402 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:52:49,402 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:52:49,402 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-25 08:52:49,402 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-25 08:52:49,402 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-25 08:52:49,402 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-25 08:52:49,403 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-25 08:52:49,403 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-25 08:52:49,403 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:52:49,403 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:52:49,403 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 08:52:49,404 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:52:49,404 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:52:49,404 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:52:49,404 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-25 08:52:49,404 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-25 08:52:49,405 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-25 08:52:49,405 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:52:49,405 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:52:49,405 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-25 08:52:49,405 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:52:49,405 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-25 08:52:49,406 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:52:49,406 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:52:49,406 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-25 08:52:49,406 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:52:49,406 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:52:49,407 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-25 08:52:49,407 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-25 08:52:49,407 INFO L138 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/run_dir_6cb3083b-4e5c-4f6a-8ff5-583da16477fe/bin/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fba36da5e1e25c0eb21d7d749a840ca84da8c0fc [2019-11-25 08:52:49,537 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:52:49,547 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:52:49,549 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:52:49,551 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:52:49,551 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:52:49,552 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6cb3083b-4e5c-4f6a-8ff5-583da16477fe/bin/uautomizer/../../sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i [2019-11-25 08:52:49,599 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6cb3083b-4e5c-4f6a-8ff5-583da16477fe/bin/uautomizer/data/be639bd20/fb63e85c180e4447b5dbbc3cdfc006de/FLAG6ae55ff04 [2019-11-25 08:52:50,071 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:52:50,071 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6cb3083b-4e5c-4f6a-8ff5-583da16477fe/sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i [2019-11-25 08:52:50,087 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6cb3083b-4e5c-4f6a-8ff5-583da16477fe/bin/uautomizer/data/be639bd20/fb63e85c180e4447b5dbbc3cdfc006de/FLAG6ae55ff04 [2019-11-25 08:52:50,386 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6cb3083b-4e5c-4f6a-8ff5-583da16477fe/bin/uautomizer/data/be639bd20/fb63e85c180e4447b5dbbc3cdfc006de [2019-11-25 08:52:50,388 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:52:50,390 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:52:50,391 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:52:50,391 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:52:50,394 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:52:50,395 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:52:50" (1/1) ... [2019-11-25 08:52:50,397 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58b617a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:50, skipping insertion in model container [2019-11-25 08:52:50,398 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:52:50" (1/1) ... [2019-11-25 08:52:50,404 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:52:50,452 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:52:50,781 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:52:50,788 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:52:50,829 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:52:50,884 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:52:50,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:50 WrapperNode [2019-11-25 08:52:50,884 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:52:50,885 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:52:50,885 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:52:50,885 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:52:50,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:50" (1/1) ... [2019-11-25 08:52:50,913 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:50" (1/1) ... [2019-11-25 08:52:50,934 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:52:50,934 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:52:50,935 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:52:50,935 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:52:50,943 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:50" (1/1) ... [2019-11-25 08:52:50,943 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:50" (1/1) ... [2019-11-25 08:52:50,947 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:50" (1/1) ... [2019-11-25 08:52:50,947 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:50" (1/1) ... [2019-11-25 08:52:50,962 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:50" (1/1) ... [2019-11-25 08:52:50,977 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:50" (1/1) ... [2019-11-25 08:52:50,981 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:50" (1/1) ... [2019-11-25 08:52:50,984 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:52:50,984 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:52:50,984 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:52:50,984 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:52:50,985 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6cb3083b-4e5c-4f6a-8ff5-583da16477fe/bin/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 [2019-11-25 08:52:51,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-25 08:52:51,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-25 08:52:51,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-25 08:52:51,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 08:52:51,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:52:51,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:52:51,536 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:52:51,536 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-25 08:52:51,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:52:51 BoogieIcfgContainer [2019-11-25 08:52:51,537 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:52:51,538 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-25 08:52:51,538 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-25 08:52:51,541 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-25 08:52:51,541 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-25 08:52:51,542 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 25.11 08:52:50" (1/3) ... [2019-11-25 08:52:51,542 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@32caaead and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.11 08:52:51, skipping insertion in model container [2019-11-25 08:52:51,543 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-25 08:52:51,543 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:50" (2/3) ... [2019-11-25 08:52:51,543 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@32caaead and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.11 08:52:51, skipping insertion in model container [2019-11-25 08:52:51,543 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-25 08:52:51,543 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:52:51" (3/3) ... [2019-11-25 08:52:51,545 INFO L371 chiAutomizerObserver]: Analyzing ICFG tree_parent_ptr.i [2019-11-25 08:52:51,584 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-25 08:52:51,584 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-25 08:52:51,584 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-25 08:52:51,584 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:52:51,584 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:52:51,584 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-25 08:52:51,584 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:52:51,585 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-25 08:52:51,597 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-11-25 08:52:51,616 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2019-11-25 08:52:51,616 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:52:51,617 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:52:51,622 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-25 08:52:51,622 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-25 08:52:51,623 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-25 08:52:51,623 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-11-25 08:52:51,624 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2019-11-25 08:52:51,625 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:52:51,625 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:52:51,625 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-25 08:52:51,625 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-25 08:52:51,632 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 10#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~short6, main_#t~mem10.base, main_#t~mem10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~nondet17, main_#t~malloc18.base, main_#t~malloc18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~nondet3, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~malloc26.base, main_#t~malloc26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(12);main_~root~0.base, main_~root~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 8 + main_~root~0.offset, 4); 18#L541-2true [2019-11-25 08:52:51,633 INFO L796 eck$LassoCheckResult]: Loop: 18#L541-2true assume !!(0 != main_#t~nondet3);havoc main_#t~nondet3;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 20#L530-2true assume !true; 7#L529-5true call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 6#L535true assume (main_#t~mem10.base == 0 && main_#t~mem10.offset == 0) && 0 != main_#t~nondet11;havoc main_#t~mem10.base, main_#t~mem10.offset;havoc main_#t~nondet11;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(main_#t~malloc12.base, main_#t~malloc12.offset, main_~n~0.base, main_~n~0.offset, 4);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem13.base, main_#t~mem13.offset, 4);havoc main_#t~mem13.base, main_#t~mem13.offset;call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem14.base, 4 + main_#t~mem14.offset, 4);havoc main_#t~mem14.base, main_#t~mem14.offset;call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(main_~n~0.base, main_~n~0.offset, main_#t~mem15.base, 8 + main_#t~mem15.offset, 4);havoc main_#t~mem15.base, main_#t~mem15.offset; 9#L535-2true call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 13#L541true assume !((main_#t~mem16.base == 0 && main_#t~mem16.offset == 0) && 0 != main_#t~nondet17);havoc main_#t~nondet17;havoc main_#t~mem16.base, main_#t~mem16.offset; 18#L541-2true [2019-11-25 08:52:51,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:51,638 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-25 08:52:51,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:51,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061612730] [2019-11-25 08:52:51,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:51,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:52:51,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:52:51,775 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:52:51,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:51,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1235889697, now seen corresponding path program 1 times [2019-11-25 08:52:51,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:51,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350211709] [2019-11-25 08:52:51,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:51,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:51,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:52:51,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350211709] [2019-11-25 08:52:51,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:51,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:52:51,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995727832] [2019-11-25 08:52:51,810 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-25 08:52:51,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:51,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-25 08:52:51,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-25 08:52:51,824 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2019-11-25 08:52:51,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:51,831 INFO L93 Difference]: Finished difference Result 21 states and 29 transitions. [2019-11-25 08:52:51,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-25 08:52:51,832 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 29 transitions. [2019-11-25 08:52:51,834 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2019-11-25 08:52:51,837 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 25 transitions. [2019-11-25 08:52:51,838 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-25 08:52:51,839 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-25 08:52:51,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 25 transitions. [2019-11-25 08:52:51,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:52:51,840 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2019-11-25 08:52:51,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 25 transitions. [2019-11-25 08:52:51,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-25 08:52:51,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-25 08:52:51,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2019-11-25 08:52:51,861 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2019-11-25 08:52:51,861 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2019-11-25 08:52:51,861 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-25 08:52:51,861 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 25 transitions. [2019-11-25 08:52:51,862 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2019-11-25 08:52:51,862 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:52:51,862 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:52:51,863 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-25 08:52:51,863 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:51,863 INFO L794 eck$LassoCheckResult]: Stem: 64#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 61#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~short6, main_#t~mem10.base, main_#t~mem10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~nondet17, main_#t~malloc18.base, main_#t~malloc18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~nondet3, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~malloc26.base, main_#t~malloc26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(12);main_~root~0.base, main_~root~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 8 + main_~root~0.offset, 4); 62#L541-2 [2019-11-25 08:52:51,864 INFO L796 eck$LassoCheckResult]: Loop: 62#L541-2 assume !!(0 != main_#t~nondet3);havoc main_#t~nondet3;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 65#L530-2 call main_#t~mem4.base, main_#t~mem4.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short6 := main_#t~mem4.base != 0 || main_#t~mem4.offset != 0; 66#L529-1 assume main_#t~short6;call main_#t~mem5.base, main_#t~mem5.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4);main_#t~short6 := main_#t~mem5.base != 0 || main_#t~mem5.offset != 0; 50#L529-3 assume !main_#t~short6;havoc main_#t~short6;havoc main_#t~mem4.base, main_#t~mem4.offset;havoc main_#t~mem5.base, main_#t~mem5.offset; 51#L529-5 call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 57#L535 assume (main_#t~mem10.base == 0 && main_#t~mem10.offset == 0) && 0 != main_#t~nondet11;havoc main_#t~mem10.base, main_#t~mem10.offset;havoc main_#t~nondet11;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(main_#t~malloc12.base, main_#t~malloc12.offset, main_~n~0.base, main_~n~0.offset, 4);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem13.base, main_#t~mem13.offset, 4);havoc main_#t~mem13.base, main_#t~mem13.offset;call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem14.base, 4 + main_#t~mem14.offset, 4);havoc main_#t~mem14.base, main_#t~mem14.offset;call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(main_~n~0.base, main_~n~0.offset, main_#t~mem15.base, 8 + main_#t~mem15.offset, 4);havoc main_#t~mem15.base, main_#t~mem15.offset; 58#L535-2 call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 60#L541 assume !((main_#t~mem16.base == 0 && main_#t~mem16.offset == 0) && 0 != main_#t~nondet17);havoc main_#t~nondet17;havoc main_#t~mem16.base, main_#t~mem16.offset; 62#L541-2 [2019-11-25 08:52:51,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:51,864 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-11-25 08:52:51,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:51,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620461267] [2019-11-25 08:52:51,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:51,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:52:51,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:52:51,892 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:52:51,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:51,892 INFO L82 PathProgramCache]: Analyzing trace with hash 2066931060, now seen corresponding path program 1 times [2019-11-25 08:52:51,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:51,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503767314] [2019-11-25 08:52:51,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:51,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:52,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:52:52,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503767314] [2019-11-25 08:52:52,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:52,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:52:52,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595745754] [2019-11-25 08:52:52,008 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-25 08:52:52,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:52,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:52:52,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:52:52,009 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-11-25 08:52:52,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:52,264 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2019-11-25 08:52:52,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:52:52,265 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2019-11-25 08:52:52,266 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-11-25 08:52:52,268 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 35 transitions. [2019-11-25 08:52:52,268 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-11-25 08:52:52,269 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-11-25 08:52:52,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 35 transitions. [2019-11-25 08:52:52,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:52:52,269 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 35 transitions. [2019-11-25 08:52:52,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 35 transitions. [2019-11-25 08:52:52,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2019-11-25 08:52:52,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-25 08:52:52,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2019-11-25 08:52:52,272 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-11-25 08:52:52,272 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-11-25 08:52:52,273 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-25 08:52:52,273 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2019-11-25 08:52:52,273 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2019-11-25 08:52:52,274 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:52:52,274 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:52:52,274 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-25 08:52:52,274 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:52,274 INFO L794 eck$LassoCheckResult]: Stem: 116#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 114#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~short6, main_#t~mem10.base, main_#t~mem10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~nondet17, main_#t~malloc18.base, main_#t~malloc18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~nondet3, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~malloc26.base, main_#t~malloc26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(12);main_~root~0.base, main_~root~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 8 + main_~root~0.offset, 4); 115#L541-2 [2019-11-25 08:52:52,275 INFO L796 eck$LassoCheckResult]: Loop: 115#L541-2 assume !!(0 != main_#t~nondet3);havoc main_#t~nondet3;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 118#L530-2 call main_#t~mem4.base, main_#t~mem4.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short6 := main_#t~mem4.base != 0 || main_#t~mem4.offset != 0; 119#L529-1 assume main_#t~short6;call main_#t~mem5.base, main_#t~mem5.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4);main_#t~short6 := main_#t~mem5.base != 0 || main_#t~mem5.offset != 0; 101#L529-3 assume !main_#t~short6;havoc main_#t~short6;havoc main_#t~mem4.base, main_#t~mem4.offset;havoc main_#t~mem5.base, main_#t~mem5.offset; 102#L529-5 call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 108#L535 assume !((main_#t~mem10.base == 0 && main_#t~mem10.offset == 0) && 0 != main_#t~nondet11);havoc main_#t~mem10.base, main_#t~mem10.offset;havoc main_#t~nondet11; 109#L535-2 call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 113#L541 assume !((main_#t~mem16.base == 0 && main_#t~mem16.offset == 0) && 0 != main_#t~nondet17);havoc main_#t~nondet17;havoc main_#t~mem16.base, main_#t~mem16.offset; 115#L541-2 [2019-11-25 08:52:52,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:52,275 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2019-11-25 08:52:52,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:52,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439090927] [2019-11-25 08:52:52,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:52,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:52:52,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:52:52,321 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:52:52,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:52,322 INFO L82 PathProgramCache]: Analyzing trace with hash 2066932982, now seen corresponding path program 1 times [2019-11-25 08:52:52,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:52,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288012014] [2019-11-25 08:52:52,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:52,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:52:52,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:52:52,359 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:52:52,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:52,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1537472840, now seen corresponding path program 1 times [2019-11-25 08:52:52,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:52,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102791622] [2019-11-25 08:52:52,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:52,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:52,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:52:52,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102791622] [2019-11-25 08:52:52,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:52,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:52:52,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436034700] [2019-11-25 08:52:52,684 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2019-11-25 08:52:52,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:52,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:52:52,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:52:52,786 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 11 Second operand 5 states. [2019-11-25 08:52:52,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:52,971 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2019-11-25 08:52:52,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 08:52:52,972 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 46 transitions. [2019-11-25 08:52:52,973 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2019-11-25 08:52:52,974 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 46 transitions. [2019-11-25 08:52:52,974 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2019-11-25 08:52:52,975 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2019-11-25 08:52:52,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 46 transitions. [2019-11-25 08:52:52,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:52:52,975 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 46 transitions. [2019-11-25 08:52:52,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 46 transitions. [2019-11-25 08:52:52,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2019-11-25 08:52:52,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-25 08:52:52,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2019-11-25 08:52:52,978 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2019-11-25 08:52:52,979 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2019-11-25 08:52:52,979 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-25 08:52:52,979 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 39 transitions. [2019-11-25 08:52:52,980 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2019-11-25 08:52:52,980 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:52:52,980 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:52:52,980 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-25 08:52:52,980 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:52,981 INFO L794 eck$LassoCheckResult]: Stem: 182#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 180#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~short6, main_#t~mem10.base, main_#t~mem10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~nondet17, main_#t~malloc18.base, main_#t~malloc18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~nondet3, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~malloc26.base, main_#t~malloc26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(12);main_~root~0.base, main_~root~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 8 + main_~root~0.offset, 4); 181#L541-2 [2019-11-25 08:52:52,981 INFO L796 eck$LassoCheckResult]: Loop: 181#L541-2 assume !!(0 != main_#t~nondet3);havoc main_#t~nondet3;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 192#L530-2 call main_#t~mem4.base, main_#t~mem4.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short6 := main_#t~mem4.base != 0 || main_#t~mem4.offset != 0; 189#L529-1 assume !main_#t~short6; 190#L529-3 assume !main_#t~short6;havoc main_#t~short6;havoc main_#t~mem4.base, main_#t~mem4.offset;havoc main_#t~mem5.base, main_#t~mem5.offset; 195#L529-5 call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 193#L535 assume !((main_#t~mem10.base == 0 && main_#t~mem10.offset == 0) && 0 != main_#t~nondet11);havoc main_#t~mem10.base, main_#t~mem10.offset;havoc main_#t~nondet11; 178#L535-2 call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 179#L541 assume !((main_#t~mem16.base == 0 && main_#t~mem16.offset == 0) && 0 != main_#t~nondet17);havoc main_#t~nondet17;havoc main_#t~mem16.base, main_#t~mem16.offset; 181#L541-2 [2019-11-25 08:52:52,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:52,981 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2019-11-25 08:52:52,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:52,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976182247] [2019-11-25 08:52:52,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:52,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:52:52,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:52:52,998 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:52:52,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:52,999 INFO L82 PathProgramCache]: Analyzing trace with hash 2124191284, now seen corresponding path program 1 times [2019-11-25 08:52:52,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:52,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574926472] [2019-11-25 08:52:52,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:53,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:52:53,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:52:53,015 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:52:53,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:53,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1480214538, now seen corresponding path program 1 times [2019-11-25 08:52:53,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:53,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869476837] [2019-11-25 08:52:53,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:53,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:52:53,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:52:53,056 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:52:53,195 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-11-25 08:52:53,321 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-25 08:52:53,519 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-11-25 08:52:53,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 25.11 08:52:53 BoogieIcfgContainer [2019-11-25 08:52:53,629 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-25 08:52:53,629 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:52:53,629 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:52:53,630 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:52:53,630 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:52:51" (3/4) ... [2019-11-25 08:52:53,633 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-25 08:52:53,671 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_6cb3083b-4e5c-4f6a-8ff5-583da16477fe/bin/uautomizer/witness.graphml [2019-11-25 08:52:53,671 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:52:53,673 INFO L168 Benchmark]: Toolchain (without parser) took 3282.87 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 944.7 MB in the beginning and 887.7 MB in the end (delta: 57.0 MB). Peak memory consumption was 174.5 MB. Max. memory is 11.5 GB. [2019-11-25 08:52:53,673 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:52:53,674 INFO L168 Benchmark]: CACSL2BoogieTranslator took 494.06 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -155.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-11-25 08:52:53,675 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.37 ms. Allocated memory is still 1.1 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. [2019-11-25 08:52:53,675 INFO L168 Benchmark]: Boogie Preprocessor took 49.17 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:52:53,676 INFO L168 Benchmark]: RCFGBuilder took 553.21 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. [2019-11-25 08:52:53,676 INFO L168 Benchmark]: BuchiAutomizer took 2091.22 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 887.7 MB in the end (delta: 173.8 MB). Peak memory consumption was 173.8 MB. Max. memory is 11.5 GB. [2019-11-25 08:52:53,677 INFO L168 Benchmark]: Witness Printer took 42.12 ms. Allocated memory is still 1.1 GB. Free memory is still 887.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:52:53,680 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 494.06 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -155.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.37 ms. Allocated memory is still 1.1 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. * Boogie Preprocessor took 49.17 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 553.21 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2091.22 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 887.7 MB in the end (delta: 173.8 MB). Peak memory consumption was 173.8 MB. Max. memory is 11.5 GB. * Witness Printer took 42.12 ms. Allocated memory is still 1.1 GB. Free memory is still 887.7 MB. There was no memory consumed. 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 3 terminating modules (3 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.3 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 28 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.0s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.4s. Construction of modules took 0.3s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 28 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 68 SDtfs, 29 SDslu, 60 SDs, 0 SdLazy, 100 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: 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: 527]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@858762b=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4b5f57f6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@60664ce5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3774f5f6=0, NULL=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@e8256aa=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5c001308=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2523633=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3a204005=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1317e394=0, root=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@27ed6541=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@858762b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@662d2521=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@f79ac0d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@170c699a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3703e654=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2d62f6a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@e8948ee=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@27ed6541=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@490dad3d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@68f572b7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@170c699a=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3774f5f6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2523633=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6efcd498=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1317e394=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5879347c=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@647099d0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@60664ce5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@66dd3909=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@38fce604=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5c001308=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@e1c412=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6efcd498=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@e8948ee=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@51eb9e1b=0, n=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2af28f20=6, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@647099d0=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@f79ac0d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@71ca7314=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@e8256aa=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3a204005=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5add590=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@e1c412=0, root=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5add590=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@71ca7314=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@1ac2069=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5879347c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@490dad3d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@68f572b7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4b5f57f6=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@66dd3909=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@38fce604=0, s=0, n=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2d62f6a=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 527]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L523] struct TreeNode* root = malloc(sizeof(*root)), *n; [L524] root->left = ((void *)0) [L525] root->right = ((void *)0) [L526] root->parent = ((void *)0) Loop: [L527] COND TRUE __VERIFIER_nondet_int() [L528] n = root [L529] EXPR n->left [L529] n->left && n->right [L529] COND FALSE !(n->left && n->right) [L535] EXPR n->left [L535] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L541] EXPR n->right [L541] COND FALSE !(!n->right && __VERIFIER_nondet_int()) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...