/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.assert.codeblocks.term.scoring.heuristic BIGGEST_EQUIVALENCE_CLASS --traceabstraction.assert.codeblocks.term.scoring.heuristic.partitioning.strategy FIXED_NUM_PARTITIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.number.of.partitions 4 --traceabstraction.trace.refinement.strategy CAMEL_SMT_AM -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/verifythis/tree_del_rec.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-79ed534 [2020-07-20 05:45:03,190 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-20 05:45:03,193 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-20 05:45:03,213 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-20 05:45:03,213 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-20 05:45:03,216 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-20 05:45:03,217 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-20 05:45:03,228 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-20 05:45:03,232 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-20 05:45:03,236 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-20 05:45:03,237 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-20 05:45:03,239 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-20 05:45:03,239 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-20 05:45:03,241 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-20 05:45:03,243 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-20 05:45:03,244 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-20 05:45:03,245 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-20 05:45:03,246 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-20 05:45:03,248 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-20 05:45:03,252 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-20 05:45:03,258 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-20 05:45:03,262 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-20 05:45:03,263 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-20 05:45:03,263 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-20 05:45:03,265 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-20 05:45:03,266 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-20 05:45:03,266 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-20 05:45:03,267 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-20 05:45:03,267 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-20 05:45:03,268 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-20 05:45:03,268 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-20 05:45:03,269 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-20 05:45:03,269 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-20 05:45:03,270 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-20 05:45:03,271 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-20 05:45:03,271 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-20 05:45:03,272 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-20 05:45:03,272 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-20 05:45:03,272 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-20 05:45:03,273 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-20 05:45:03,274 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-20 05:45:03,275 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-20 05:45:03,289 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-20 05:45:03,289 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-20 05:45:03,291 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-20 05:45:03,291 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-20 05:45:03,291 INFO L138 SettingsManager]: * Use SBE=true [2020-07-20 05:45:03,291 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-20 05:45:03,292 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-20 05:45:03,292 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-20 05:45:03,292 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-20 05:45:03,292 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-20 05:45:03,292 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-20 05:45:03,293 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-20 05:45:03,293 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-20 05:45:03,293 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-20 05:45:03,293 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-20 05:45:03,293 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-20 05:45:03,294 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-20 05:45:03,294 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-20 05:45:03,294 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-20 05:45:03,294 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-20 05:45:03,294 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-20 05:45:03,295 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 05:45:03,295 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-20 05:45:03,295 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-20 05:45:03,295 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-20 05:45:03,295 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-20 05:45:03,296 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 05:45:03,296 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-20 05:45:03,296 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-20 05:45:03,296 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic -> BIGGEST_EQUIVALENCE_CLASS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic Partitioning Strategy -> FIXED_NUM_PARTITIONS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic number of partitions -> 4 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> CAMEL_SMT_AM [2020-07-20 05:45:03,607 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-20 05:45:03,628 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-20 05:45:03,632 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-20 05:45:03,633 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-20 05:45:03,634 INFO L275 PluginConnector]: CDTParser initialized [2020-07-20 05:45:03,635 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/tree_del_rec.c [2020-07-20 05:45:03,716 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f644ea6e2/c2ceb43300a349a8ac27a15ddc7617c2/FLAG38d486e08 [2020-07-20 05:45:04,273 INFO L306 CDTParser]: Found 1 translation units. [2020-07-20 05:45:04,273 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_rec.c [2020-07-20 05:45:04,281 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f644ea6e2/c2ceb43300a349a8ac27a15ddc7617c2/FLAG38d486e08 [2020-07-20 05:45:04,645 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f644ea6e2/c2ceb43300a349a8ac27a15ddc7617c2 [2020-07-20 05:45:04,658 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-20 05:45:04,661 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-20 05:45:04,662 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-20 05:45:04,662 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-20 05:45:04,666 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-20 05:45:04,667 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:45:04" (1/1) ... [2020-07-20 05:45:04,670 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@769d466a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:45:04, skipping insertion in model container [2020-07-20 05:45:04,671 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:45:04" (1/1) ... [2020-07-20 05:45:04,679 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-20 05:45:04,703 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-20 05:45:04,892 WARN L1484 CHandler]: Possible shadowing of function min [2020-07-20 05:45:04,894 WARN L1484 CHandler]: Possible shadowing of function min [2020-07-20 05:45:04,911 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 05:45:04,928 INFO L203 MainTranslator]: Completed pre-run [2020-07-20 05:45:05,049 WARN L1484 CHandler]: Possible shadowing of function min [2020-07-20 05:45:05,051 WARN L1484 CHandler]: Possible shadowing of function min [2020-07-20 05:45:05,063 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 05:45:05,086 INFO L208 MainTranslator]: Completed translation [2020-07-20 05:45:05,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:45:05 WrapperNode [2020-07-20 05:45:05,086 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-20 05:45:05,087 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-20 05:45:05,087 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-20 05:45:05,088 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-20 05:45:05,102 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:45:05" (1/1) ... [2020-07-20 05:45:05,103 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:45:05" (1/1) ... [2020-07-20 05:45:05,120 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:45:05" (1/1) ... [2020-07-20 05:45:05,120 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:45:05" (1/1) ... [2020-07-20 05:45:05,137 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:45:05" (1/1) ... [2020-07-20 05:45:05,143 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:45:05" (1/1) ... [2020-07-20 05:45:05,146 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:45:05" (1/1) ... [2020-07-20 05:45:05,150 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-20 05:45:05,153 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-20 05:45:05,154 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-20 05:45:05,154 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-20 05:45:05,155 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:45:05" (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 [2020-07-20 05:45:05,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-20 05:45:05,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-20 05:45:05,222 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_cycle_if_not [2020-07-20 05:45:05,222 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-20 05:45:05,222 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2020-07-20 05:45:05,222 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2020-07-20 05:45:05,223 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2020-07-20 05:45:05,223 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2020-07-20 05:45:05,223 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2020-07-20 05:45:05,223 INFO L138 BoogieDeclarations]: Found implementation of procedure task [2020-07-20 05:45:05,223 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-20 05:45:05,224 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2020-07-20 05:45:05,224 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-20 05:45:05,224 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-20 05:45:05,224 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-20 05:45:05,224 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-20 05:45:05,224 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2020-07-20 05:45:05,225 INFO L130 BoogieDeclarations]: Found specification of procedure assume_cycle_if_not [2020-07-20 05:45:05,225 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-20 05:45:05,225 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-20 05:45:05,225 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2020-07-20 05:45:05,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-20 05:45:05,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-20 05:45:05,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-20 05:45:05,226 INFO L130 BoogieDeclarations]: Found specification of procedure min [2020-07-20 05:45:05,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-20 05:45:05,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-20 05:45:05,226 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2020-07-20 05:45:05,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-20 05:45:05,227 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2020-07-20 05:45:05,227 INFO L130 BoogieDeclarations]: Found specification of procedure size [2020-07-20 05:45:05,227 INFO L130 BoogieDeclarations]: Found specification of procedure task [2020-07-20 05:45:05,227 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-20 05:45:05,227 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2020-07-20 05:45:05,228 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-20 05:45:05,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-20 05:45:05,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-20 05:45:05,792 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-20 05:45:05,793 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-20 05:45:05,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:45:05 BoogieIcfgContainer [2020-07-20 05:45:05,799 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-20 05:45:05,801 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-20 05:45:05,801 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-20 05:45:05,805 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-20 05:45:05,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 05:45:04" (1/3) ... [2020-07-20 05:45:05,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f71b197 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:45:05, skipping insertion in model container [2020-07-20 05:45:05,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:45:05" (2/3) ... [2020-07-20 05:45:05,807 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f71b197 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:45:05, skipping insertion in model container [2020-07-20 05:45:05,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:45:05" (3/3) ... [2020-07-20 05:45:05,810 INFO L109 eAbstractionObserver]: Analyzing ICFG tree_del_rec.c [2020-07-20 05:45:05,823 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-20 05:45:05,831 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-20 05:45:05,843 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-20 05:45:05,870 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-20 05:45:05,871 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-20 05:45:05,871 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-20 05:45:05,871 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-20 05:45:05,871 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-20 05:45:05,872 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-20 05:45:05,872 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-20 05:45:05,872 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-20 05:45:05,896 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states. [2020-07-20 05:45:05,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-07-20 05:45:05,905 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:45:05,906 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:45:05,907 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:45:05,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:45:05,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1057238675, now seen corresponding path program 1 times [2020-07-20 05:45:05,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:45:05,920 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898273108] [2020-07-20 05:45:05,921 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@5d5403ad [2020-07-20 05:45:06,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:45:06,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:45:06,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:45:06,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:45:06,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:45:06,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:45:06,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:45:06,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:45:06,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 05:45:06,457 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898273108] [2020-07-20 05:45:06,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 05:45:06,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-20 05:45:06,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52352558] [2020-07-20 05:45:06,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-20 05:45:06,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:45:06,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-20 05:45:06,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-07-20 05:45:06,487 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 11 states. [2020-07-20 05:45:07,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:45:07,343 INFO L93 Difference]: Finished difference Result 171 states and 229 transitions. [2020-07-20 05:45:07,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-20 05:45:07,345 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2020-07-20 05:45:07,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:45:07,360 INFO L225 Difference]: With dead ends: 171 [2020-07-20 05:45:07,360 INFO L226 Difference]: Without dead ends: 96 [2020-07-20 05:45:07,366 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2020-07-20 05:45:07,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-07-20 05:45:07,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2020-07-20 05:45:07,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-07-20 05:45:07,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 114 transitions. [2020-07-20 05:45:07,431 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 114 transitions. Word has length 44 [2020-07-20 05:45:07,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:45:07,432 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 114 transitions. [2020-07-20 05:45:07,432 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-20 05:45:07,433 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 114 transitions. [2020-07-20 05:45:07,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-07-20 05:45:07,437 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:45:07,437 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:45:07,438 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-20 05:45:07,438 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:45:07,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:45:07,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1861604494, now seen corresponding path program 1 times [2020-07-20 05:45:07,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:45:07,439 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791740932] [2020-07-20 05:45:07,439 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@5d5403ad [2020-07-20 05:45:07,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:45:07,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:45:07,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:45:07,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:45:07,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:45:07,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:45:07,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:45:07,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:45:07,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:45:07,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:45:07,838 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-20 05:45:07,838 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791740932] [2020-07-20 05:45:07,839 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833560215] [2020-07-20 05:45:07,839 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3fef77ee 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 [2020-07-20 05:45:07,985 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3fef77ee issued 2 check-sat command(s) [2020-07-20 05:45:07,986 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 05:45:07,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 21 conjunts are in the unsatisfiable core [2020-07-20 05:45:08,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 05:45:08,114 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-20 05:45:08,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 05:45:08,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 16 [2020-07-20 05:45:08,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441395843] [2020-07-20 05:45:08,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-20 05:45:08,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:45:08,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-20 05:45:08,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2020-07-20 05:45:08,119 INFO L87 Difference]: Start difference. First operand 90 states and 114 transitions. Second operand 16 states. [2020-07-20 05:45:09,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:45:09,325 INFO L93 Difference]: Finished difference Result 164 states and 211 transitions. [2020-07-20 05:45:09,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-20 05:45:09,327 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2020-07-20 05:45:09,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:45:09,332 INFO L225 Difference]: With dead ends: 164 [2020-07-20 05:45:09,333 INFO L226 Difference]: Without dead ends: 97 [2020-07-20 05:45:09,336 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=138, Invalid=674, Unknown=0, NotChecked=0, Total=812 [2020-07-20 05:45:09,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-07-20 05:45:09,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2020-07-20 05:45:09,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-07-20 05:45:09,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 121 transitions. [2020-07-20 05:45:09,367 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 121 transitions. Word has length 56 [2020-07-20 05:45:09,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:45:09,367 INFO L479 AbstractCegarLoop]: Abstraction has 96 states and 121 transitions. [2020-07-20 05:45:09,368 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-20 05:45:09,368 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 121 transitions. [2020-07-20 05:45:09,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-07-20 05:45:09,374 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:45:09,375 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:45:09,592 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-20 05:45:09,593 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:45:09,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:45:09,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1958691746, now seen corresponding path program 1 times [2020-07-20 05:45:09,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:45:09,595 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556188048] [2020-07-20 05:45:09,596 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@5d5403ad [2020-07-20 05:45:09,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:45:09,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:45:09,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:45:09,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:45:09,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:45:09,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:45:09,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:45:09,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:45:09,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:45:09,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:45:09,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:45:09,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:45:09,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:45:09,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:45:09,940 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2020-07-20 05:45:09,941 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556188048] [2020-07-20 05:45:09,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 05:45:09,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-07-20 05:45:09,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289412357] [2020-07-20 05:45:09,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-20 05:45:09,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:45:09,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-20 05:45:09,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2020-07-20 05:45:09,944 INFO L87 Difference]: Start difference. First operand 96 states and 121 transitions. Second operand 13 states. [2020-07-20 05:45:10,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:45:10,801 INFO L93 Difference]: Finished difference Result 167 states and 210 transitions. [2020-07-20 05:45:10,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-20 05:45:10,803 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 78 [2020-07-20 05:45:10,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:45:10,807 INFO L225 Difference]: With dead ends: 167 [2020-07-20 05:45:10,807 INFO L226 Difference]: Without dead ends: 99 [2020-07-20 05:45:10,810 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2020-07-20 05:45:10,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-07-20 05:45:10,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2020-07-20 05:45:10,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-07-20 05:45:10,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 124 transitions. [2020-07-20 05:45:10,829 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 124 transitions. Word has length 78 [2020-07-20 05:45:10,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:45:10,830 INFO L479 AbstractCegarLoop]: Abstraction has 98 states and 124 transitions. [2020-07-20 05:45:10,830 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-20 05:45:10,830 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 124 transitions. [2020-07-20 05:45:10,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-07-20 05:45:10,834 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:45:10,834 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:45:10,834 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-20 05:45:10,835 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:45:10,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:45:10,835 INFO L82 PathProgramCache]: Analyzing trace with hash -299285422, now seen corresponding path program 1 times [2020-07-20 05:45:10,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:45:10,836 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955999540] [2020-07-20 05:45:10,836 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@5d5403ad [2020-07-20 05:45:10,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-20 05:45:10,890 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 05:45:10,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-20 05:45:10,934 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 05:45:10,978 INFO L174 FreeRefinementEngine]: Strategy CAMEL_SMT_AM found a feasible trace [2020-07-20 05:45:10,979 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-20 05:45:10,979 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-20 05:45:11,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 05:45:11 BoogieIcfgContainer [2020-07-20 05:45:11,053 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-20 05:45:11,056 INFO L168 Benchmark]: Toolchain (without parser) took 6395.74 ms. Allocated memory was 144.7 MB in the beginning and 284.7 MB in the end (delta: 140.0 MB). Free memory was 101.9 MB in the beginning and 144.4 MB in the end (delta: -42.5 MB). Peak memory consumption was 97.5 MB. Max. memory is 7.1 GB. [2020-07-20 05:45:11,058 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 144.7 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-07-20 05:45:11,059 INFO L168 Benchmark]: CACSL2BoogieTranslator took 424.63 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 101.5 MB in the beginning and 177.9 MB in the end (delta: -76.4 MB). Peak memory consumption was 19.2 MB. Max. memory is 7.1 GB. [2020-07-20 05:45:11,060 INFO L168 Benchmark]: Boogie Preprocessor took 63.51 ms. Allocated memory is still 201.9 MB. Free memory was 177.9 MB in the beginning and 175.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-07-20 05:45:11,061 INFO L168 Benchmark]: RCFGBuilder took 645.93 ms. Allocated memory is still 201.9 MB. Free memory was 175.2 MB in the beginning and 141.3 MB in the end (delta: 34.0 MB). Peak memory consumption was 34.0 MB. Max. memory is 7.1 GB. [2020-07-20 05:45:11,062 INFO L168 Benchmark]: TraceAbstraction took 5252.39 ms. Allocated memory was 201.9 MB in the beginning and 284.7 MB in the end (delta: 82.8 MB). Free memory was 140.6 MB in the beginning and 144.4 MB in the end (delta: -3.8 MB). Peak memory consumption was 79.1 MB. Max. memory is 7.1 GB. [2020-07-20 05:45:11,066 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 144.7 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 424.63 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 101.5 MB in the beginning and 177.9 MB in the end (delta: -76.4 MB). Peak memory consumption was 19.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 63.51 ms. Allocated memory is still 201.9 MB. Free memory was 177.9 MB in the beginning and 175.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 645.93 ms. Allocated memory is still 201.9 MB. Free memory was 175.2 MB in the beginning and 141.3 MB in the end (delta: 34.0 MB). Peak memory consumption was 34.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5252.39 ms. Allocated memory was 201.9 MB in the beginning and 284.7 MB in the end (delta: 82.8 MB). Free memory was 140.6 MB in the beginning and 144.4 MB in the end (delta: -3.8 MB). Peak memory consumption was 79.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 14]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L100] CALL, EXPR nondet_tree() [L23] COND FALSE !(__VERIFIER_nondet_bool()) [L26] struct node *n = (struct node *)malloc(sizeof(struct node)); [L27] n->data = __VERIFIER_nondet_int() [L28] CALL, EXPR nondet_tree() [L23] COND TRUE __VERIFIER_nondet_bool() [L24] return 0; VAL [\result={0:0}] [L28] RET, EXPR nondet_tree() VAL [malloc(sizeof(struct node))={-1:0}, n={-1:0}, nondet_tree()={0:0}] [L28] n->left = nondet_tree() [L29] CALL, EXPR nondet_tree() [L23] COND TRUE __VERIFIER_nondet_bool() [L24] return 0; VAL [\result={0:0}] [L29] RET, EXPR nondet_tree() VAL [malloc(sizeof(struct node))={-1:0}, n={-1:0}, nondet_tree()={0:0}] [L29] n->right = nondet_tree() [L30] return n; VAL [\result={-1:0}, malloc(sizeof(struct node))={-1:0}, n={-1:0}] [L100] RET, EXPR nondet_tree() VAL [nondet_tree()={-1:0}] [L100] CALL task(nondet_tree()) VAL [t={-1:0}] [L76] CALL, EXPR min(t) VAL [n={-1:0}] [L35] COND FALSE !(!n) [L38] EXPR n->data [L38] int a = n->data; [L39] EXPR n->left VAL [a=2147483647, n={-1:0}, n={-1:0}, n->left={0:0}] [L39] CALL, EXPR min(n->left) VAL [n={0:0}] [L35] COND TRUE !n [L36] return 2147483647; VAL [\result=2147483647, n={0:0}, n={0:0}] [L39] RET, EXPR min(n->left) VAL [a=2147483647, min(n->left)=2147483647, n={-1:0}, n={-1:0}, n->left={0:0}] [L39] int b = min(n->left); [L40] EXPR n->right VAL [a=2147483647, b=2147483647, n={-1:0}, n={-1:0}, n->right={0:0}] [L40] CALL, EXPR min(n->right) VAL [n={0:0}] [L35] COND TRUE !n [L36] return 2147483647; VAL [\result=2147483647, n={0:0}, n={0:0}] [L40] RET, EXPR min(n->right) VAL [a=2147483647, b=2147483647, min(n->right)=2147483647, n={-1:0}, n={-1:0}, n->right={0:0}] [L40] int c = min(n->right); [L41] COND TRUE b <= a && b <= c [L41] return b; VAL [\result=2147483647, a=2147483647, b=2147483647, c=2147483647, n={-1:0}, n={-1:0}] [L76] RET, EXPR min(t) VAL [min(t)=2147483647, t={-1:0}, t={-1:0}] [L76] int a = min(t); [L77] int b; VAL [a=2147483647, b={2:0}, t={-1:0}, t={-1:0}] [L79] CALL, EXPR size(t) VAL [t={-1:0}] [L71] COND FALSE !(!t) [L72] EXPR t->left VAL [t={-1:0}, t={-1:0}, t->left={0:0}] [L72] CALL, EXPR size(t->left) VAL [t={0:0}] [L71] COND TRUE !t [L71] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L72] RET, EXPR size(t->left) VAL [size(t->left)=0, t={-1:0}, t={-1:0}, t->left={0:0}] [L72] EXPR t->right VAL [size(t->left)=0, t={-1:0}, t={-1:0}, t->left={0:0}, t->right={0:0}] [L72] CALL, EXPR size(t->right) VAL [t={0:0}] [L71] COND TRUE !t [L71] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L72] 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}] [L72] return size(t->left) + size(t->right) + 1; [L79] RET, EXPR size(t) VAL [a=2147483647, b={2:0}, size(t)=1, t={-1:0}, t={-1:0}] [L79] int n = size(t); [L80] CALL assume_cycle_if_not(n != 0) VAL [\old(cond)=1] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L80] RET assume_cycle_if_not(n != 0) VAL [a=2147483647, b={2:0}, n=1, t={-1:0}, t={-1:0}] [L81] EXPR, FCALL calloc(n, sizeof(int)) VAL [a=2147483647, b={2:0}, calloc(n, sizeof(int))={-2:0}, n=1, t={-1:0}, t={-1:0}] [L81] int *x = calloc(n, sizeof(int)); VAL [a=2147483647, b={2:0}, calloc(n, sizeof(int))={-2:0}, n=1, t={-1:0}, t={-1:0}, x={-2:0}] [L82] CALL tree_inorder(t, x, n) VAL [\old(i)=1, a={-2:0}, t={-1:0}] [L60] COND FALSE !(!t) [L63] EXPR t->left VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=1, t={-1:0}, t={-1:0}, t->left={0:0}] [L63] CALL, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-2:0}, t={0:0}] [L60] COND TRUE !t [L61] return i; VAL [\old(i)=1, \result=1, a={-2:0}, a={-2:0}, i=1, t={0:0}, t={0:0}] [L63] RET, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=1, t={-1:0}, t={-1:0}, t->left={0:0}, tree_inorder(t->left, a, i)=1] [L63] i = tree_inorder(t->left, a, i) [L64] EXPR i++ [L64] EXPR t->data [L64] a[i++] = t->data [L65] EXPR t->right VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=2, t={-1:0}, t={-1:0}, t->right={0:0}] [L65] CALL, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=2, a={-2:0}, t={0:0}] [L60] COND TRUE !t [L61] return i; VAL [\old(i)=2, \result=2, a={-2:0}, a={-2:0}, i=2, t={0:0}, t={0:0}] [L65] RET, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=2, t={-1:0}, t={-1:0}, t->right={0:0}, tree_inorder(t->right, a, i)=2] [L65] i = tree_inorder(t->right, a, i) [L66] return i; VAL [\old(i)=1, \result=2, a={-2:0}, a={-2:0}, i=2, t={-1:0}, t={-1:0}] [L82] RET tree_inorder(t, x, n) VAL [a=2147483647, b={2:0}, calloc(n, sizeof(int))={-2:0}, n=1, t={-1:0}, t={-1:0}, tree_inorder(t, x, n)=2, x={-2:0}] [L83] EXPR x[0] VAL [a=2147483647, b={2:0}, calloc(n, sizeof(int))={-2:0}, n=1, t={-1:0}, t={-1:0}, x={-2:0}, x[0]=0] [L83] CALL __VERIFIER_assert(a == x[0]) VAL [\old(cond)=0] [L14] COND TRUE !cond VAL [\old(cond)=0, cond=0] [L14] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 12 procedures, 97 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 5.1s, OverallIterations: 4, TraceHistogramMax: 3, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 264 SDtfs, 312 SDslu, 1200 SDs, 0 SdLazy, 1596 SolverSat, 301 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 166 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=3, 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, 3 MinimizatonAttempts, 8 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 325 NumberOfCodeBlocks, 297 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 230 ConstructedInterpolants, 0 QuantifiedInterpolants, 41948 SizeOfPredicates, 6 NumberOfNonLiveVariables, 184 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 53/57 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...