./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/tree_del_iter_incorrect.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c 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_incorrect.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 d3ff8ae763cd253b2864cd8208bb318e170f6466 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.25-f470102 [2019-11-28 17:10:35,102 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 17:10:35,104 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 17:10:35,117 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 17:10:35,118 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 17:10:35,119 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 17:10:35,120 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 17:10:35,123 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 17:10:35,125 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 17:10:35,126 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 17:10:35,127 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 17:10:35,128 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 17:10:35,129 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 17:10:35,130 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 17:10:35,131 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 17:10:35,133 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 17:10:35,134 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 17:10:35,135 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 17:10:35,137 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 17:10:35,139 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 17:10:35,141 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 17:10:35,142 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 17:10:35,143 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 17:10:35,144 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 17:10:35,147 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 17:10:35,147 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 17:10:35,147 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 17:10:35,149 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 17:10:35,149 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 17:10:35,150 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 17:10:35,150 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 17:10:35,151 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 17:10:35,152 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 17:10:35,153 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 17:10:35,155 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 17:10:35,155 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 17:10:35,156 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 17:10:35,156 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 17:10:35,157 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 17:10:35,158 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 17:10:35,159 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 17:10:35,160 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 17:10:35,175 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 17:10:35,175 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 17:10:35,176 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 17:10:35,177 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 17:10:35,177 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 17:10:35,177 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 17:10:35,178 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 17:10:35,178 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 17:10:35,178 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 17:10:35,179 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 17:10:35,179 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 17:10:35,179 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 17:10:35,179 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 17:10:35,180 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 17:10:35,180 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 17:10:35,180 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 17:10:35,180 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 17:10:35,181 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 17:10:35,181 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 17:10:35,181 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 17:10:35,182 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 17:10:35,182 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:10:35,182 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 17:10:35,183 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 17:10:35,183 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 17:10:35,183 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 17:10:35,183 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 17:10:35,184 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 17:10:35,184 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 17:10:35,184 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 -> d3ff8ae763cd253b2864cd8208bb318e170f6466 [2019-11-28 17:10:35,497 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 17:10:35,511 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 17:10:35,515 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 17:10:35,516 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 17:10:35,517 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 17:10:35,518 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/tree_del_iter_incorrect.c [2019-11-28 17:10:35,580 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8ddd2439/ddfd04f2ad4b4d2087f0f9d9c7cf9a28/FLAG546f3ad31 [2019-11-28 17:10:36,093 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 17:10:36,094 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_iter_incorrect.c [2019-11-28 17:10:36,102 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8ddd2439/ddfd04f2ad4b4d2087f0f9d9c7cf9a28/FLAG546f3ad31 [2019-11-28 17:10:36,430 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8ddd2439/ddfd04f2ad4b4d2087f0f9d9c7cf9a28 [2019-11-28 17:10:36,434 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 17:10:36,435 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 17:10:36,437 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 17:10:36,437 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 17:10:36,442 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 17:10:36,443 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:10:36" (1/1) ... [2019-11-28 17:10:36,446 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7261e065 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:10:36, skipping insertion in model container [2019-11-28 17:10:36,447 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:10:36" (1/1) ... [2019-11-28 17:10:36,456 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 17:10:36,487 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 17:10:36,692 WARN L1484 CHandler]: Possible shadowing of function min [2019-11-28 17:10:36,708 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:10:36,725 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 17:10:36,816 WARN L1484 CHandler]: Possible shadowing of function min [2019-11-28 17:10:36,828 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:10:36,850 INFO L208 MainTranslator]: Completed translation [2019-11-28 17:10:36,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:10:36 WrapperNode [2019-11-28 17:10:36,851 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 17:10:36,852 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 17:10:36,852 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 17:10:36,852 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 17:10:36,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:10:36" (1/1) ... [2019-11-28 17:10:36,876 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:10:36" (1/1) ... [2019-11-28 17:10:36,915 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 17:10:36,916 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 17:10:36,916 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 17:10:36,916 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 17:10:36,925 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:10:36" (1/1) ... [2019-11-28 17:10:36,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:10:36" (1/1) ... [2019-11-28 17:10:36,930 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:10:36" (1/1) ... [2019-11-28 17:10:36,931 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:10:36" (1/1) ... [2019-11-28 17:10:36,943 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:10:36" (1/1) ... [2019-11-28 17:10:36,949 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:10:36" (1/1) ... [2019-11-28 17:10:36,952 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:10:36" (1/1) ... [2019-11-28 17:10:36,958 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 17:10:36,959 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 17:10:36,963 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 17:10:36,963 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 17:10:36,964 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:10:36" (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 17:10:37,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 17:10:37,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 17:10:37,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 17:10:37,038 INFO L130 BoogieDeclarations]: Found specification of procedure min [2019-11-28 17:10:37,038 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2019-11-28 17:10:37,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 17:10:37,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 17:10:37,040 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2019-11-28 17:10:37,040 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2019-11-28 17:10:37,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 17:10:37,040 INFO L130 BoogieDeclarations]: Found specification of procedure size [2019-11-28 17:10:37,041 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2019-11-28 17:10:37,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 17:10:37,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 17:10:37,042 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2019-11-28 17:10:37,042 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2019-11-28 17:10:37,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 17:10:37,666 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 17:10:37,668 INFO L287 CfgBuilder]: Removed 22 assume(true) statements. [2019-11-28 17:10:37,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:10:37 BoogieIcfgContainer [2019-11-28 17:10:37,670 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 17:10:37,672 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 17:10:37,672 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 17:10:37,675 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 17:10:37,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:10:36" (1/3) ... [2019-11-28 17:10:37,678 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44504972 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:10:37, skipping insertion in model container [2019-11-28 17:10:37,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:10:36" (2/3) ... [2019-11-28 17:10:37,680 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44504972 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:10:37, skipping insertion in model container [2019-11-28 17:10:37,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:10:37" (3/3) ... [2019-11-28 17:10:37,682 INFO L109 eAbstractionObserver]: Analyzing ICFG tree_del_iter_incorrect.c [2019-11-28 17:10:37,693 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 17:10:37,703 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-11-28 17:10:37,714 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-11-28 17:10:37,737 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 17:10:37,737 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 17:10:37,737 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 17:10:37,737 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 17:10:37,738 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 17:10:37,738 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 17:10:37,738 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 17:10:37,738 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 17:10:37,760 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-11-28 17:10:37,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 17:10:37,769 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:10:37,770 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 17:10:37,770 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:10:37,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:10:37,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1356719622, now seen corresponding path program 1 times [2019-11-28 17:10:37,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:10:37,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660646218] [2019-11-28 17:10:37,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:10:37,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:10:38,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:10:38,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:10:38,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:10:38,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:10:38,163 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 17:10:38,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660646218] [2019-11-28 17:10:38,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:10:38,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 17:10:38,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525892763] [2019-11-28 17:10:38,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 17:10:38,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:10:38,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 17:10:38,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 17:10:38,197 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 6 states. [2019-11-28 17:10:38,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:10:38,554 INFO L93 Difference]: Finished difference Result 136 states and 182 transitions. [2019-11-28 17:10:38,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 17:10:38,557 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-11-28 17:10:38,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:10:38,571 INFO L225 Difference]: With dead ends: 136 [2019-11-28 17:10:38,571 INFO L226 Difference]: Without dead ends: 78 [2019-11-28 17:10:38,580 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-28 17:10:38,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-28 17:10:38,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2019-11-28 17:10:38,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-28 17:10:38,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 92 transitions. [2019-11-28 17:10:38,686 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 92 transitions. Word has length 28 [2019-11-28 17:10:38,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:10:38,687 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 92 transitions. [2019-11-28 17:10:38,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 17:10:38,688 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 92 transitions. [2019-11-28 17:10:38,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-28 17:10:38,691 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:10:38,692 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 17:10:38,692 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:10:38,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:10:38,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1337389131, now seen corresponding path program 1 times [2019-11-28 17:10:38,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:10:38,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278719191] [2019-11-28 17:10:38,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:10:38,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:10:38,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:10:38,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:10:38,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:10:38,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:10:38,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:10:38,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:10:39,018 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 17:10:39,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278719191] [2019-11-28 17:10:39,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645982628] [2019-11-28 17:10:39,020 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 17:10:39,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:10:39,127 INFO L264 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-28 17:10:39,137 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:10:39,198 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 17:10:39,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:10:39,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 9 [2019-11-28 17:10:39,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358589067] [2019-11-28 17:10:39,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 17:10:39,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:10:39,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 17:10:39,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-28 17:10:39,205 INFO L87 Difference]: Start difference. First operand 73 states and 92 transitions. Second operand 9 states. [2019-11-28 17:10:39,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:10:39,682 INFO L93 Difference]: Finished difference Result 132 states and 169 transitions. [2019-11-28 17:10:39,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 17:10:39,683 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2019-11-28 17:10:39,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:10:39,688 INFO L225 Difference]: With dead ends: 132 [2019-11-28 17:10:39,688 INFO L226 Difference]: Without dead ends: 78 [2019-11-28 17:10:39,693 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-11-28 17:10:39,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-28 17:10:39,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2019-11-28 17:10:39,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-28 17:10:39,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 95 transitions. [2019-11-28 17:10:39,711 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 95 transitions. Word has length 40 [2019-11-28 17:10:39,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:10:39,711 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 95 transitions. [2019-11-28 17:10:39,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 17:10:39,712 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 95 transitions. [2019-11-28 17:10:39,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-28 17:10:39,714 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:10:39,714 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 17:10:39,920 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:10:39,921 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:10:39,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:10:39,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1495057778, now seen corresponding path program 1 times [2019-11-28 17:10:39,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:10:39,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251123045] [2019-11-28 17:10:39,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:10:39,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:10:40,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:10:40,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:10:40,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:10:40,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:10:40,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:10:40,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:10:40,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:10:40,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:10:40,219 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 17:10:40,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251123045] [2019-11-28 17:10:40,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:10:40,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-28 17:10:40,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009096465] [2019-11-28 17:10:40,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 17:10:40,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:10:40,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 17:10:40,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-11-28 17:10:40,223 INFO L87 Difference]: Start difference. First operand 75 states and 95 transitions. Second operand 10 states. [2019-11-28 17:10:40,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:10:40,695 INFO L93 Difference]: Finished difference Result 132 states and 169 transitions. [2019-11-28 17:10:40,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 17:10:40,696 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2019-11-28 17:10:40,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:10:40,698 INFO L225 Difference]: With dead ends: 132 [2019-11-28 17:10:40,698 INFO L226 Difference]: Without dead ends: 80 [2019-11-28 17:10:40,700 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-11-28 17:10:40,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-28 17:10:40,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2019-11-28 17:10:40,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-28 17:10:40,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 98 transitions. [2019-11-28 17:10:40,718 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 98 transitions. Word has length 50 [2019-11-28 17:10:40,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:10:40,719 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 98 transitions. [2019-11-28 17:10:40,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 17:10:40,719 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 98 transitions. [2019-11-28 17:10:40,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-28 17:10:40,724 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:10:40,725 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 17:10:40,725 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:10:40,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:10:40,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1674887080, now seen corresponding path program 1 times [2019-11-28 17:10:40,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:10:40,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262726724] [2019-11-28 17:10:40,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:10:40,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:10:40,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:10:40,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:10:40,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:10:40,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:10:41,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:10:41,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:10:41,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:10:41,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:10:41,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:10:41,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:10:41,133 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 17:10:41,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262726724] [2019-11-28 17:10:41,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137946767] [2019-11-28 17:10:41,135 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 17:10:41,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:10:41,228 INFO L264 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-28 17:10:41,232 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:10:41,309 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 17:10:41,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 17:10:41,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [14] total 17 [2019-11-28 17:10:41,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423605006] [2019-11-28 17:10:41,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 17:10:41,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:10:41,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 17:10:41,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2019-11-28 17:10:41,312 INFO L87 Difference]: Start difference. First operand 77 states and 98 transitions. Second operand 8 states. [2019-11-28 17:10:41,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:10:41,458 INFO L93 Difference]: Finished difference Result 126 states and 160 transitions. [2019-11-28 17:10:41,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 17:10:41,459 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-11-28 17:10:41,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:10:41,463 INFO L225 Difference]: With dead ends: 126 [2019-11-28 17:10:41,463 INFO L226 Difference]: Without dead ends: 79 [2019-11-28 17:10:41,465 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2019-11-28 17:10:41,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-11-28 17:10:41,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-11-28 17:10:41,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-28 17:10:41,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 102 transitions. [2019-11-28 17:10:41,478 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 102 transitions. Word has length 63 [2019-11-28 17:10:41,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:10:41,479 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 102 transitions. [2019-11-28 17:10:41,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 17:10:41,479 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 102 transitions. [2019-11-28 17:10:41,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-28 17:10:41,486 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:10:41,486 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 17:10:41,687 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:10:41,688 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:10:41,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:10:41,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1897149291, now seen corresponding path program 1 times [2019-11-28 17:10:41,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:10:41,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863701285] [2019-11-28 17:10:41,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:10:41,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:10:41,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:10:41,854 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 17:10:41,855 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 17:10:41,881 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2019-11-28 17:10:41,882 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2019-11-28 17:10:41,883 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2019-11-28 17:10:41,883 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2019-11-28 17:10:41,887 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2019-11-28 17:10:41,887 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2019-11-28 17:10:41,888 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2019-11-28 17:10:41,888 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2019-11-28 17:10:41,889 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2019-11-28 17:10:41,889 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2019-11-28 17:10:41,890 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2019-11-28 17:10:41,890 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2019-11-28 17:10:41,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:10:41 BoogieIcfgContainer [2019-11-28 17:10:41,938 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 17:10:41,938 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 17:10:41,938 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 17:10:41,939 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 17:10:41,939 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:10:37" (3/4) ... [2019-11-28 17:10:41,942 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 17:10:41,947 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2019-11-28 17:10:41,947 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2019-11-28 17:10:41,948 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2019-11-28 17:10:41,948 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2019-11-28 17:10:41,949 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2019-11-28 17:10:41,950 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2019-11-28 17:10:41,950 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2019-11-28 17:10:41,950 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2019-11-28 17:10:41,951 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2019-11-28 17:10:41,951 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2019-11-28 17:10:41,951 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2019-11-28 17:10:41,951 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2019-11-28 17:10:42,045 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 17:10:42,045 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 17:10:42,049 INFO L168 Benchmark]: Toolchain (without parser) took 5611.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -129.8 MB). Peak memory consumption was 71.0 MB. Max. memory is 11.5 GB. [2019-11-28 17:10:42,050 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:10:42,052 INFO L168 Benchmark]: CACSL2BoogieTranslator took 414.87 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -153.9 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-28 17:10:42,054 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.83 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:10:42,055 INFO L168 Benchmark]: Boogie Preprocessor took 42.39 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 17:10:42,056 INFO L168 Benchmark]: RCFGBuilder took 711.26 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. [2019-11-28 17:10:42,056 INFO L168 Benchmark]: TraceAbstraction took 4266.19 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 82.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -23.8 MB). Peak memory consumption was 59.0 MB. Max. memory is 11.5 GB. [2019-11-28 17:10:42,057 INFO L168 Benchmark]: Witness Printer took 107.02 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: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 11.5 GB. [2019-11-28 17:10:42,061 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.33 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 414.87 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -153.9 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 63.83 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. * Boogie Preprocessor took 42.39 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 711.26 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4266.19 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 82.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -23.8 MB). Peak memory consumption was 59.0 MB. Max. memory is 11.5 GB. * Witness Printer took 107.02 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: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.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: [L100] 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))={-2:0}, n={-2: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))={-2:0}, n={-2:0}, nondet_tree()={0:0}] [L26] n->right = nondet_tree() [L27] return n; VAL [\result={-2:0}, malloc(sizeof(struct node))={-2:0}, n={-2:0}] [L100] RET nondet_tree() [L78] CALL, EXPR min(t) VAL [n={-2:0}] [L32] COND FALSE !(!n) [L35] EXPR n->left VAL [n={-2:0}, n={-2:0}, n->left={0:0}] [L35] 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}] [L35] RET, EXPR min(n->left) VAL [min(n->left)=2147483647, n={-2:0}, n={-2:0}, n->left={0:0}] [L35] int a = min(n->left); [L36] EXPR n->right VAL [a=2147483647, n={-2:0}, n={-2:0}, n->right={0:0}] [L36] 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}] [L36] RET, EXPR min(n->right) VAL [a=2147483647, min(n->right)=2147483647, n={-2:0}, n={-2:0}, n->right={0:0}] [L36] int b = min(n->right); [L37] COND TRUE a <= b [L37] return a; VAL [\result=2147483647, a=2147483647, b=2147483647, n={-2:0}, n={-2:0}] [L78] RET, EXPR min(t) [L78] int a = min(t); [L79] int b; [L81] CALL, EXPR size(t) VAL [t={-2:0}] [L73] COND FALSE !(!t) [L74] EXPR t->left VAL [t={-2:0}, t={-2:0}, t->left={0:0}] [L74] CALL, EXPR size(t->left) VAL [t={0:0}] [L73] COND TRUE !t [L73] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L74] RET, EXPR size(t->left) VAL [size(t->left)=0, t={-2:0}, t={-2:0}, t->left={0:0}] [L74] EXPR t->right VAL [size(t->left)=0, t={-2:0}, t={-2:0}, t->left={0:0}, t->right={0:0}] [L74] CALL, EXPR size(t->right) VAL [t={0:0}] [L73] COND TRUE !t [L73] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L74] RET, EXPR size(t->right) VAL [size(t->left)=0, size(t->right)=0, t={-2:0}, t={-2:0}, t->left={0:0}, t->right={0:0}] [L74] return size(t->left) + size(t->right) + 1; [L81] RET, EXPR size(t) [L81] int n = size(t); [L83] int *x = calloc(n, sizeof(int)); [L84] CALL tree_inorder(t, x, n) VAL [\old(i)=1, a={-1:0}, t={-2:0}] [L62] COND FALSE !(!t) [L65] EXPR t->left VAL [\old(i)=1, a={-1:0}, a={-1:0}, i=1, t={-2:0}, t={-2:0}, t->left={0:0}] [L65] CALL, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-1:0}, t={0:0}] [L62] COND TRUE !t [L63] return i; VAL [\old(i)=1, \result=1, a={-1:0}, a={-1:0}, i=1, t={0:0}, t={0:0}] [L65] RET, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-1:0}, a={-1:0}, i=1, t={-2:0}, t={-2:0}, t->left={0:0}, tree_inorder(t->left, a, i)=1] [L65] i = tree_inorder(t->left, a, i) [L66] EXPR i++ [L66] EXPR t->data [L66] a[i++] = t->data [L67] EXPR t->right VAL [\old(i)=1, a={-1:0}, a={-1:0}, i=2, t={-2:0}, t={-2:0}, t->right={0:0}] [L67] CALL, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=2, a={-1:0}, t={0:0}] [L62] COND TRUE !t [L63] return i; VAL [\old(i)=2, \result=2, a={-1:0}, a={-1:0}, i=2, t={0:0}, t={0:0}] [L67] RET, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=1, a={-1:0}, a={-1:0}, i=2, t={-2:0}, t={-2:0}, t->right={0:0}, tree_inorder(t->right, a, i)=2] [L67] i = tree_inorder(t->right, a, i) [L68] return i; VAL [\old(i)=1, \result=2, a={-1:0}, a={-1:0}, i=2, t={-2:0}, t={-2:0}] [L84] RET tree_inorder(t, x, n) [L85] x[0] [L11] COND TRUE !cond [L11] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 76 locations, 4 error locations. Result: UNSAFE, OverallTime: 4.1s, OverallIterations: 5, TraceHistogramMax: 3, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 308 SDtfs, 234 SDslu, 1213 SDs, 0 SdLazy, 649 SolverSat, 104 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 197 GetRequests, 148 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred 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.1s 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, 43128 SizeOfPredicates, 13 NumberOfNonLiveVariables, 536 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...