/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/verifythis/tree_del_iter_incorrect.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-06 22:47:31,345 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-06 22:47:31,347 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-06 22:47:31,398 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-06 22:47:31,399 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-06 22:47:31,403 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-06 22:47:31,406 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-06 22:47:31,413 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-06 22:47:31,423 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-06 22:47:31,425 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-06 22:47:31,426 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-06 22:47:31,427 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-06 22:47:31,428 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-06 22:47:31,429 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-06 22:47:31,430 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-06 22:47:31,431 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-06 22:47:31,432 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-06 22:47:31,433 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-06 22:47:31,435 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-06 22:47:31,438 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-06 22:47:31,439 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-06 22:47:31,441 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-06 22:47:31,442 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-06 22:47:31,443 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-06 22:47:31,446 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-06 22:47:31,446 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-06 22:47:31,446 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-06 22:47:31,447 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-06 22:47:31,448 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-06 22:47:31,449 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-06 22:47:31,449 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-06 22:47:31,450 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-06 22:47:31,451 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-06 22:47:31,452 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-06 22:47:31,453 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-06 22:47:31,453 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-06 22:47:31,454 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-06 22:47:31,454 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-06 22:47:31,455 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-06 22:47:31,456 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-06 22:47:31,457 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-06 22:47:31,458 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-11-06 22:47:31,487 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-06 22:47:31,487 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-06 22:47:31,489 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-06 22:47:31,489 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-06 22:47:31,489 INFO L138 SettingsManager]: * Use SBE=true [2020-11-06 22:47:31,490 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-06 22:47:31,490 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-06 22:47:31,490 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-06 22:47:31,490 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-06 22:47:31,490 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-06 22:47:31,491 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-06 22:47:31,491 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-06 22:47:31,491 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-06 22:47:31,491 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-06 22:47:31,491 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-06 22:47:31,492 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-06 22:47:31,492 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-06 22:47:31,492 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-06 22:47:31,492 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-06 22:47:31,492 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-06 22:47:31,493 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-06 22:47:31,493 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-06 22:47:31,493 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-06 22:47:31,493 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-06 22:47:31,493 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-06 22:47:31,494 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-06 22:47:31,494 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-06 22:47:31,494 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-06 22:47:31,494 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-06 22:47:31,494 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-11-06 22:47:31,884 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-06 22:47:31,916 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-06 22:47:31,920 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-06 22:47:31,921 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-06 22:47:31,922 INFO L275 PluginConnector]: CDTParser initialized [2020-11-06 22:47:31,923 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/tree_del_iter_incorrect.c [2020-11-06 22:47:32,011 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/becc94382/3a3dc13c0c2040d3bfe48981163e74d9/FLAG79514614c [2020-11-06 22:47:32,719 INFO L306 CDTParser]: Found 1 translation units. [2020-11-06 22:47:32,720 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_iter_incorrect.c [2020-11-06 22:47:32,728 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/becc94382/3a3dc13c0c2040d3bfe48981163e74d9/FLAG79514614c [2020-11-06 22:47:33,053 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/becc94382/3a3dc13c0c2040d3bfe48981163e74d9 [2020-11-06 22:47:33,056 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-06 22:47:33,064 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-06 22:47:33,065 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-06 22:47:33,066 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-06 22:47:33,069 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-06 22:47:33,070 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:47:33" (1/1) ... [2020-11-06 22:47:33,073 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19ed19dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:33, skipping insertion in model container [2020-11-06 22:47:33,074 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:47:33" (1/1) ... [2020-11-06 22:47:33,082 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-06 22:47:33,101 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-06 22:47:33,271 WARN L1500 CHandler]: Possible shadowing of function min [2020-11-06 22:47:33,291 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-06 22:47:33,314 INFO L203 MainTranslator]: Completed pre-run [2020-11-06 22:47:33,338 WARN L1500 CHandler]: Possible shadowing of function min [2020-11-06 22:47:33,352 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-06 22:47:33,374 INFO L208 MainTranslator]: Completed translation [2020-11-06 22:47:33,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:33 WrapperNode [2020-11-06 22:47:33,375 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-06 22:47:33,376 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-06 22:47:33,376 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-06 22:47:33,376 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-06 22:47:33,388 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:33" (1/1) ... [2020-11-06 22:47:33,389 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:33" (1/1) ... [2020-11-06 22:47:33,402 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:33" (1/1) ... [2020-11-06 22:47:33,402 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:33" (1/1) ... [2020-11-06 22:47:33,420 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:33" (1/1) ... [2020-11-06 22:47:33,425 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:33" (1/1) ... [2020-11-06 22:47:33,428 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:33" (1/1) ... [2020-11-06 22:47:33,433 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-06 22:47:33,434 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-06 22:47:33,434 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-06 22:47:33,434 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-06 22:47:33,435 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:33" (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-11-06 22:47:33,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-06 22:47:33,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-06 22:47:33,502 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-11-06 22:47:33,502 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-06 22:47:33,502 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-11-06 22:47:33,502 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2020-11-06 22:47:33,503 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2020-11-06 22:47:33,503 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2020-11-06 22:47:33,503 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2020-11-06 22:47:33,503 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2020-11-06 22:47:33,503 INFO L138 BoogieDeclarations]: Found implementation of procedure task [2020-11-06 22:47:33,504 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-06 22:47:33,504 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2020-11-06 22:47:33,504 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-11-06 22:47:33,504 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-11-06 22:47:33,504 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-11-06 22:47:33,504 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-06 22:47:33,505 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2020-11-06 22:47:33,505 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-06 22:47:33,505 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-11-06 22:47:33,505 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-06 22:47:33,505 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-06 22:47:33,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-06 22:47:33,506 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-11-06 22:47:33,506 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2020-11-06 22:47:33,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-11-06 22:47:33,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-06 22:47:33,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-11-06 22:47:33,506 INFO L130 BoogieDeclarations]: Found specification of procedure min [2020-11-06 22:47:33,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-11-06 22:47:33,507 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2020-11-06 22:47:33,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-06 22:47:33,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-06 22:47:33,507 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2020-11-06 22:47:33,508 INFO L130 BoogieDeclarations]: Found specification of procedure size [2020-11-06 22:47:33,508 INFO L130 BoogieDeclarations]: Found specification of procedure task [2020-11-06 22:47:33,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2020-11-06 22:47:33,508 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-06 22:47:33,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-06 22:47:33,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-06 22:47:33,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-06 22:47:34,108 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-06 22:47:34,108 INFO L298 CfgBuilder]: Removed 2 assume(true) statements. [2020-11-06 22:47:34,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:47:34 BoogieIcfgContainer [2020-11-06 22:47:34,110 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-06 22:47:34,112 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-06 22:47:34,112 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-06 22:47:34,115 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-06 22:47:34,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:47:33" (1/3) ... [2020-11-06 22:47:34,116 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@661a6b09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:47:34, skipping insertion in model container [2020-11-06 22:47:34,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:33" (2/3) ... [2020-11-06 22:47:34,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@661a6b09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:47:34, skipping insertion in model container [2020-11-06 22:47:34,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:47:34" (3/3) ... [2020-11-06 22:47:34,118 INFO L111 eAbstractionObserver]: Analyzing ICFG tree_del_iter_incorrect.c [2020-11-06 22:47:34,134 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-06 22:47:34,138 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-06 22:47:34,150 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-06 22:47:34,178 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-06 22:47:34,178 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-06 22:47:34,178 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-06 22:47:34,179 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-06 22:47:34,179 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-06 22:47:34,179 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-06 22:47:34,179 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-06 22:47:34,179 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-06 22:47:34,199 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states. [2020-11-06 22:47:34,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-11-06 22:47:34,208 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:47:34,209 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, 1] [2020-11-06 22:47:34,209 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:47:34,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:47:34,216 INFO L82 PathProgramCache]: Analyzing trace with hash 51345433, now seen corresponding path program 1 times [2020-11-06 22:47:34,226 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:47:34,226 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143826309] [2020-11-06 22:47:34,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:47:34,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:34,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:47:34,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:34,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-11-06 22:47:34,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:34,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-06 22:47:34,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:34,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-11-06 22:47:34,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:34,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-06 22:47:34,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:34,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:47:34,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:34,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-11-06 22:47:34,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:34,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:47:34,613 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143826309] [2020-11-06 22:47:34,614 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:47:34,614 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-06 22:47:34,615 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009581190] [2020-11-06 22:47:34,620 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-06 22:47:34,620 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:47:34,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-06 22:47:34,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-06 22:47:34,637 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 6 states. [2020-11-06 22:47:35,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:47:35,164 INFO L93 Difference]: Finished difference Result 173 states and 227 transitions. [2020-11-06 22:47:35,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-06 22:47:35,166 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2020-11-06 22:47:35,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:47:35,179 INFO L225 Difference]: With dead ends: 173 [2020-11-06 22:47:35,180 INFO L226 Difference]: Without dead ends: 96 [2020-11-06 22:47:35,184 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-11-06 22:47:35,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-11-06 22:47:35,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 89. [2020-11-06 22:47:35,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-11-06 22:47:35,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 110 transitions. [2020-11-06 22:47:35,250 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 110 transitions. Word has length 45 [2020-11-06 22:47:35,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:47:35,251 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 110 transitions. [2020-11-06 22:47:35,251 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-06 22:47:35,251 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 110 transitions. [2020-11-06 22:47:35,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-11-06 22:47:35,255 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:47:35,255 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, 1] [2020-11-06 22:47:35,255 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-06 22:47:35,255 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:47:35,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:47:35,256 INFO L82 PathProgramCache]: Analyzing trace with hash -766303017, now seen corresponding path program 1 times [2020-11-06 22:47:35,257 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:47:35,257 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095921819] [2020-11-06 22:47:35,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:47:35,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:35,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:47:35,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:35,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-11-06 22:47:35,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:35,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-06 22:47:35,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:35,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-11-06 22:47:35,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:35,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-06 22:47:35,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:35,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:47:35,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:35,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-11-06 22:47:35,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:35,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:47:35,565 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095921819] [2020-11-06 22:47:35,565 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:47:35,566 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-06 22:47:35,566 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125785246] [2020-11-06 22:47:35,568 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-06 22:47:35,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:47:35,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-06 22:47:35,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-11-06 22:47:35,569 INFO L87 Difference]: Start difference. First operand 89 states and 110 transitions. Second operand 11 states. [2020-11-06 22:47:36,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:47:36,349 INFO L93 Difference]: Finished difference Result 156 states and 199 transitions. [2020-11-06 22:47:36,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-06 22:47:36,350 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 45 [2020-11-06 22:47:36,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:47:36,353 INFO L225 Difference]: With dead ends: 156 [2020-11-06 22:47:36,353 INFO L226 Difference]: Without dead ends: 98 [2020-11-06 22:47:36,355 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2020-11-06 22:47:36,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-11-06 22:47:36,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 91. [2020-11-06 22:47:36,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-11-06 22:47:36,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 114 transitions. [2020-11-06 22:47:36,374 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 114 transitions. Word has length 45 [2020-11-06 22:47:36,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:47:36,375 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 114 transitions. [2020-11-06 22:47:36,375 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-06 22:47:36,375 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 114 transitions. [2020-11-06 22:47:36,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-11-06 22:47:36,378 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:47:36,378 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, 1] [2020-11-06 22:47:36,378 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-06 22:47:36,378 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:47:36,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:47:36,379 INFO L82 PathProgramCache]: Analyzing trace with hash 557373118, now seen corresponding path program 1 times [2020-11-06 22:47:36,379 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:47:36,379 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220599592] [2020-11-06 22:47:36,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:47:36,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:36,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:47:36,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:36,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-11-06 22:47:36,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:36,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-06 22:47:36,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:36,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-11-06 22:47:36,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:36,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-06 22:47:36,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:36,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-11-06 22:47:36,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:36,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-06 22:47:36,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:36,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-06 22:47:36,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:36,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-06 22:47:36,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:36,660 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-06 22:47:36,661 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220599592] [2020-11-06 22:47:36,661 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440816715] [2020-11-06 22:47:36,661 INFO L95 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 [2020-11-06 22:47:36,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:36,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 25 conjunts are in the unsatisfiable core [2020-11-06 22:47:36,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:47:36,996 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-06 22:47:36,997 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:47:36,997 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 13 [2020-11-06 22:47:36,997 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123737812] [2020-11-06 22:47:36,998 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-06 22:47:36,998 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:47:36,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-06 22:47:36,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2020-11-06 22:47:36,999 INFO L87 Difference]: Start difference. First operand 91 states and 114 transitions. Second operand 13 states. [2020-11-06 22:47:38,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:47:38,092 INFO L93 Difference]: Finished difference Result 166 states and 211 transitions. [2020-11-06 22:47:38,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-06 22:47:38,093 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2020-11-06 22:47:38,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:47:38,095 INFO L225 Difference]: With dead ends: 166 [2020-11-06 22:47:38,095 INFO L226 Difference]: Without dead ends: 97 [2020-11-06 22:47:38,097 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2020-11-06 22:47:38,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-11-06 22:47:38,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2020-11-06 22:47:38,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-11-06 22:47:38,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 117 transitions. [2020-11-06 22:47:38,114 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 117 transitions. Word has length 57 [2020-11-06 22:47:38,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:47:38,114 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 117 transitions. [2020-11-06 22:47:38,114 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-06 22:47:38,115 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 117 transitions. [2020-11-06 22:47:38,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-11-06 22:47:38,118 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:47:38,118 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:47:38,332 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-11-06 22:47:38,333 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:47:38,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:47:38,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1320994785, now seen corresponding path program 1 times [2020-11-06 22:47:38,335 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:47:38,336 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578457313] [2020-11-06 22:47:38,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:47:38,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:38,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:47:38,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:38,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-11-06 22:47:38,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:38,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:47:38,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:38,502 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:47:38,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:38,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-11-06 22:47:38,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:38,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-06 22:47:38,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:38,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-06 22:47:38,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:38,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-11-06 22:47:38,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:38,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-11-06 22:47:38,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:38,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-06 22:47:38,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:38,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-06 22:47:38,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:38,609 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-11-06 22:47:38,609 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578457313] [2020-11-06 22:47:38,610 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:47:38,610 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-06 22:47:38,610 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433720957] [2020-11-06 22:47:38,611 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-06 22:47:38,611 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:47:38,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-06 22:47:38,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2020-11-06 22:47:38,612 INFO L87 Difference]: Start difference. First operand 93 states and 117 transitions. Second operand 13 states. [2020-11-06 22:47:39,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:47:39,655 INFO L93 Difference]: Finished difference Result 165 states and 210 transitions. [2020-11-06 22:47:39,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-06 22:47:39,656 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 67 [2020-11-06 22:47:39,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:47:39,658 INFO L225 Difference]: With dead ends: 165 [2020-11-06 22:47:39,658 INFO L226 Difference]: Without dead ends: 99 [2020-11-06 22:47:39,665 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2020-11-06 22:47:39,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-11-06 22:47:39,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2020-11-06 22:47:39,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-11-06 22:47:39,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 120 transitions. [2020-11-06 22:47:39,692 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 120 transitions. Word has length 67 [2020-11-06 22:47:39,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:47:39,693 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 120 transitions. [2020-11-06 22:47:39,693 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-06 22:47:39,697 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 120 transitions. [2020-11-06 22:47:39,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-11-06 22:47:39,703 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:47:39,706 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, 1, 1] [2020-11-06 22:47:39,707 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-06 22:47:39,707 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:47:39,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:47:39,707 INFO L82 PathProgramCache]: Analyzing trace with hash -206453740, now seen corresponding path program 1 times [2020-11-06 22:47:39,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:47:39,709 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025644236] [2020-11-06 22:47:39,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:47:39,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:39,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:47:39,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:39,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-11-06 22:47:39,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:39,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:47:39,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:39,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:47:39,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:39,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-11-06 22:47:39,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:40,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-06 22:47:40,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:40,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-11-06 22:47:40,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:40,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-11-06 22:47:40,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:40,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-06 22:47:40,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:40,034 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-11-06 22:47:40,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:40,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-11-06 22:47:40,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:40,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-06 22:47:40,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:40,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-11-06 22:47:40,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:40,137 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-11-06 22:47:40,137 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025644236] [2020-11-06 22:47:40,138 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836525606] [2020-11-06 22:47:40,138 INFO L95 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 [2020-11-06 22:47:40,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:40,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 27 conjunts are in the unsatisfiable core [2020-11-06 22:47:40,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:47:40,452 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-11-06 22:47:40,454 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:47:40,454 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 18 [2020-11-06 22:47:40,455 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973463175] [2020-11-06 22:47:40,456 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-11-06 22:47:40,456 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:47:40,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-11-06 22:47:40,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2020-11-06 22:47:40,457 INFO L87 Difference]: Start difference. First operand 95 states and 120 transitions. Second operand 18 states. [2020-11-06 22:47:42,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:47:42,289 INFO L93 Difference]: Finished difference Result 155 states and 197 transitions. [2020-11-06 22:47:42,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-11-06 22:47:42,290 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 80 [2020-11-06 22:47:42,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:47:42,292 INFO L225 Difference]: With dead ends: 155 [2020-11-06 22:47:42,292 INFO L226 Difference]: Without dead ends: 101 [2020-11-06 22:47:42,294 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 100 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=168, Invalid=954, Unknown=0, NotChecked=0, Total=1122 [2020-11-06 22:47:42,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-11-06 22:47:42,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2020-11-06 22:47:42,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-11-06 22:47:42,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 125 transitions. [2020-11-06 22:47:42,319 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 125 transitions. Word has length 80 [2020-11-06 22:47:42,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:47:42,319 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 125 transitions. [2020-11-06 22:47:42,319 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-11-06 22:47:42,320 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 125 transitions. [2020-11-06 22:47:42,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-11-06 22:47:42,324 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:47:42,329 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, 1] [2020-11-06 22:47:42,543 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:47:42,544 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:47:42,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:47:42,545 INFO L82 PathProgramCache]: Analyzing trace with hash 918285121, now seen corresponding path program 1 times [2020-11-06 22:47:42,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:47:42,546 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596607353] [2020-11-06 22:47:42,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:47:42,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-06 22:47:42,582 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-06 22:47:42,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-06 22:47:42,615 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-06 22:47:42,656 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-06 22:47:42,657 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-06 22:47:42,657 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-06 22:47:42,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:47:42 BoogieIcfgContainer [2020-11-06 22:47:42,733 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-06 22:47:42,736 INFO L168 Benchmark]: Toolchain (without parser) took 9676.57 ms. Allocated memory was 163.6 MB in the beginning and 266.3 MB in the end (delta: 102.8 MB). Free memory was 137.8 MB in the beginning and 97.9 MB in the end (delta: 39.9 MB). Peak memory consumption was 142.8 MB. Max. memory is 8.0 GB. [2020-11-06 22:47:42,737 INFO L168 Benchmark]: CDTParser took 1.31 ms. Allocated memory is still 163.6 MB. Free memory was 135.1 MB in the beginning and 135.1 MB in the end (delta: 89.3 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-06 22:47:42,738 INFO L168 Benchmark]: CACSL2BoogieTranslator took 309.92 ms. Allocated memory is still 163.6 MB. Free memory was 137.1 MB in the beginning and 125.4 MB in the end (delta: 11.7 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. [2020-11-06 22:47:42,738 INFO L168 Benchmark]: Boogie Preprocessor took 57.32 ms. Allocated memory is still 163.6 MB. Free memory was 125.4 MB in the beginning and 123.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-11-06 22:47:42,739 INFO L168 Benchmark]: RCFGBuilder took 675.93 ms. Allocated memory is still 163.6 MB. Free memory was 123.0 MB in the beginning and 125.2 MB in the end (delta: -2.2 MB). Peak memory consumption was 16.9 MB. Max. memory is 8.0 GB. [2020-11-06 22:47:42,740 INFO L168 Benchmark]: TraceAbstraction took 8621.89 ms. Allocated memory was 163.6 MB in the beginning and 266.3 MB in the end (delta: 102.8 MB). Free memory was 125.2 MB in the beginning and 97.9 MB in the end (delta: 27.3 MB). Peak memory consumption was 130.1 MB. Max. memory is 8.0 GB. [2020-11-06 22:47:42,744 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.31 ms. Allocated memory is still 163.6 MB. Free memory was 135.1 MB in the beginning and 135.1 MB in the end (delta: 89.3 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 309.92 ms. Allocated memory is still 163.6 MB. Free memory was 137.1 MB in the beginning and 125.4 MB in the end (delta: 11.7 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 57.32 ms. Allocated memory is still 163.6 MB. Free memory was 125.4 MB in the beginning and 123.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 675.93 ms. Allocated memory is still 163.6 MB. Free memory was 123.0 MB in the beginning and 125.2 MB in the end (delta: -2.2 MB). Peak memory consumption was 16.9 MB. Max. memory is 8.0 GB. * TraceAbstraction took 8621.89 ms. Allocated memory was 163.6 MB in the beginning and 266.3 MB in the end (delta: 102.8 MB). Free memory was 125.2 MB in the beginning and 97.9 MB in the end (delta: 27.3 MB). Peak memory consumption was 130.1 MB. Max. memory is 8.0 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: [L105] CALL, EXPR nondet_tree() [L25] COND FALSE !(__VERIFIER_nondet_bool()) [L28] struct node *n = (struct node *)malloc(sizeof(struct node)); [L29] n->data = __VERIFIER_nondet_int() [L30] CALL, EXPR nondet_tree() [L25] COND TRUE __VERIFIER_nondet_bool() [L26] return 0; VAL [\result={0:0}] [L30] RET, EXPR nondet_tree() VAL [malloc(sizeof(struct node))={-2:0}, n={-2:0}, nondet_tree()={0:0}] [L30] n->left = nondet_tree() [L31] CALL, EXPR nondet_tree() [L25] COND TRUE __VERIFIER_nondet_bool() [L26] return 0; VAL [\result={0:0}] [L31] RET, EXPR nondet_tree() VAL [malloc(sizeof(struct node))={-2:0}, n={-2:0}, nondet_tree()={0:0}] [L31] n->right = nondet_tree() [L32] return n; VAL [\result={-2:0}, malloc(sizeof(struct node))={-2:0}, n={-2:0}] [L105] RET, EXPR nondet_tree() VAL [nondet_tree()={-2:0}] [L105] CALL task(nondet_tree()) VAL [t={-2:0}] [L83] CALL, EXPR min(t) VAL [n={-2:0}] [L37] COND FALSE !(!n) [L40] EXPR n->left VAL [n={-2:0}, n={-2:0}, n->left={0:0}] [L40] CALL, EXPR min(n->left) VAL [n={0:0}] [L37] COND TRUE !n [L38] return 2147483647; VAL [\result=2147483647, n={0:0}, n={0:0}] [L40] RET, EXPR min(n->left) VAL [min(n->left)=2147483647, n={-2:0}, n={-2:0}, n->left={0:0}] [L40] int a = min(n->left); [L41] EXPR n->right VAL [a=2147483647, n={-2:0}, n={-2:0}, n->right={0:0}] [L41] CALL, EXPR min(n->right) VAL [n={0:0}] [L37] COND TRUE !n [L38] return 2147483647; VAL [\result=2147483647, n={0:0}, n={0:0}] [L41] RET, EXPR min(n->right) VAL [a=2147483647, min(n->right)=2147483647, n={-2:0}, n={-2:0}, n->right={0:0}] [L41] int b = min(n->right); [L42] COND TRUE a <= b [L42] return a; VAL [\result=2147483647, a=2147483647, b=2147483647, n={-2:0}, n={-2:0}] [L83] RET, EXPR min(t) VAL [min(t)=2147483647, t={-2:0}, t={-2:0}] [L83] int a = min(t); [L84] int b; VAL [a=2147483647, b={3:0}, t={-2:0}, t={-2:0}] [L86] CALL, EXPR size(t) VAL [t={-2:0}] [L78] COND FALSE !(!t) [L79] EXPR t->left VAL [t={-2:0}, t={-2:0}, t->left={0:0}] [L79] CALL, EXPR size(t->left) VAL [t={0:0}] [L78] COND TRUE !t [L78] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L79] RET, EXPR size(t->left) VAL [size(t->left)=0, t={-2:0}, t={-2:0}, t->left={0:0}] [L79] EXPR t->right VAL [size(t->left)=0, t={-2:0}, t={-2:0}, t->left={0:0}, t->right={0:0}] [L79] CALL, EXPR size(t->right) VAL [t={0:0}] [L78] COND TRUE !t [L78] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L79] 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}] [L79] return size(t->left) + size(t->right) + 1; [L86] RET, EXPR size(t) VAL [a=2147483647, b={3:0}, size(t)=1, t={-2:0}, t={-2:0}] [L86] int n = size(t); [L87] CALL assume_abort_if_not(n != 0) VAL [\old(cond)=1] [L10] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L87] RET assume_abort_if_not(n != 0) VAL [a=2147483647, b={3:0}, n=1, t={-2:0}, t={-2:0}] [L88] EXPR, FCALL calloc(n, sizeof(int)) VAL [a=2147483647, b={3:0}, calloc(n, sizeof(int))={-3:0}, n=1, t={-2:0}, t={-2:0}] [L88] int *x = calloc(n, sizeof(int)); VAL [a=2147483647, b={3:0}, calloc(n, sizeof(int))={-3:0}, n=1, t={-2:0}, t={-2:0}, x={-3:0}] [L89] CALL tree_inorder(t, x, n) VAL [\old(i)=1, a={-3:0}, t={-2:0}] [L67] COND FALSE !(!t) [L70] EXPR t->left VAL [\old(i)=1, a={-3:0}, a={-3:0}, i=1, t={-2:0}, t={-2:0}, t->left={0:0}] [L70] CALL, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-3:0}, t={0:0}] [L67] COND TRUE !t [L68] return i; VAL [\old(i)=1, \result=1, a={-3:0}, a={-3:0}, i=1, t={0:0}, t={0:0}] [L70] RET, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-3:0}, a={-3:0}, i=1, t={-2:0}, t={-2:0}, t->left={0:0}, tree_inorder(t->left, a, i)=1] [L70] i = tree_inorder(t->left, a, i) [L71] EXPR i++ [L71] EXPR t->data [L71] a[i++] = t->data [L72] EXPR t->right VAL [\old(i)=1, a={-3:0}, a={-3:0}, i=2, t={-2:0}, t={-2:0}, t->right={0:0}] [L72] CALL, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=2, a={-3:0}, t={0:0}] [L67] COND TRUE !t [L68] return i; VAL [\old(i)=2, \result=2, a={-3:0}, a={-3:0}, i=2, t={0:0}, t={0:0}] [L72] RET, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=1, a={-3:0}, a={-3:0}, i=2, t={-2:0}, t={-2:0}, t->right={0:0}, tree_inorder(t->right, a, i)=2] [L72] i = tree_inorder(t->right, a, i) [L73] return i; VAL [\old(i)=1, \result=2, a={-3:0}, a={-3:0}, i=2, t={-2:0}, t={-2:0}] [L89] RET tree_inorder(t, x, n) VAL [a=2147483647, b={3:0}, calloc(n, sizeof(int))={-3:0}, n=1, t={-2:0}, t={-2:0}, tree_inorder(t, x, n)=2, x={-3:0}] [L90] EXPR x[0] VAL [a=2147483647, b={3:0}, calloc(n, sizeof(int))={-3:0}, n=1, t={-2:0}, t={-2:0}, x={-3:0}, x[0]=0] [L90] CALL __VERIFIER_assert(a == x[0]) VAL [\old(cond)=0] [L16] COND TRUE !cond VAL [\old(cond)=0, cond=0] [L16] CALL reach_error() [L14] __assert_fail("0", "tree_del_iter_incorrect.c", 14, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 13 procedures, 100 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 8.4s, OverallIterations: 6, TraceHistogramMax: 3, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 421 SDtfs, 643 SDslu, 1563 SDs, 0 SdLazy, 2393 SolverSat, 639 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 309 GetRequests, 215 SyntacticMatches, 4 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=100occurred in iteration=0, 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, 5 MinimizatonAttempts, 24 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 523 NumberOfCodeBlocks, 523 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 424 ConstructedInterpolants, 0 QuantifiedInterpolants, 82904 SizeOfPredicates, 13 NumberOfNonLiveVariables, 734 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 103/111 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...