./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 f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_7d5ead93-3dfd-47e7-a4ad-34f6cc86a539/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7d5ead93-3dfd-47e7-a4ad-34f6cc86a539/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7d5ead93-3dfd-47e7-a4ad-34f6cc86a539/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7d5ead93-3dfd-47e7-a4ad-34f6cc86a539/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i -s /tmp/vcloud-vcloud-master/worker/run_dir_7d5ead93-3dfd-47e7-a4ad-34f6cc86a539/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7d5ead93-3dfd-47e7-a4ad-34f6cc86a539/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.25-f470102 [2019-12-07 13:19:33,250 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 13:19:33,251 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 13:19:33,259 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 13:19:33,260 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 13:19:33,260 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 13:19:33,261 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 13:19:33,263 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 13:19:33,264 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 13:19:33,265 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 13:19:33,266 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 13:19:33,266 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 13:19:33,267 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 13:19:33,267 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 13:19:33,268 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 13:19:33,269 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 13:19:33,270 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 13:19:33,270 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 13:19:33,272 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 13:19:33,273 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 13:19:33,274 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 13:19:33,275 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 13:19:33,276 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 13:19:33,276 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 13:19:33,278 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 13:19:33,278 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 13:19:33,278 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 13:19:33,279 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 13:19:33,279 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 13:19:33,280 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 13:19:33,280 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 13:19:33,280 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 13:19:33,281 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 13:19:33,282 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 13:19:33,282 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 13:19:33,283 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 13:19:33,283 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 13:19:33,283 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 13:19:33,284 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 13:19:33,284 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 13:19:33,285 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 13:19:33,286 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7d5ead93-3dfd-47e7-a4ad-34f6cc86a539/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-12-07 13:19:33,301 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 13:19:33,301 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 13:19:33,302 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 13:19:33,302 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 13:19:33,302 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 13:19:33,302 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-12-07 13:19:33,303 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-12-07 13:19:33,303 INFO L138 SettingsManager]: * Use old map elimination=false [2019-12-07 13:19:33,303 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-12-07 13:19:33,303 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-12-07 13:19:33,303 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-12-07 13:19:33,304 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 13:19:33,304 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 13:19:33,304 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 13:19:33,304 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 13:19:33,304 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 13:19:33,304 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 13:19:33,305 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-12-07 13:19:33,305 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-12-07 13:19:33,305 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-12-07 13:19:33,305 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 13:19:33,305 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 13:19:33,306 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-12-07 13:19:33,306 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 13:19:33,306 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-12-07 13:19:33,306 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 13:19:33,306 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 13:19:33,306 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-12-07 13:19:33,306 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 13:19:33,307 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 13:19:33,307 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 13:19:33,307 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-12-07 13:19:33,308 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-12-07 13:19:33,308 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_7d5ead93-3dfd-47e7-a4ad-34f6cc86a539/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-12-07 13:19:33,407 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 13:19:33,417 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 13:19:33,420 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 13:19:33,421 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 13:19:33,422 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 13:19:33,422 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7d5ead93-3dfd-47e7-a4ad-34f6cc86a539/bin/uautomizer/../../sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i [2019-12-07 13:19:33,468 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7d5ead93-3dfd-47e7-a4ad-34f6cc86a539/bin/uautomizer/data/eae1b76dc/73d37618f6bb4d3a883983ecb84a33c6/FLAGa1756743c [2019-12-07 13:19:33,862 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 13:19:33,862 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7d5ead93-3dfd-47e7-a4ad-34f6cc86a539/sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i [2019-12-07 13:19:33,873 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7d5ead93-3dfd-47e7-a4ad-34f6cc86a539/bin/uautomizer/data/eae1b76dc/73d37618f6bb4d3a883983ecb84a33c6/FLAGa1756743c [2019-12-07 13:19:34,257 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7d5ead93-3dfd-47e7-a4ad-34f6cc86a539/bin/uautomizer/data/eae1b76dc/73d37618f6bb4d3a883983ecb84a33c6 [2019-12-07 13:19:34,260 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 13:19:34,261 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 13:19:34,262 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 13:19:34,262 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 13:19:34,265 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 13:19:34,266 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:19:34" (1/1) ... [2019-12-07 13:19:34,269 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7030ab51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:19:34, skipping insertion in model container [2019-12-07 13:19:34,269 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:19:34" (1/1) ... [2019-12-07 13:19:34,276 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 13:19:34,307 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 13:19:34,517 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:19:34,522 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 13:19:34,556 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:19:34,590 INFO L208 MainTranslator]: Completed translation [2019-12-07 13:19:34,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:19:34 WrapperNode [2019-12-07 13:19:34,591 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 13:19:34,591 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 13:19:34,592 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 13:19:34,592 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 13:19:34,598 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:19:34" (1/1) ... [2019-12-07 13:19:34,609 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:19:34" (1/1) ... [2019-12-07 13:19:34,626 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 13:19:34,626 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 13:19:34,626 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 13:19:34,626 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 13:19:34,632 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:19:34" (1/1) ... [2019-12-07 13:19:34,632 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:19:34" (1/1) ... [2019-12-07 13:19:34,635 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:19:34" (1/1) ... [2019-12-07 13:19:34,635 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:19:34" (1/1) ... [2019-12-07 13:19:34,641 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:19:34" (1/1) ... [2019-12-07 13:19:34,644 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:19:34" (1/1) ... [2019-12-07 13:19:34,646 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:19:34" (1/1) ... [2019-12-07 13:19:34,648 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 13:19:34,648 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 13:19:34,648 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 13:19:34,648 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 13:19:34,649 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:19:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7d5ead93-3dfd-47e7-a4ad-34f6cc86a539/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-12-07 13:19:34,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 13:19:34,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 13:19:34,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 13:19:34,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 13:19:34,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 13:19:34,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 13:19:34,950 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 13:19:34,950 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 13:19:34,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:19:34 BoogieIcfgContainer [2019-12-07 13:19:34,951 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 13:19:34,952 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-12-07 13:19:34,952 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-12-07 13:19:34,954 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-12-07 13:19:34,955 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 13:19:34,955 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 07.12 01:19:34" (1/3) ... [2019-12-07 13:19:34,956 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@cb1677c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.12 01:19:34, skipping insertion in model container [2019-12-07 13:19:34,956 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 13:19:34,956 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:19:34" (2/3) ... [2019-12-07 13:19:34,956 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@cb1677c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.12 01:19:34, skipping insertion in model container [2019-12-07 13:19:34,956 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 13:19:34,956 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:19:34" (3/3) ... [2019-12-07 13:19:34,958 INFO L371 chiAutomizerObserver]: Analyzing ICFG tree_parent_ptr.i [2019-12-07 13:19:34,989 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-12-07 13:19:34,989 INFO L357 BuchiCegarLoop]: Hoare is false [2019-12-07 13:19:34,989 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-12-07 13:19:34,989 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 13:19:34,989 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 13:19:34,989 INFO L361 BuchiCegarLoop]: Difference is false [2019-12-07 13:19:34,989 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 13:19:34,989 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-12-07 13:19:35,000 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-12-07 13:19:35,017 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2019-12-07 13:19:35,017 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 13:19:35,017 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 13:19:35,022 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-12-07 13:19:35,022 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-12-07 13:19:35,022 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-12-07 13:19:35,022 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-12-07 13:19:35,024 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2019-12-07 13:19:35,024 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 13:19:35,024 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 13:19:35,024 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-12-07 13:19:35,025 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-12-07 13:19:35,030 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-12-07 13:19:35,030 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~mem16.base, main_#t~mem16.offset;havoc main_#t~nondet17; 18#L541-2true [2019-12-07 13:19:35,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:19:35,034 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-12-07 13:19:35,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:19:35,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697151592] [2019-12-07 13:19:35,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:19:35,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:19:35,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:19:35,143 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 13:19:35,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:19:35,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1235889697, now seen corresponding path program 1 times [2019-12-07 13:19:35,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:19:35,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818022055] [2019-12-07 13:19:35,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:19:35,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:19:35,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:19:35,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818022055] [2019-12-07 13:19:35,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:19:35,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:19:35,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694619320] [2019-12-07 13:19:35,172 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-12-07 13:19:35,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:19:35,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-07 13:19:35,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 13:19:35,188 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2019-12-07 13:19:35,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:19:35,193 INFO L93 Difference]: Finished difference Result 21 states and 29 transitions. [2019-12-07 13:19:35,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 13:19:35,194 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 29 transitions. [2019-12-07 13:19:35,195 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2019-12-07 13:19:35,198 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 25 transitions. [2019-12-07 13:19:35,199 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-12-07 13:19:35,199 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-12-07 13:19:35,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 25 transitions. [2019-12-07 13:19:35,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 13:19:35,200 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2019-12-07 13:19:35,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 25 transitions. [2019-12-07 13:19:35,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-12-07 13:19:35,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-12-07 13:19:35,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2019-12-07 13:19:35,217 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2019-12-07 13:19:35,217 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2019-12-07 13:19:35,217 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-12-07 13:19:35,217 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 25 transitions. [2019-12-07 13:19:35,218 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2019-12-07 13:19:35,218 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 13:19:35,218 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 13:19:35,218 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-12-07 13:19:35,218 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:19:35,219 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-12-07 13:19:35,219 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~mem5.base, main_#t~mem5.offset;havoc main_#t~mem4.base, main_#t~mem4.offset;havoc main_#t~short6; 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~mem16.base, main_#t~mem16.offset;havoc main_#t~nondet17; 62#L541-2 [2019-12-07 13:19:35,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:19:35,219 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-12-07 13:19:35,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:19:35,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311292283] [2019-12-07 13:19:35,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:19:35,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:19:35,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:19:35,240 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 13:19:35,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:19:35,240 INFO L82 PathProgramCache]: Analyzing trace with hash 2066931060, now seen corresponding path program 1 times [2019-12-07 13:19:35,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:19:35,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783277822] [2019-12-07 13:19:35,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:19:35,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:19:35,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:19:35,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783277822] [2019-12-07 13:19:35,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:19:35,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:19:35,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213605763] [2019-12-07 13:19:35,309 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-12-07 13:19:35,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:19:35,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:19:35,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:19:35,310 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-12-07 13:19:35,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:19:35,402 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2019-12-07 13:19:35,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:19:35,403 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2019-12-07 13:19:35,405 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-12-07 13:19:35,407 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 35 transitions. [2019-12-07 13:19:35,407 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-12-07 13:19:35,407 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-12-07 13:19:35,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 35 transitions. [2019-12-07 13:19:35,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 13:19:35,408 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 35 transitions. [2019-12-07 13:19:35,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 35 transitions. [2019-12-07 13:19:35,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2019-12-07 13:19:35,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-12-07 13:19:35,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2019-12-07 13:19:35,411 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-12-07 13:19:35,411 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-12-07 13:19:35,411 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-12-07 13:19:35,411 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2019-12-07 13:19:35,412 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2019-12-07 13:19:35,412 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 13:19:35,412 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 13:19:35,412 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-12-07 13:19:35,413 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:19:35,413 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-12-07 13:19:35,413 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~mem5.base, main_#t~mem5.offset;havoc main_#t~mem4.base, main_#t~mem4.offset;havoc main_#t~short6; 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~mem16.base, main_#t~mem16.offset;havoc main_#t~nondet17; 115#L541-2 [2019-12-07 13:19:35,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:19:35,413 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2019-12-07 13:19:35,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:19:35,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461686520] [2019-12-07 13:19:35,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:19:35,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:19:35,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:19:35,432 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 13:19:35,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:19:35,433 INFO L82 PathProgramCache]: Analyzing trace with hash 2066932982, now seen corresponding path program 1 times [2019-12-07 13:19:35,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:19:35,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160210819] [2019-12-07 13:19:35,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:19:35,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:19:35,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:19:35,453 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 13:19:35,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:19:35,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1537472840, now seen corresponding path program 1 times [2019-12-07 13:19:35,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:19:35,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599102641] [2019-12-07 13:19:35,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:19:35,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:19:35,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:19:35,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599102641] [2019-12-07 13:19:35,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:19:35,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:19:35,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474648092] [2019-12-07 13:19:35,614 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2019-12-07 13:19:35,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:19:35,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:19:35,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:19:35,672 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 11 Second operand 5 states. [2019-12-07 13:19:35,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:19:35,774 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2019-12-07 13:19:35,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 13:19:35,775 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 46 transitions. [2019-12-07 13:19:35,776 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2019-12-07 13:19:35,776 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 46 transitions. [2019-12-07 13:19:35,776 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2019-12-07 13:19:35,777 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2019-12-07 13:19:35,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 46 transitions. [2019-12-07 13:19:35,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 13:19:35,777 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 46 transitions. [2019-12-07 13:19:35,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 46 transitions. [2019-12-07 13:19:35,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2019-12-07 13:19:35,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-07 13:19:35,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2019-12-07 13:19:35,779 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2019-12-07 13:19:35,780 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2019-12-07 13:19:35,780 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-12-07 13:19:35,780 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 39 transitions. [2019-12-07 13:19:35,781 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2019-12-07 13:19:35,781 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 13:19:35,781 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 13:19:35,781 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-12-07 13:19:35,781 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:19:35,781 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-12-07 13:19:35,781 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~mem5.base, main_#t~mem5.offset;havoc main_#t~mem4.base, main_#t~mem4.offset;havoc main_#t~short6; 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~mem16.base, main_#t~mem16.offset;havoc main_#t~nondet17; 181#L541-2 [2019-12-07 13:19:35,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:19:35,782 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2019-12-07 13:19:35,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:19:35,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936649162] [2019-12-07 13:19:35,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:19:35,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:19:35,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:19:35,794 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 13:19:35,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:19:35,795 INFO L82 PathProgramCache]: Analyzing trace with hash 2124191284, now seen corresponding path program 1 times [2019-12-07 13:19:35,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:19:35,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412486582] [2019-12-07 13:19:35,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:19:35,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:19:35,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:19:35,808 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 13:19:35,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:19:35,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1480214538, now seen corresponding path program 1 times [2019-12-07 13:19:35,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:19:35,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975521822] [2019-12-07 13:19:35,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:19:35,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:19:35,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:19:35,828 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 13:19:36,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 07.12 01:19:36 BoogieIcfgContainer [2019-12-07 13:19:36,138 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-12-07 13:19:36,138 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 13:19:36,138 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 13:19:36,138 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 13:19:36,139 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:19:34" (3/4) ... [2019-12-07 13:19:36,141 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-12-07 13:19:36,170 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_7d5ead93-3dfd-47e7-a4ad-34f6cc86a539/bin/uautomizer/witness.graphml [2019-12-07 13:19:36,170 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 13:19:36,171 INFO L168 Benchmark]: Toolchain (without parser) took 1910.05 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 91.2 MB). Free memory was 934.0 MB in the beginning and 855.8 MB in the end (delta: 78.1 MB). Peak memory consumption was 169.4 MB. Max. memory is 11.5 GB. [2019-12-07 13:19:36,171 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:19:36,172 INFO L168 Benchmark]: CACSL2BoogieTranslator took 329.08 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 91.2 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -140.0 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-12-07 13:19:36,172 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.27 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-12-07 13:19:36,172 INFO L168 Benchmark]: Boogie Preprocessor took 21.91 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-12-07 13:19:36,173 INFO L168 Benchmark]: RCFGBuilder took 303.43 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 33.9 MB). Peak memory consumption was 33.9 MB. Max. memory is 11.5 GB. [2019-12-07 13:19:36,173 INFO L168 Benchmark]: BuchiAutomizer took 1186.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 855.8 MB in the end (delta: 178.8 MB). Peak memory consumption was 178.8 MB. Max. memory is 11.5 GB. [2019-12-07 13:19:36,174 INFO L168 Benchmark]: Witness Printer took 31.68 ms. Allocated memory is still 1.1 GB. Free memory is still 855.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:19:36,176 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 329.08 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 91.2 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -140.0 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.27 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 21.91 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 303.43 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 33.9 MB). Peak memory consumption was 33.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1186.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 855.8 MB in the end (delta: 178.8 MB). Peak memory consumption was 178.8 MB. Max. memory is 11.5 GB. * Witness Printer took 31.68 ms. Allocated memory is still 1.1 GB. Free memory is still 855.8 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 1.1s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 0.8s. Construction of modules took 0.1s. Büchi inclusion checks took 0.0s. 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.1s 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@3fbfb6a6=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5af8611f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5ff39aa0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@66df56fc=0, NULL=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@716e7ba6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1b560712=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6a055ab9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6f7ca36b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@688cb411=0, root=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2e3c9b5a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3fbfb6a6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5e753f5c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2e94af5f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4de0e00a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5b091974=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@58c8265c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@49925647=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2e3c9b5a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2b1cd66d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@49fa0c1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4de0e00a=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@66df56fc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6a055ab9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6e9e62c0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@688cb411=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7fb67e62=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6eeaae27=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5ff39aa0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6f26b809=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3b66d216=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1b560712=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6657bbc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6e9e62c0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@49925647=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6198bb85=0, n=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@28256a3b=6, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6eeaae27=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2e94af5f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2d4126c1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@716e7ba6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6f7ca36b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4e97f13e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6657bbc=0, root=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4e97f13e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2d4126c1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@6f5ecf58=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7fb67e62=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2b1cd66d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@49fa0c1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5af8611f=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6f26b809=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3b66d216=0, s=0, n=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@58c8265c=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...