/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/verifythis/tree_del_iter_incorrect.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-b030c9e [2022-03-20 13:33:45,492 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-20 13:33:45,494 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-20 13:33:45,522 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-20 13:33:45,523 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-20 13:33:45,524 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-20 13:33:45,524 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-20 13:33:45,526 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-20 13:33:45,527 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-20 13:33:45,528 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-20 13:33:45,529 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-20 13:33:45,530 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-20 13:33:45,530 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-20 13:33:45,530 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-20 13:33:45,531 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-20 13:33:45,532 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-20 13:33:45,532 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-20 13:33:45,533 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-20 13:33:45,534 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-20 13:33:45,535 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-20 13:33:45,535 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-20 13:33:45,536 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-20 13:33:45,537 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-20 13:33:45,537 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-20 13:33:45,538 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-20 13:33:45,540 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-20 13:33:45,540 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-20 13:33:45,540 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-20 13:33:45,540 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-20 13:33:45,541 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-20 13:33:45,541 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-20 13:33:45,541 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-20 13:33:45,542 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-20 13:33:45,542 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-20 13:33:45,543 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-20 13:33:45,543 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-20 13:33:45,544 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-20 13:33:45,544 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-20 13:33:45,544 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-20 13:33:45,544 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-20 13:33:45,545 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-20 13:33:45,545 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-20 13:33:45,546 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-03-20 13:33:45,552 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-20 13:33:45,552 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-20 13:33:45,553 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-20 13:33:45,553 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-20 13:33:45,553 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-20 13:33:45,553 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-20 13:33:45,554 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-20 13:33:45,554 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-20 13:33:45,554 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-20 13:33:45,554 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-20 13:33:45,554 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-20 13:33:45,554 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-20 13:33:45,554 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-20 13:33:45,554 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-20 13:33:45,554 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-20 13:33:45,554 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-20 13:33:45,555 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-20 13:33:45,555 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-20 13:33:45,555 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 13:33:45,555 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-20 13:33:45,555 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-20 13:33:45,555 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-03-20 13:33:45,555 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-03-20 13:33:45,555 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-20 13:33:45,555 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-03-20 13:33:45,556 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-03-20 13:33:45,725 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-20 13:33:45,742 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-20 13:33:45,744 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-20 13:33:45,745 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-20 13:33:45,748 INFO L275 PluginConnector]: CDTParser initialized [2022-03-20 13:33:45,748 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 [2022-03-20 13:33:45,805 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b145b97b8/c3b281529ba541c4969d0d2a0c9c5ee1/FLAG6a0b5da7f [2022-03-20 13:33:46,183 INFO L306 CDTParser]: Found 1 translation units. [2022-03-20 13:33:46,184 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_iter_incorrect.c [2022-03-20 13:33:46,188 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b145b97b8/c3b281529ba541c4969d0d2a0c9c5ee1/FLAG6a0b5da7f [2022-03-20 13:33:46,206 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b145b97b8/c3b281529ba541c4969d0d2a0c9c5ee1 [2022-03-20 13:33:46,208 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-20 13:33:46,216 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-20 13:33:46,220 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-20 13:33:46,220 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-20 13:33:46,222 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-20 13:33:46,223 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 01:33:46" (1/1) ... [2022-03-20 13:33:46,223 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61b9e454 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:33:46, skipping insertion in model container [2022-03-20 13:33:46,224 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 01:33:46" (1/1) ... [2022-03-20 13:33:46,228 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-20 13:33:46,238 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-20 13:33:46,365 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_iter_incorrect.c[619,632] [2022-03-20 13:33:46,401 WARN L1550 CHandler]: Possible shadowing of function min [2022-03-20 13:33:46,417 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 13:33:46,423 INFO L203 MainTranslator]: Completed pre-run [2022-03-20 13:33:46,431 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_iter_incorrect.c[619,632] [2022-03-20 13:33:46,436 WARN L1550 CHandler]: Possible shadowing of function min [2022-03-20 13:33:46,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 13:33:46,451 INFO L208 MainTranslator]: Completed translation [2022-03-20 13:33:46,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:33:46 WrapperNode [2022-03-20 13:33:46,451 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-20 13:33:46,452 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-20 13:33:46,452 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-20 13:33:46,452 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-20 13:33:46,461 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:33:46" (1/1) ... [2022-03-20 13:33:46,462 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:33:46" (1/1) ... [2022-03-20 13:33:46,480 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:33:46" (1/1) ... [2022-03-20 13:33:46,480 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:33:46" (1/1) ... [2022-03-20 13:33:46,490 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:33:46" (1/1) ... [2022-03-20 13:33:46,498 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:33:46" (1/1) ... [2022-03-20 13:33:46,499 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:33:46" (1/1) ... [2022-03-20 13:33:46,501 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-20 13:33:46,502 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-20 13:33:46,502 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-20 13:33:46,502 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-20 13:33:46,511 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:33:46" (1/1) ... [2022-03-20 13:33:46,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 13:33:46,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 13:33:46,533 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-20 13:33:46,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-20 13:33:46,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-20 13:33:46,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-20 13:33:46,568 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-03-20 13:33:46,568 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-20 13:33:46,568 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-03-20 13:33:46,568 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2022-03-20 13:33:46,568 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2022-03-20 13:33:46,568 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2022-03-20 13:33:46,568 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2022-03-20 13:33:46,569 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2022-03-20 13:33:46,569 INFO L138 BoogieDeclarations]: Found implementation of procedure task [2022-03-20 13:33:46,569 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-20 13:33:46,569 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-03-20 13:33:46,569 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-03-20 13:33:46,569 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-03-20 13:33:46,569 INFO L130 BoogieDeclarations]: Found specification of procedure free [2022-03-20 13:33:46,569 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-03-20 13:33:46,569 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-03-20 13:33:46,569 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-20 13:33:46,569 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-03-20 13:33:46,569 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-20 13:33:46,569 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-20 13:33:46,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-20 13:33:46,570 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-20 13:33:46,570 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2022-03-20 13:33:46,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-20 13:33:46,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-20 13:33:46,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-03-20 13:33:46,570 INFO L130 BoogieDeclarations]: Found specification of procedure min [2022-03-20 13:33:46,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-03-20 13:33:46,570 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2022-03-20 13:33:46,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-20 13:33:46,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-20 13:33:46,570 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2022-03-20 13:33:46,570 INFO L130 BoogieDeclarations]: Found specification of procedure size [2022-03-20 13:33:46,571 INFO L130 BoogieDeclarations]: Found specification of procedure task [2022-03-20 13:33:46,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-20 13:33:46,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-03-20 13:33:46,571 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-20 13:33:46,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-20 13:33:46,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-20 13:33:46,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-20 13:33:46,698 INFO L234 CfgBuilder]: Building ICFG [2022-03-20 13:33:46,700 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-20 13:33:46,926 INFO L275 CfgBuilder]: Performing block encoding [2022-03-20 13:33:46,933 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-20 13:33:46,933 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-03-20 13:33:46,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 01:33:46 BoogieIcfgContainer [2022-03-20 13:33:46,935 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-20 13:33:46,936 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-20 13:33:46,936 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-20 13:33:46,941 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-20 13:33:46,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.03 01:33:46" (1/3) ... [2022-03-20 13:33:46,941 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c83c27a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 01:33:46, skipping insertion in model container [2022-03-20 13:33:46,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:33:46" (2/3) ... [2022-03-20 13:33:46,942 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c83c27a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 01:33:46, skipping insertion in model container [2022-03-20 13:33:46,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 01:33:46" (3/3) ... [2022-03-20 13:33:46,942 INFO L111 eAbstractionObserver]: Analyzing ICFG tree_del_iter_incorrect.c [2022-03-20 13:33:46,949 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-20 13:33:46,949 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-20 13:33:46,984 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-20 13:33:46,988 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-03-20 13:33:46,988 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-20 13:33:47,011 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 59 states have internal predecessors, (71), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-03-20 13:33:47,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-03-20 13:33:47,027 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 13:33:47,028 INFO L499 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] [2022-03-20 13:33:47,028 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 13:33:47,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 13:33:47,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1536185801, now seen corresponding path program 1 times [2022-03-20 13:33:47,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 13:33:47,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2132380727] [2022-03-20 13:33:47,047 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 13:33:47,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1536185801, now seen corresponding path program 2 times [2022-03-20 13:33:47,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 13:33:47,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497862789] [2022-03-20 13:33:47,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 13:33:47,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 13:33:47,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:47,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 13:33:47,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:47,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-03-20 13:33:47,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:47,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-20 13:33:47,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:47,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-20 13:33:47,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:47,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-03-20 13:33:47,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:47,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-03-20 13:33:47,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:47,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-03-20 13:33:47,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:47,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 13:33:47,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 13:33:47,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497862789] [2022-03-20 13:33:47,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497862789] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 13:33:47,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 13:33:47,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-20 13:33:47,229 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 13:33:47,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2132380727] [2022-03-20 13:33:47,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2132380727] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 13:33:47,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 13:33:47,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-20 13:33:47,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019231035] [2022-03-20 13:33:47,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 13:33:47,234 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-20 13:33:47,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 13:33:47,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-20 13:33:47,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-03-20 13:33:47,262 INFO L87 Difference]: Start difference. First operand has 96 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 59 states have internal predecessors, (71), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-03-20 13:33:47,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 13:33:47,564 INFO L93 Difference]: Finished difference Result 168 states and 221 transitions. [2022-03-20 13:33:47,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-20 13:33:47,566 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 44 [2022-03-20 13:33:47,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 13:33:47,572 INFO L225 Difference]: With dead ends: 168 [2022-03-20 13:33:47,573 INFO L226 Difference]: Without dead ends: 95 [2022-03-20 13:33:47,575 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-03-20 13:33:47,577 INFO L913 BasicCegarLoop]: 78 mSDtfsCounter, 167 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 13:33:47,578 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [185 Valid, 80 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 13:33:47,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-03-20 13:33:47,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 88. [2022-03-20 13:33:47,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 53 states have (on average 1.150943396226415) internal successors, (61), 53 states have internal predecessors, (61), 25 states have call successors, (25), 11 states have call predecessors, (25), 9 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-03-20 13:33:47,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 109 transitions. [2022-03-20 13:33:47,615 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 109 transitions. Word has length 44 [2022-03-20 13:33:47,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 13:33:47,615 INFO L478 AbstractCegarLoop]: Abstraction has 88 states and 109 transitions. [2022-03-20 13:33:47,616 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-03-20 13:33:47,616 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 109 transitions. [2022-03-20 13:33:47,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-03-20 13:33:47,618 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 13:33:47,618 INFO L499 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] [2022-03-20 13:33:47,618 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-20 13:33:47,618 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 13:33:47,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 13:33:47,619 INFO L85 PathProgramCache]: Analyzing trace with hash -152757941, now seen corresponding path program 1 times [2022-03-20 13:33:47,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 13:33:47,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [29066554] [2022-03-20 13:33:47,619 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 13:33:47,620 INFO L85 PathProgramCache]: Analyzing trace with hash -152757941, now seen corresponding path program 2 times [2022-03-20 13:33:47,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 13:33:47,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131422329] [2022-03-20 13:33:47,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 13:33:47,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 13:33:47,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:47,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 13:33:47,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:47,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-03-20 13:33:47,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:47,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-20 13:33:47,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:47,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-20 13:33:47,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:47,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-03-20 13:33:47,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:47,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-03-20 13:33:47,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:47,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-03-20 13:33:47,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:47,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 13:33:47,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 13:33:47,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131422329] [2022-03-20 13:33:47,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131422329] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 13:33:47,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 13:33:47,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-20 13:33:47,784 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 13:33:47,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [29066554] [2022-03-20 13:33:47,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [29066554] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 13:33:47,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 13:33:47,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-20 13:33:47,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407587187] [2022-03-20 13:33:47,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 13:33:47,785 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-20 13:33:47,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 13:33:47,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-20 13:33:47,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-03-20 13:33:47,786 INFO L87 Difference]: Start difference. First operand 88 states and 109 transitions. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (10), 6 states have call predecessors, (10), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-03-20 13:33:48,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 13:33:48,230 INFO L93 Difference]: Finished difference Result 154 states and 197 transitions. [2022-03-20 13:33:48,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-20 13:33:48,231 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (10), 6 states have call predecessors, (10), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 44 [2022-03-20 13:33:48,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 13:33:48,233 INFO L225 Difference]: With dead ends: 154 [2022-03-20 13:33:48,233 INFO L226 Difference]: Without dead ends: 97 [2022-03-20 13:33:48,234 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-03-20 13:33:48,235 INFO L913 BasicCegarLoop]: 69 mSDtfsCounter, 98 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-20 13:33:48,236 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 79 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-20 13:33:48,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-03-20 13:33:48,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 90. [2022-03-20 13:33:48,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 55 states have internal predecessors, (62), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (26), 23 states have call predecessors, (26), 23 states have call successors, (26) [2022-03-20 13:33:48,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 113 transitions. [2022-03-20 13:33:48,251 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 113 transitions. Word has length 44 [2022-03-20 13:33:48,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 13:33:48,251 INFO L478 AbstractCegarLoop]: Abstraction has 90 states and 113 transitions. [2022-03-20 13:33:48,251 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (10), 6 states have call predecessors, (10), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-03-20 13:33:48,251 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 113 transitions. [2022-03-20 13:33:48,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-03-20 13:33:48,253 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 13:33:48,253 INFO L499 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] [2022-03-20 13:33:48,253 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-20 13:33:48,253 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 13:33:48,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 13:33:48,253 INFO L85 PathProgramCache]: Analyzing trace with hash 2001282500, now seen corresponding path program 1 times [2022-03-20 13:33:48,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 13:33:48,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [111065301] [2022-03-20 13:33:48,254 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 13:33:48,254 INFO L85 PathProgramCache]: Analyzing trace with hash 2001282500, now seen corresponding path program 2 times [2022-03-20 13:33:48,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 13:33:48,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787818750] [2022-03-20 13:33:48,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 13:33:48,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 13:33:48,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:48,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 13:33:48,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:48,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-03-20 13:33:48,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:48,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-20 13:33:48,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:48,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-20 13:33:48,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:48,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 13:33:48,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:48,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-03-20 13:33:48,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:48,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-03-20 13:33:48,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:48,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-03-20 13:33:48,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:48,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-03-20 13:33:48,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:48,481 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-20 13:33:48,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 13:33:48,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787818750] [2022-03-20 13:33:48,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787818750] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 13:33:48,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573403809] [2022-03-20 13:33:48,482 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 13:33:48,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 13:33:48,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 13:33:48,484 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 13:33:48,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-20 13:33:48,571 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 13:33:48,572 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 13:33:48,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-20 13:33:48,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 13:33:48,812 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-20 13:33:48,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 13:33:49,008 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-20 13:33:49,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573403809] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 13:33:49,008 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 13:33:49,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 15 [2022-03-20 13:33:49,009 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 13:33:49,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [111065301] [2022-03-20 13:33:49,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [111065301] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 13:33:49,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 13:33:49,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-03-20 13:33:49,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099552151] [2022-03-20 13:33:49,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 13:33:49,010 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-20 13:33:49,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 13:33:49,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-20 13:33:49,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-03-20 13:33:49,011 INFO L87 Difference]: Start difference. First operand 90 states and 113 transitions. Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 7 states have internal predecessors, (32), 6 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2022-03-20 13:33:49,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 13:33:49,610 INFO L93 Difference]: Finished difference Result 164 states and 209 transitions. [2022-03-20 13:33:49,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-20 13:33:49,611 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 7 states have internal predecessors, (32), 6 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) Word has length 56 [2022-03-20 13:33:49,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 13:33:49,613 INFO L225 Difference]: With dead ends: 164 [2022-03-20 13:33:49,613 INFO L226 Difference]: Without dead ends: 96 [2022-03-20 13:33:49,614 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 122 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2022-03-20 13:33:49,615 INFO L913 BasicCegarLoop]: 70 mSDtfsCounter, 175 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 1023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-20 13:33:49,615 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [192 Valid, 84 Invalid, 1023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-20 13:33:49,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-03-20 13:33:49,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2022-03-20 13:33:49,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 57 states have internal predecessors, (63), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (28), 23 states have call predecessors, (28), 23 states have call successors, (28) [2022-03-20 13:33:49,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 116 transitions. [2022-03-20 13:33:49,628 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 116 transitions. Word has length 56 [2022-03-20 13:33:49,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 13:33:49,628 INFO L478 AbstractCegarLoop]: Abstraction has 92 states and 116 transitions. [2022-03-20 13:33:49,628 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 7 states have internal predecessors, (32), 6 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2022-03-20 13:33:49,628 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 116 transitions. [2022-03-20 13:33:49,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-03-20 13:33:49,630 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 13:33:49,630 INFO L499 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] [2022-03-20 13:33:49,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-20 13:33:49,847 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 13:33:49,848 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 13:33:49,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 13:33:49,848 INFO L85 PathProgramCache]: Analyzing trace with hash 921875361, now seen corresponding path program 1 times [2022-03-20 13:33:49,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 13:33:49,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [488146951] [2022-03-20 13:33:49,849 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 13:33:49,849 INFO L85 PathProgramCache]: Analyzing trace with hash 921875361, now seen corresponding path program 2 times [2022-03-20 13:33:49,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 13:33:49,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146912583] [2022-03-20 13:33:49,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 13:33:49,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 13:33:49,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:49,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 13:33:49,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:49,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-03-20 13:33:49,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:49,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 13:33:49,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:49,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 13:33:49,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:49,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-20 13:33:49,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:50,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-03-20 13:33:50,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:50,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 13:33:50,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:50,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-03-20 13:33:50,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:50,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-03-20 13:33:50,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:50,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-03-20 13:33:50,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:50,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-03-20 13:33:50,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:50,058 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-03-20 13:33:50,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 13:33:50,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146912583] [2022-03-20 13:33:50,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146912583] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 13:33:50,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 13:33:50,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-03-20 13:33:50,059 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 13:33:50,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [488146951] [2022-03-20 13:33:50,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [488146951] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 13:33:50,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 13:33:50,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-03-20 13:33:50,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386620863] [2022-03-20 13:33:50,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 13:33:50,060 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-20 13:33:50,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 13:33:50,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-20 13:33:50,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-03-20 13:33:50,061 INFO L87 Difference]: Start difference. First operand 92 states and 116 transitions. Second operand has 13 states, 11 states have (on average 3.090909090909091) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (14), 7 states have call predecessors, (14), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-03-20 13:33:50,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 13:33:50,570 INFO L93 Difference]: Finished difference Result 163 states and 208 transitions. [2022-03-20 13:33:50,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-20 13:33:50,570 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.090909090909091) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (14), 7 states have call predecessors, (14), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 66 [2022-03-20 13:33:50,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 13:33:50,572 INFO L225 Difference]: With dead ends: 163 [2022-03-20 13:33:50,572 INFO L226 Difference]: Without dead ends: 98 [2022-03-20 13:33:50,572 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2022-03-20 13:33:50,573 INFO L913 BasicCegarLoop]: 68 mSDtfsCounter, 133 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 868 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 1001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-20 13:33:50,573 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 82 Invalid, 1001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 868 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-20 13:33:50,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-03-20 13:33:50,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2022-03-20 13:33:50,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 59 states have internal predecessors, (64), 25 states have call successors, (25), 11 states have call predecessors, (25), 12 states have return successors, (30), 23 states have call predecessors, (30), 23 states have call successors, (30) [2022-03-20 13:33:50,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 119 transitions. [2022-03-20 13:33:50,583 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 119 transitions. Word has length 66 [2022-03-20 13:33:50,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 13:33:50,583 INFO L478 AbstractCegarLoop]: Abstraction has 94 states and 119 transitions. [2022-03-20 13:33:50,583 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.090909090909091) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (14), 7 states have call predecessors, (14), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-03-20 13:33:50,583 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 119 transitions. [2022-03-20 13:33:50,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-03-20 13:33:50,584 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 13:33:50,584 INFO L499 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] [2022-03-20 13:33:50,584 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-20 13:33:50,585 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 13:33:50,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 13:33:50,585 INFO L85 PathProgramCache]: Analyzing trace with hash 940648973, now seen corresponding path program 1 times [2022-03-20 13:33:50,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 13:33:50,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [882147231] [2022-03-20 13:33:50,585 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 13:33:50,586 INFO L85 PathProgramCache]: Analyzing trace with hash 940648973, now seen corresponding path program 2 times [2022-03-20 13:33:50,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 13:33:50,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956631447] [2022-03-20 13:33:50,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 13:33:50,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 13:33:50,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:50,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 13:33:50,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:50,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-03-20 13:33:50,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:50,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 13:33:50,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:50,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 13:33:50,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:50,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-20 13:33:50,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:50,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 13:33:50,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:50,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-03-20 13:33:50,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:50,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-03-20 13:33:50,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:50,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 13:33:50,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:50,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-03-20 13:33:50,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:50,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-03-20 13:33:50,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:50,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-03-20 13:33:50,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:50,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-03-20 13:33:50,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:50,722 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-03-20 13:33:50,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 13:33:50,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956631447] [2022-03-20 13:33:50,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956631447] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 13:33:50,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 13:33:50,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-03-20 13:33:50,723 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 13:33:50,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [882147231] [2022-03-20 13:33:50,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [882147231] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 13:33:50,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 13:33:50,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-03-20 13:33:50,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941048754] [2022-03-20 13:33:50,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 13:33:50,724 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-20 13:33:50,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 13:33:50,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-20 13:33:50,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-03-20 13:33:50,724 INFO L87 Difference]: Start difference. First operand 94 states and 119 transitions. Second operand has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 5 states have call successors, (16), 7 states have call predecessors, (16), 3 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) [2022-03-20 13:33:51,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 13:33:51,237 INFO L93 Difference]: Finished difference Result 151 states and 192 transitions. [2022-03-20 13:33:51,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-20 13:33:51,238 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 5 states have call successors, (16), 7 states have call predecessors, (16), 3 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) Word has length 79 [2022-03-20 13:33:51,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 13:33:51,239 INFO L225 Difference]: With dead ends: 151 [2022-03-20 13:33:51,239 INFO L226 Difference]: Without dead ends: 98 [2022-03-20 13:33:51,240 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2022-03-20 13:33:51,240 INFO L913 BasicCegarLoop]: 68 mSDtfsCounter, 162 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-20 13:33:51,241 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 82 Invalid, 945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-20 13:33:51,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-03-20 13:33:51,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2022-03-20 13:33:51,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 57 states have (on average 1.1403508771929824) internal successors, (65), 61 states have internal predecessors, (65), 25 states have call successors, (25), 11 states have call predecessors, (25), 13 states have return successors, (33), 23 states have call predecessors, (33), 23 states have call successors, (33) [2022-03-20 13:33:51,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 123 transitions. [2022-03-20 13:33:51,250 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 123 transitions. Word has length 79 [2022-03-20 13:33:51,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 13:33:51,250 INFO L478 AbstractCegarLoop]: Abstraction has 96 states and 123 transitions. [2022-03-20 13:33:51,250 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 5 states have call successors, (16), 7 states have call predecessors, (16), 3 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) [2022-03-20 13:33:51,250 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 123 transitions. [2022-03-20 13:33:51,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-03-20 13:33:51,251 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 13:33:51,251 INFO L499 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] [2022-03-20 13:33:51,251 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-20 13:33:51,252 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 13:33:51,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 13:33:51,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1677199096, now seen corresponding path program 1 times [2022-03-20 13:33:51,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 13:33:51,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [926101214] [2022-03-20 13:33:51,252 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 13:33:51,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1677199096, now seen corresponding path program 2 times [2022-03-20 13:33:51,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 13:33:51,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30487361] [2022-03-20 13:33:51,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 13:33:51,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 13:33:51,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-20 13:33:51,282 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-03-20 13:33:51,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-20 13:33:51,325 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-03-20 13:33:51,326 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-03-20 13:33:51,326 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-03-20 13:33:51,328 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-03-20 13:33:51,329 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-20 13:33:51,331 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2] [2022-03-20 13:33:51,333 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-20 13:33:51,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.03 01:33:51 BoogieIcfgContainer [2022-03-20 13:33:51,364 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-20 13:33:51,365 INFO L158 Benchmark]: Toolchain (without parser) took 5148.62ms. Allocated memory was 209.7MB in the beginning and 263.2MB in the end (delta: 53.5MB). Free memory was 155.5MB in the beginning and 234.4MB in the end (delta: -78.9MB). Peak memory consumption was 121.2MB. Max. memory is 8.0GB. [2022-03-20 13:33:51,366 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 209.7MB. Free memory is still 172.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-20 13:33:51,366 INFO L158 Benchmark]: CACSL2BoogieTranslator took 231.89ms. Allocated memory is still 209.7MB. Free memory was 155.3MB in the beginning and 179.3MB in the end (delta: -24.0MB). Peak memory consumption was 8.5MB. Max. memory is 8.0GB. [2022-03-20 13:33:51,368 INFO L158 Benchmark]: Boogie Preprocessor took 49.58ms. Allocated memory is still 209.7MB. Free memory was 179.3MB in the beginning and 177.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-20 13:33:51,368 INFO L158 Benchmark]: RCFGBuilder took 432.67ms. Allocated memory is still 209.7MB. Free memory was 177.2MB in the beginning and 158.4MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-03-20 13:33:51,368 INFO L158 Benchmark]: TraceAbstraction took 4428.31ms. Allocated memory was 209.7MB in the beginning and 263.2MB in the end (delta: 53.5MB). Free memory was 157.6MB in the beginning and 234.4MB in the end (delta: -76.8MB). Peak memory consumption was 123.2MB. Max. memory is 8.0GB. [2022-03-20 13:33:51,369 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 209.7MB. Free memory is still 172.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 231.89ms. Allocated memory is still 209.7MB. Free memory was 155.3MB in the beginning and 179.3MB in the end (delta: -24.0MB). Peak memory consumption was 8.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 49.58ms. Allocated memory is still 209.7MB. Free memory was 179.3MB in the beginning and 177.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 432.67ms. Allocated memory is still 209.7MB. Free memory was 177.2MB in the beginning and 158.4MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 4428.31ms. Allocated memory was 209.7MB in the beginning and 263.2MB in the end (delta: 53.5MB). Free memory was 157.6MB in the beginning and 234.4MB in the end (delta: -76.8MB). Peak memory consumption was 123.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 16]: a call to reach_error is reachable a call to reach_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; [L30] RET, EXPR nondet_tree() [L30] n->left = nondet_tree() [L31] CALL, EXPR nondet_tree() [L25] COND TRUE __VERIFIER_nondet_bool() [L26] return 0; [L31] RET, EXPR nondet_tree() [L31] n->right = nondet_tree() [L32] return n; [L105] RET, EXPR nondet_tree() [L105] CALL task(nondet_tree()) [L83] CALL, EXPR min(t) [L37] COND FALSE !(!n) [L40] EXPR n->left [L40] CALL, EXPR min(n->left) [L37] COND TRUE !n [L38] return 2147483647; [L40] RET, EXPR min(n->left) [L40] int a = min(n->left); [L41] EXPR n->right [L41] CALL, EXPR min(n->right) [L37] COND TRUE !n [L38] return 2147483647; [L41] RET, EXPR min(n->right) [L41] int b = min(n->right); [L42] COND TRUE a <= b [L42] return a; [L83] RET, EXPR min(t) [L83] int a = min(t); [L84] int b; [L86] CALL, EXPR size(t) [L78] COND FALSE !(!t) [L79] EXPR t->left [L79] CALL, EXPR size(t->left) [L78] COND TRUE !t [L78] return 0; [L79] RET, EXPR size(t->left) [L79] EXPR t->right [L79] CALL, EXPR size(t->right) [L78] COND TRUE !t [L78] return 0; [L79] RET, EXPR size(t->right) [L79] return size(t->left) + size(t->right) + 1; [L86] RET, EXPR size(t) [L86] int n = size(t); [L87] CALL assume_abort_if_not(n != 0) [L10] COND FALSE !(!cond) [L87] RET assume_abort_if_not(n != 0) [L88] EXPR, FCALL calloc(n, sizeof(int)) [L88] int *x = calloc(n, sizeof(int)); [L89] CALL tree_inorder(t, x, n) [L67] COND FALSE !(!t) [L70] EXPR t->left [L70] CALL, EXPR tree_inorder(t->left, a, i) [L67] COND TRUE !t [L68] return i; [L70] RET, EXPR tree_inorder(t->left, a, i) [L70] i = tree_inorder(t->left, a, i) [L71] EXPR i++ [L71] EXPR t->data [L71] a[i++] = t->data [L72] EXPR t->right [L72] CALL, EXPR tree_inorder(t->right, a, i) [L67] COND TRUE !t [L68] return i; [L72] RET, EXPR tree_inorder(t->right, a, i) [L72] i = tree_inorder(t->right, a, i) [L73] return i; [L89] RET tree_inorder(t, x, n) [L90] EXPR x[0] [L90] CALL __VERIFIER_assert(a == x[0]) [L16] COND TRUE !cond [L16] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 13 procedures, 99 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.3s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 790 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 735 mSDsluCounter, 407 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 54 mSDsCounter, 720 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3258 IncrementalHoareTripleChecker+Invalid, 3978 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 720 mSolverCounterUnsat, 353 mSDtfsCounter, 3258 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 286 GetRequests, 194 SyntacticMatches, 3 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=0, InterpolantAutomatonStates: 61, 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: No data available, 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! [2022-03-20 13:33:51,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...