./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/tree_del_iter.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/verifythis/tree_del_iter.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9186562caa2aa3b429c14af504cbc4d63c10baa7 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 00:06:24,244 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:06:24,247 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:06:24,265 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:06:24,266 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:06:24,268 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:06:24,270 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:06:24,282 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:06:24,285 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:06:24,289 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:06:24,290 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:06:24,291 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:06:24,293 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:06:24,294 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:06:24,296 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:06:24,297 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:06:24,299 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:06:24,301 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:06:24,303 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:06:24,304 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:06:24,306 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:06:24,307 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:06:24,308 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:06:24,309 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:06:24,311 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:06:24,311 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:06:24,312 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:06:24,312 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:06:24,313 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:06:24,314 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:06:24,314 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:06:24,315 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:06:24,316 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:06:24,317 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:06:24,318 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:06:24,318 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:06:24,319 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:06:24,319 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:06:24,319 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:06:24,320 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:06:24,321 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:06:24,322 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 00:06:24,337 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:06:24,337 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:06:24,339 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:06:24,339 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:06:24,340 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:06:24,340 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:06:24,340 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:06:24,341 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:06:24,341 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:06:24,341 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:06:24,341 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:06:24,342 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:06:24,342 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:06:24,342 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:06:24,343 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:06:24,343 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:06:24,343 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:06:24,344 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:06:24,344 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:06:24,344 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:06:24,345 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:06:24,345 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:06:24,345 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:06:24,346 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:06:24,346 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:06:24,346 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:06:24,346 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:06:24,347 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:06:24,347 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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(G ! call(__VERIFIER_error())) ) 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 -> 9186562caa2aa3b429c14af504cbc4d63c10baa7 [2019-11-28 00:06:24,666 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:06:24,683 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:06:24,687 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:06:24,688 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:06:24,689 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:06:24,690 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/tree_del_iter.c [2019-11-28 00:06:24,756 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/217d9dc0c/2f7bdc09f6464df98630f968e3cd7000/FLAGd523b00fa [2019-11-28 00:06:25,209 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:06:25,210 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_iter.c [2019-11-28 00:06:25,217 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/217d9dc0c/2f7bdc09f6464df98630f968e3cd7000/FLAGd523b00fa [2019-11-28 00:06:25,603 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/217d9dc0c/2f7bdc09f6464df98630f968e3cd7000 [2019-11-28 00:06:25,605 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:06:25,607 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:06:25,608 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:06:25,608 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:06:25,611 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:06:25,612 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:06:25" (1/1) ... [2019-11-28 00:06:25,615 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24c09576 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:06:25, skipping insertion in model container [2019-11-28 00:06:25,615 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:06:25" (1/1) ... [2019-11-28 00:06:25,621 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:06:25,641 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:06:25,842 WARN L1484 CHandler]: Possible shadowing of function min [2019-11-28 00:06:25,857 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:06:25,928 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:06:25,950 WARN L1484 CHandler]: Possible shadowing of function min [2019-11-28 00:06:25,961 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:06:25,982 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:06:25,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:06:25 WrapperNode [2019-11-28 00:06:25,982 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:06:25,983 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:06:25,983 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:06:25,984 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:06:25,991 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:06:25" (1/1) ... [2019-11-28 00:06:26,003 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:06:25" (1/1) ... [2019-11-28 00:06:26,031 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:06:26,031 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:06:26,032 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:06:26,032 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:06:26,043 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:06:25" (1/1) ... [2019-11-28 00:06:26,043 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:06:25" (1/1) ... [2019-11-28 00:06:26,047 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:06:25" (1/1) ... [2019-11-28 00:06:26,047 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:06:25" (1/1) ... [2019-11-28 00:06:26,060 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:06:25" (1/1) ... [2019-11-28 00:06:26,066 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:06:25" (1/1) ... [2019-11-28 00:06:26,068 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:06:25" (1/1) ... [2019-11-28 00:06:26,073 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:06:26,073 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:06:26,074 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:06:26,074 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:06:26,075 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:06:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:06:26,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 00:06:26,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 00:06:26,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 00:06:26,148 INFO L130 BoogieDeclarations]: Found specification of procedure min [2019-11-28 00:06:26,149 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2019-11-28 00:06:26,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 00:06:26,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 00:06:26,149 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2019-11-28 00:06:26,150 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2019-11-28 00:06:26,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 00:06:26,150 INFO L130 BoogieDeclarations]: Found specification of procedure size [2019-11-28 00:06:26,150 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2019-11-28 00:06:26,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:06:26,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:06:26,151 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2019-11-28 00:06:26,151 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2019-11-28 00:06:26,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 00:06:26,652 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:06:26,652 INFO L297 CfgBuilder]: Removed 22 assume(true) statements. [2019-11-28 00:06:26,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:06:26 BoogieIcfgContainer [2019-11-28 00:06:26,653 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:06:26,654 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:06:26,654 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:06:26,657 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:06:26,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:06:25" (1/3) ... [2019-11-28 00:06:26,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e2941b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:06:26, skipping insertion in model container [2019-11-28 00:06:26,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:06:25" (2/3) ... [2019-11-28 00:06:26,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e2941b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:06:26, skipping insertion in model container [2019-11-28 00:06:26,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:06:26" (3/3) ... [2019-11-28 00:06:26,660 INFO L109 eAbstractionObserver]: Analyzing ICFG tree_del_iter.c [2019-11-28 00:06:26,672 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:06:26,679 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-11-28 00:06:26,688 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-11-28 00:06:26,708 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:06:26,709 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:06:26,709 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:06:26,709 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:06:26,709 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:06:26,709 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:06:26,709 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:06:26,710 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:06:26,728 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states. [2019-11-28 00:06:26,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 00:06:26,735 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:06:26,736 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:06:26,737 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:06:26,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:06:26,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1744560250, now seen corresponding path program 1 times [2019-11-28 00:06:26,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:06:26,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042358451] [2019-11-28 00:06:26,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:06:26,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:06:27,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:06:27,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:06:27,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:06:27,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:06:27,194 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-28 00:06:27,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042358451] [2019-11-28 00:06:27,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:06:27,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 00:06:27,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591813861] [2019-11-28 00:06:27,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 00:06:27,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:06:27,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 00:06:27,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:06:27,218 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 6 states. [2019-11-28 00:06:27,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:06:27,546 INFO L93 Difference]: Finished difference Result 137 states and 184 transitions. [2019-11-28 00:06:27,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:06:27,548 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-11-28 00:06:27,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:06:27,561 INFO L225 Difference]: With dead ends: 137 [2019-11-28 00:06:27,561 INFO L226 Difference]: Without dead ends: 79 [2019-11-28 00:06:27,565 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:06:27,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-11-28 00:06:27,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 74. [2019-11-28 00:06:27,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-28 00:06:27,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 94 transitions. [2019-11-28 00:06:27,621 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 94 transitions. Word has length 28 [2019-11-28 00:06:27,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:06:27,622 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 94 transitions. [2019-11-28 00:06:27,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 00:06:27,622 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2019-11-28 00:06:27,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-28 00:06:27,625 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:06:27,626 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:06:27,626 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:06:27,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:06:27,627 INFO L82 PathProgramCache]: Analyzing trace with hash 844569035, now seen corresponding path program 1 times [2019-11-28 00:06:27,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:06:27,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242688504] [2019-11-28 00:06:27,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:06:27,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:06:27,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:06:27,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:06:27,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:06:27,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:06:27,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:06:27,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:06:27,935 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 00:06:27,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242688504] [2019-11-28 00:06:27,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467138583] [2019-11-28 00:06:27,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:06:28,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:06:28,036 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-28 00:06:28,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:06:28,141 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 00:06:28,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:06:28,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 11 [2019-11-28 00:06:28,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795387321] [2019-11-28 00:06:28,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 00:06:28,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:06:28,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 00:06:28,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-11-28 00:06:28,149 INFO L87 Difference]: Start difference. First operand 74 states and 94 transitions. Second operand 11 states. [2019-11-28 00:06:28,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:06:28,709 INFO L93 Difference]: Finished difference Result 133 states and 171 transitions. [2019-11-28 00:06:28,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 00:06:28,711 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 40 [2019-11-28 00:06:28,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:06:28,714 INFO L225 Difference]: With dead ends: 133 [2019-11-28 00:06:28,714 INFO L226 Difference]: Without dead ends: 79 [2019-11-28 00:06:28,716 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2019-11-28 00:06:28,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-11-28 00:06:28,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2019-11-28 00:06:28,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-28 00:06:28,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 97 transitions. [2019-11-28 00:06:28,733 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 97 transitions. Word has length 40 [2019-11-28 00:06:28,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:06:28,733 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 97 transitions. [2019-11-28 00:06:28,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 00:06:28,733 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 97 transitions. [2019-11-28 00:06:28,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-28 00:06:28,736 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:06:28,736 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:06:28,940 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:06:28,940 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:06:28,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:06:28,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1284613774, now seen corresponding path program 1 times [2019-11-28 00:06:28,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:06:28,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720328839] [2019-11-28 00:06:28,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:06:28,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:06:29,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:06:29,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:06:29,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:06:29,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:06:29,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:06:29,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:06:29,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:06:29,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:06:29,258 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-28 00:06:29,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720328839] [2019-11-28 00:06:29,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:06:29,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-28 00:06:29,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144996559] [2019-11-28 00:06:29,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 00:06:29,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:06:29,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 00:06:29,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-11-28 00:06:29,262 INFO L87 Difference]: Start difference. First operand 76 states and 97 transitions. Second operand 10 states. [2019-11-28 00:06:29,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:06:29,729 INFO L93 Difference]: Finished difference Result 133 states and 171 transitions. [2019-11-28 00:06:29,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 00:06:29,730 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2019-11-28 00:06:29,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:06:29,732 INFO L225 Difference]: With dead ends: 133 [2019-11-28 00:06:29,733 INFO L226 Difference]: Without dead ends: 81 [2019-11-28 00:06:29,734 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-11-28 00:06:29,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-11-28 00:06:29,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2019-11-28 00:06:29,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-28 00:06:29,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 100 transitions. [2019-11-28 00:06:29,749 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 100 transitions. Word has length 50 [2019-11-28 00:06:29,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:06:29,750 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 100 transitions. [2019-11-28 00:06:29,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 00:06:29,750 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 100 transitions. [2019-11-28 00:06:29,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-28 00:06:29,753 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:06:29,754 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:06:29,754 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:06:29,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:06:29,755 INFO L82 PathProgramCache]: Analyzing trace with hash -990864032, now seen corresponding path program 1 times [2019-11-28 00:06:29,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:06:29,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128795101] [2019-11-28 00:06:29,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:06:29,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:06:29,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:06:29,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:06:29,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:06:29,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:06:30,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:06:30,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:06:30,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:06:30,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:06:30,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:06:30,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:06:30,087 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-28 00:06:30,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128795101] [2019-11-28 00:06:30,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179202688] [2019-11-28 00:06:30,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:06:30,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:06:30,185 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-28 00:06:30,199 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:06:30,262 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-28 00:06:30,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 00:06:30,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [14] total 17 [2019-11-28 00:06:30,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215407137] [2019-11-28 00:06:30,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 00:06:30,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:06:30,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 00:06:30,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2019-11-28 00:06:30,265 INFO L87 Difference]: Start difference. First operand 78 states and 100 transitions. Second operand 8 states. [2019-11-28 00:06:30,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:06:30,403 INFO L93 Difference]: Finished difference Result 127 states and 162 transitions. [2019-11-28 00:06:30,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 00:06:30,404 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-11-28 00:06:30,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:06:30,406 INFO L225 Difference]: With dead ends: 127 [2019-11-28 00:06:30,406 INFO L226 Difference]: Without dead ends: 80 [2019-11-28 00:06:30,407 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2019-11-28 00:06:30,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-28 00:06:30,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-11-28 00:06:30,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-28 00:06:30,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 104 transitions. [2019-11-28 00:06:30,422 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 104 transitions. Word has length 63 [2019-11-28 00:06:30,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:06:30,422 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 104 transitions. [2019-11-28 00:06:30,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 00:06:30,423 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 104 transitions. [2019-11-28 00:06:30,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-28 00:06:30,426 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:06:30,426 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:06:30,629 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:06:30,630 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:06:30,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:06:30,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1232443533, now seen corresponding path program 1 times [2019-11-28 00:06:30,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:06:30,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326775967] [2019-11-28 00:06:30,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:06:30,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:06:30,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:06:30,795 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 00:06:30,795 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 00:06:30,846 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2019-11-28 00:06:30,849 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2019-11-28 00:06:30,852 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2019-11-28 00:06:30,852 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2019-11-28 00:06:30,854 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2019-11-28 00:06:30,859 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2019-11-28 00:06:30,859 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2019-11-28 00:06:30,859 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2019-11-28 00:06:30,860 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2019-11-28 00:06:30,860 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2019-11-28 00:06:30,860 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2019-11-28 00:06:30,860 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2019-11-28 00:06:30,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:06:30 BoogieIcfgContainer [2019-11-28 00:06:30,910 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:06:30,910 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:06:30,911 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:06:30,911 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:06:30,911 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:06:26" (3/4) ... [2019-11-28 00:06:30,914 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 00:06:30,917 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2019-11-28 00:06:30,917 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2019-11-28 00:06:30,917 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2019-11-28 00:06:30,917 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2019-11-28 00:06:30,918 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2019-11-28 00:06:30,919 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2019-11-28 00:06:30,919 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2019-11-28 00:06:30,919 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2019-11-28 00:06:30,919 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2019-11-28 00:06:30,920 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2019-11-28 00:06:30,920 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2019-11-28 00:06:30,920 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2019-11-28 00:06:30,989 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:06:30,989 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:06:30,992 INFO L168 Benchmark]: Toolchain (without parser) took 5384.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 218.6 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -124.3 MB). Peak memory consumption was 94.4 MB. Max. memory is 11.5 GB. [2019-11-28 00:06:30,992 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:06:30,993 INFO L168 Benchmark]: CACSL2BoogieTranslator took 375.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -181.5 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-11-28 00:06:30,994 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. [2019-11-28 00:06:30,994 INFO L168 Benchmark]: Boogie Preprocessor took 41.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-28 00:06:30,995 INFO L168 Benchmark]: RCFGBuilder took 579.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2019-11-28 00:06:30,995 INFO L168 Benchmark]: TraceAbstraction took 4255.84 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 69.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.2 MB). Peak memory consumption was 81.9 MB. Max. memory is 11.5 GB. [2019-11-28 00:06:30,996 INFO L168 Benchmark]: Witness Printer took 79.26 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:06:30,999 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 375.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -181.5 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 579.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4255.84 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 69.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.2 MB). Peak memory consumption was 81.9 MB. Max. memory is 11.5 GB. * Witness Printer took 79.26 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 11]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L105] CALL nondet_tree() [L20] COND FALSE !(__VERIFIER_nondet_bool()) [L23] struct node *n = (struct node *)malloc(sizeof(struct node)); [L24] n->data = __VERIFIER_nondet_int() [L25] CALL, EXPR nondet_tree() [L20] COND TRUE __VERIFIER_nondet_bool() [L21] return 0; VAL [\result={0:0}] [L25] RET, EXPR nondet_tree() VAL [malloc(sizeof(struct node))={1:0}, n={1:0}, nondet_tree()={0:0}] [L25] n->left = nondet_tree() [L26] CALL, EXPR nondet_tree() [L20] COND TRUE __VERIFIER_nondet_bool() [L21] return 0; VAL [\result={0:0}] [L26] RET, EXPR nondet_tree() VAL [malloc(sizeof(struct node))={1:0}, n={1:0}, nondet_tree()={0:0}] [L26] n->right = nondet_tree() [L27] return n; VAL [\result={1:0}, malloc(sizeof(struct node))={1:0}, n={1:0}] [L105] RET nondet_tree() [L81] CALL, EXPR min(t) VAL [n={1:0}] [L32] COND FALSE !(!n) [L35] EXPR n->data [L35] int a = n->data; [L36] EXPR n->left VAL [a=2147483647, n={1:0}, n={1:0}, n->left={0:0}] [L36] CALL, EXPR min(n->left) VAL [n={0:0}] [L32] COND TRUE !n [L33] return 2147483647; VAL [\result=2147483647, n={0:0}, n={0:0}] [L36] RET, EXPR min(n->left) VAL [a=2147483647, min(n->left)=2147483647, n={1:0}, n={1:0}, n->left={0:0}] [L36] int b = min(n->left); [L37] EXPR n->right VAL [a=2147483647, b=2147483647, n={1:0}, n={1:0}, n->right={0:0}] [L37] CALL, EXPR min(n->right) VAL [n={0:0}] [L32] COND TRUE !n [L33] return 2147483647; VAL [\result=2147483647, n={0:0}, n={0:0}] [L37] RET, EXPR min(n->right) VAL [a=2147483647, b=2147483647, min(n->right)=2147483647, n={1:0}, n={1:0}, n->right={0:0}] [L37] int c = min(n->right); [L38] COND TRUE b <= a && b <= c [L38] return b; VAL [\result=2147483647, a=2147483647, b=2147483647, c=2147483647, n={1:0}, n={1:0}] [L81] RET, EXPR min(t) [L81] int a = min(t); [L82] int b; [L84] CALL, EXPR size(t) VAL [t={1:0}] [L76] COND FALSE !(!t) [L77] EXPR t->left VAL [t={1:0}, t={1:0}, t->left={0:0}] [L77] CALL, EXPR size(t->left) VAL [t={0:0}] [L76] COND TRUE !t [L76] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L77] RET, EXPR size(t->left) VAL [size(t->left)=0, t={1:0}, t={1:0}, t->left={0:0}] [L77] EXPR t->right VAL [size(t->left)=0, t={1:0}, t={1:0}, t->left={0:0}, t->right={0:0}] [L77] CALL, EXPR size(t->right) VAL [t={0:0}] [L76] COND TRUE !t [L76] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L77] RET, EXPR size(t->right) VAL [size(t->left)=0, size(t->right)=0, t={1:0}, t={1:0}, t->left={0:0}, t->right={0:0}] [L77] return size(t->left) + size(t->right) + 1; [L84] RET, EXPR size(t) [L84] int n = size(t); [L86] int *x = calloc(n, sizeof(int)); [L87] CALL tree_inorder(t, x, n) VAL [\old(i)=1, a={-1:0}, t={1:0}] [L65] COND FALSE !(!t) [L68] EXPR t->left VAL [\old(i)=1, a={-1:0}, a={-1:0}, i=1, t={1:0}, t={1:0}, t->left={0:0}] [L68] CALL, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-1:0}, t={0:0}] [L65] COND TRUE !t [L66] return i; VAL [\old(i)=1, \result=1, a={-1:0}, a={-1:0}, i=1, t={0:0}, t={0:0}] [L68] RET, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-1:0}, a={-1:0}, i=1, t={1:0}, t={1:0}, t->left={0:0}, tree_inorder(t->left, a, i)=1] [L68] i = tree_inorder(t->left, a, i) [L69] EXPR i++ [L69] EXPR t->data [L69] a[i++] = t->data [L70] EXPR t->right VAL [\old(i)=1, a={-1:0}, a={-1:0}, i=2, t={1:0}, t={1:0}, t->right={0:0}] [L70] CALL, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=2, a={-1:0}, t={0:0}] [L65] COND TRUE !t [L66] return i; VAL [\old(i)=2, \result=2, a={-1:0}, a={-1:0}, i=2, t={0:0}, t={0:0}] [L70] RET, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=1, a={-1:0}, a={-1:0}, i=2, t={1:0}, t={1:0}, t->right={0:0}, tree_inorder(t->right, a, i)=2] [L70] i = tree_inorder(t->right, a, i) [L71] return i; VAL [\old(i)=1, \result=2, a={-1:0}, a={-1:0}, i=2, t={1:0}, t={1:0}] [L87] RET tree_inorder(t, x, n) [L88] x[0] [L11] COND TRUE !cond [L11] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 77 locations, 4 error locations. Result: UNSAFE, OverallTime: 4.0s, OverallIterations: 5, TraceHistogramMax: 3, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 316 SDtfs, 275 SDslu, 1257 SDs, 0 SdLazy, 674 SolverSat, 125 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 198 GetRequests, 147 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 359 NumberOfCodeBlocks, 359 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 278 ConstructedInterpolants, 0 QuantifiedInterpolants, 43100 SizeOfPredicates, 13 NumberOfNonLiveVariables, 539 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 105/111 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...