/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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/verifythis/tree_del_iter_incorrect.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-06 10:41:54,380 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-06 10:41:54,381 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-06 10:41:54,403 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-06 10:41:54,403 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-06 10:41:54,404 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-06 10:41:54,408 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-06 10:41:54,412 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-06 10:41:54,413 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-06 10:41:54,416 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-06 10:41:54,416 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-06 10:41:54,417 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-06 10:41:54,417 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-06 10:41:54,417 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-06 10:41:54,418 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-06 10:41:54,419 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-06 10:41:54,419 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-06 10:41:54,419 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-06 10:41:54,420 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-06 10:41:54,421 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-06 10:41:54,422 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-06 10:41:54,422 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-06 10:41:54,423 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-06 10:41:54,424 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-06 10:41:54,424 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-06 10:41:54,425 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-06 10:41:54,426 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-06 10:41:54,426 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-06 10:41:54,426 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-06 10:41:54,426 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-06 10:41:54,427 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-06 10:41:54,427 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-06 10:41:54,427 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-06 10:41:54,428 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-06 10:41:54,428 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-06 10:41:54,429 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-06 10:41:54,429 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-06 10:41:54,429 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-06 10:41:54,430 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-06 10:41:54,430 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-06 10:41:54,430 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-06 10:41:54,433 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-06 10:41:54,433 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-06 10:41:54,450 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-06 10:41:54,450 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-06 10:41:54,451 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-06 10:41:54,451 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-06 10:41:54,452 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-06 10:41:54,452 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-06 10:41:54,452 INFO L138 SettingsManager]: * Use SBE=true [2022-04-06 10:41:54,452 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-06 10:41:54,452 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-06 10:41:54,453 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-06 10:41:54,453 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-06 10:41:54,453 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-06 10:41:54,453 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-06 10:41:54,453 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-06 10:41:54,453 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-06 10:41:54,453 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-06 10:41:54,453 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-06 10:41:54,454 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-06 10:41:54,454 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-06 10:41:54,454 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-06 10:41:54,454 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-06 10:41:54,454 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-06 10:41:54,454 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-06 10:41:54,454 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-06 10:41:54,454 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-06 10:41:54,454 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-06 10:41:54,454 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-06 10:41:54,454 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-06 10:41:54,455 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-06 10:41:54,455 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR 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-04-06 10:41:54,617 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-06 10:41:54,637 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-06 10:41:54,639 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-06 10:41:54,640 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-06 10:41:54,646 INFO L275 PluginConnector]: CDTParser initialized [2022-04-06 10:41:54,650 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-04-06 10:41:54,700 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98af82bdc/65241ec316254078964b2b4acf29bce4/FLAGff66515af [2022-04-06 10:41:55,069 INFO L306 CDTParser]: Found 1 translation units. [2022-04-06 10:41:55,069 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_iter_incorrect.c [2022-04-06 10:41:55,081 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98af82bdc/65241ec316254078964b2b4acf29bce4/FLAGff66515af [2022-04-06 10:41:55,494 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98af82bdc/65241ec316254078964b2b4acf29bce4 [2022-04-06 10:41:55,497 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-06 10:41:55,498 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-06 10:41:55,510 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-06 10:41:55,510 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-06 10:41:55,512 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-06 10:41:55,513 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 10:41:55" (1/1) ... [2022-04-06 10:41:55,513 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6eedf8d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 10:41:55, skipping insertion in model container [2022-04-06 10:41:55,513 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 10:41:55" (1/1) ... [2022-04-06 10:41:55,517 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-06 10:41:55,531 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-06 10:41:55,630 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-04-06 10:41:55,642 WARN L1550 CHandler]: Possible shadowing of function min [2022-04-06 10:41:55,656 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-06 10:41:55,662 INFO L203 MainTranslator]: Completed pre-run [2022-04-06 10:41:55,677 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-04-06 10:41:55,693 WARN L1550 CHandler]: Possible shadowing of function min [2022-04-06 10:41:55,701 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-06 10:41:55,718 INFO L208 MainTranslator]: Completed translation [2022-04-06 10:41:55,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 10:41:55 WrapperNode [2022-04-06 10:41:55,719 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-06 10:41:55,720 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-06 10:41:55,720 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-06 10:41:55,720 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-06 10:41:55,727 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 10:41:55" (1/1) ... [2022-04-06 10:41:55,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 10:41:55" (1/1) ... [2022-04-06 10:41:55,734 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 10:41:55" (1/1) ... [2022-04-06 10:41:55,734 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 10:41:55" (1/1) ... [2022-04-06 10:41:55,742 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 10:41:55" (1/1) ... [2022-04-06 10:41:55,745 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 10:41:55" (1/1) ... [2022-04-06 10:41:55,746 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 10:41:55" (1/1) ... [2022-04-06 10:41:55,749 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-06 10:41:55,749 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-06 10:41:55,749 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-06 10:41:55,749 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-06 10:41:55,750 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 10:41:55" (1/1) ... [2022-04-06 10:41:55,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-06 10:41:55,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 10:41:55,784 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-04-06 10:41:55,799 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-04-06 10:41:55,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-06 10:41:55,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-06 10:41:55,812 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-06 10:41:55,812 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-06 10:41:55,812 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-06 10:41:55,812 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2022-04-06 10:41:55,812 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2022-04-06 10:41:55,812 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2022-04-06 10:41:55,813 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2022-04-06 10:41:55,813 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2022-04-06 10:41:55,813 INFO L138 BoogieDeclarations]: Found implementation of procedure task [2022-04-06 10:41:55,813 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-06 10:41:55,813 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-06 10:41:55,813 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-06 10:41:55,813 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-06 10:41:55,813 INFO L130 BoogieDeclarations]: Found specification of procedure free [2022-04-06 10:41:55,813 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-06 10:41:55,813 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-04-06 10:41:55,813 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-06 10:41:55,814 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-06 10:41:55,814 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-06 10:41:55,814 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-06 10:41:55,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-06 10:41:55,814 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-06 10:41:55,814 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2022-04-06 10:41:55,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-06 10:41:55,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-06 10:41:55,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-06 10:41:55,814 INFO L130 BoogieDeclarations]: Found specification of procedure min [2022-04-06 10:41:55,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-06 10:41:55,815 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2022-04-06 10:41:55,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-06 10:41:55,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-06 10:41:55,815 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2022-04-06 10:41:55,815 INFO L130 BoogieDeclarations]: Found specification of procedure size [2022-04-06 10:41:55,815 INFO L130 BoogieDeclarations]: Found specification of procedure task [2022-04-06 10:41:55,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-06 10:41:55,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-06 10:41:55,815 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-06 10:41:55,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-06 10:41:55,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-06 10:41:55,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-06 10:41:55,885 INFO L234 CfgBuilder]: Building ICFG [2022-04-06 10:41:55,886 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-06 10:41:56,101 INFO L275 CfgBuilder]: Performing block encoding [2022-04-06 10:41:56,111 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-06 10:41:56,111 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-06 10:41:56,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 10:41:56 BoogieIcfgContainer [2022-04-06 10:41:56,112 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-06 10:41:56,114 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-06 10:41:56,114 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-06 10:41:56,114 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-06 10:41:56,116 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 10:41:56" (1/1) ... [2022-04-06 10:41:56,118 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-06 10:41:56,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 06.04 10:41:56 BasicIcfg [2022-04-06 10:41:56,145 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-06 10:41:56,147 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-06 10:41:56,147 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-06 10:41:56,149 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-06 10:41:56,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.04 10:41:55" (1/4) ... [2022-04-06 10:41:56,149 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d4d0b80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 10:41:56, skipping insertion in model container [2022-04-06 10:41:56,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 10:41:55" (2/4) ... [2022-04-06 10:41:56,150 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d4d0b80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 10:41:56, skipping insertion in model container [2022-04-06 10:41:56,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 10:41:56" (3/4) ... [2022-04-06 10:41:56,150 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d4d0b80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.04 10:41:56, skipping insertion in model container [2022-04-06 10:41:56,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 06.04 10:41:56" (4/4) ... [2022-04-06 10:41:56,151 INFO L111 eAbstractionObserver]: Analyzing ICFG tree_del_iter_incorrect.cqvasr [2022-04-06 10:41:56,154 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-06 10:41:56,154 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-06 10:41:56,188 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-06 10:41:56,192 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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-04-06 10:41:56,192 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-06 10:41:56,204 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-04-06 10:41:56,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-06 10:41:56,210 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 10:41:56,211 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-04-06 10:41:56,222 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 10:41:56,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 10:41:56,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1775030715, now seen corresponding path program 1 times [2022-04-06 10:41:56,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 10:41:56,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747641830] [2022-04-06 10:41:56,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 10:41:56,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 10:41:56,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:56,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 10:41:56,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:56,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-04-06 10:41:56,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:56,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-06 10:41:56,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:56,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-06 10:41:56,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:56,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-06 10:41:56,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:56,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-06 10:41:56,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:56,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-04-06 10:41:56,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:56,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 10:41:56,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 10:41:56,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747641830] [2022-04-06 10:41:56,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747641830] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 10:41:56,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 10:41:56,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 10:41:56,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292352733] [2022-04-06 10:41:56,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 10:41:56,520 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-06 10:41:56,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 10:41:56,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-06 10:41:56,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-06 10:41:56,544 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-04-06 10:41:56,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 10:41:56,861 INFO L93 Difference]: Finished difference Result 168 states and 221 transitions. [2022-04-06 10:41:56,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-06 10:41:56,863 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-04-06 10:41:56,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 10:41:56,876 INFO L225 Difference]: With dead ends: 168 [2022-04-06 10:41:56,876 INFO L226 Difference]: Without dead ends: 95 [2022-04-06 10:41:56,880 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-04-06 10:41:56,889 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-04-06 10:41:56,892 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-04-06 10:41:56,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-06 10:41:56,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 88. [2022-04-06 10:41:56,934 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-04-06 10:41:56,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 109 transitions. [2022-04-06 10:41:56,942 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 109 transitions. Word has length 44 [2022-04-06 10:41:56,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 10:41:56,943 INFO L478 AbstractCegarLoop]: Abstraction has 88 states and 109 transitions. [2022-04-06 10:41:56,943 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-04-06 10:41:56,943 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 109 transitions. [2022-04-06 10:41:56,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-06 10:41:56,947 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 10:41:56,948 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-04-06 10:41:56,948 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-06 10:41:56,950 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 10:41:56,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 10:41:56,950 INFO L85 PathProgramCache]: Analyzing trace with hash 930558844, now seen corresponding path program 1 times [2022-04-06 10:41:56,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 10:41:56,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741113623] [2022-04-06 10:41:56,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 10:41:56,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 10:41:56,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:57,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 10:41:57,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:57,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-04-06 10:41:57,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:57,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-06 10:41:57,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:57,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-06 10:41:57,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:57,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-06 10:41:57,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:57,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-06 10:41:57,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:57,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-04-06 10:41:57,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:57,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 10:41:57,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 10:41:57,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741113623] [2022-04-06 10:41:57,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741113623] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 10:41:57,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 10:41:57,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-06 10:41:57,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014932887] [2022-04-06 10:41:57,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 10:41:57,141 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-06 10:41:57,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 10:41:57,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-06 10:41:57,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-04-06 10:41:57,142 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-04-06 10:41:57,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 10:41:57,651 INFO L93 Difference]: Finished difference Result 154 states and 197 transitions. [2022-04-06 10:41:57,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-06 10:41:57,652 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-04-06 10:41:57,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 10:41:57,653 INFO L225 Difference]: With dead ends: 154 [2022-04-06 10:41:57,653 INFO L226 Difference]: Without dead ends: 97 [2022-04-06 10:41:57,654 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-04-06 10:41:57,655 INFO L913 BasicCegarLoop]: 69 mSDtfsCounter, 131 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-06 10:41:57,655 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 79 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-06 10:41:57,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-06 10:41:57,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 90. [2022-04-06 10:41:57,663 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-04-06 10:41:57,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 113 transitions. [2022-04-06 10:41:57,664 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 113 transitions. Word has length 44 [2022-04-06 10:41:57,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 10:41:57,664 INFO L478 AbstractCegarLoop]: Abstraction has 90 states and 113 transitions. [2022-04-06 10:41:57,665 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-04-06 10:41:57,665 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 113 transitions. [2022-04-06 10:41:57,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-06 10:41:57,666 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 10:41:57,666 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-04-06 10:41:57,666 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-06 10:41:57,666 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 10:41:57,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 10:41:57,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1268495097, now seen corresponding path program 1 times [2022-04-06 10:41:57,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 10:41:57,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120028876] [2022-04-06 10:41:57,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 10:41:57,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 10:41:57,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:57,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 10:41:57,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:57,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-04-06 10:41:57,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:57,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-06 10:41:57,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:57,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-06 10:41:57,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:57,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-06 10:41:57,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:57,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-04-06 10:41:57,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:57,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-04-06 10:41:57,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:57,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-04-06 10:41:57,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:57,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-06 10:41:57,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:57,844 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-06 10:41:57,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 10:41:57,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120028876] [2022-04-06 10:41:57,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120028876] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 10:41:57,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893194067] [2022-04-06 10:41:57,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 10:41:57,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 10:41:57,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 10:41:57,887 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-04-06 10:41:57,947 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-04-06 10:41:57,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:57,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-06 10:41:57,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 10:41:58,244 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-06 10:41:58,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 10:41:58,420 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-06 10:41:58,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893194067] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 10:41:58,420 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-06 10:41:58,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 15 [2022-04-06 10:41:58,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530904502] [2022-04-06 10:41:58,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-06 10:41:58,421 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-06 10:41:58,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 10:41:58,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-06 10:41:58,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-04-06 10:41:58,422 INFO L87 Difference]: Start difference. First operand 90 states and 113 transitions. Second operand has 15 states, 14 states have (on average 3.5) internal successors, (49), 9 states have internal predecessors, (49), 6 states have call successors, (20), 7 states have call predecessors, (20), 4 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-06 10:41:59,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 10:41:59,033 INFO L93 Difference]: Finished difference Result 164 states and 209 transitions. [2022-04-06 10:41:59,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-06 10:41:59,033 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.5) internal successors, (49), 9 states have internal predecessors, (49), 6 states have call successors, (20), 7 states have call predecessors, (20), 4 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) Word has length 56 [2022-04-06 10:41:59,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 10:41:59,038 INFO L225 Difference]: With dead ends: 164 [2022-04-06 10:41:59,038 INFO L226 Difference]: Without dead ends: 96 [2022-04-06 10:41:59,040 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 122 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2022-04-06 10:41:59,042 INFO L913 BasicCegarLoop]: 70 mSDtfsCounter, 108 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 1024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-06 10:41:59,044 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 84 Invalid, 1024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 927 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-06 10:41:59,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-06 10:41:59,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2022-04-06 10:41:59,063 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-04-06 10:41:59,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 116 transitions. [2022-04-06 10:41:59,064 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 116 transitions. Word has length 56 [2022-04-06 10:41:59,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 10:41:59,064 INFO L478 AbstractCegarLoop]: Abstraction has 92 states and 116 transitions. [2022-04-06 10:41:59,065 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.5) internal successors, (49), 9 states have internal predecessors, (49), 6 states have call successors, (20), 7 states have call predecessors, (20), 4 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-06 10:41:59,065 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 116 transitions. [2022-04-06 10:41:59,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-06 10:41:59,066 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 10:41:59,066 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-04-06 10:41:59,095 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-04-06 10:41:59,268 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-04-06 10:41:59,268 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 10:41:59,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 10:41:59,269 INFO L85 PathProgramCache]: Analyzing trace with hash 929625533, now seen corresponding path program 1 times [2022-04-06 10:41:59,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 10:41:59,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031526746] [2022-04-06 10:41:59,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 10:41:59,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 10:41:59,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:59,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 10:41:59,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:59,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-04-06 10:41:59,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:59,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-06 10:41:59,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:59,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-06 10:41:59,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:59,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-06 10:41:59,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:59,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-04-06 10:41:59,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:59,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-06 10:41:59,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:59,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-04-06 10:41:59,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:59,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-04-06 10:41:59,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:59,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-04-06 10:41:59,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:59,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-04-06 10:41:59,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:59,478 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-06 10:41:59,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 10:41:59,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031526746] [2022-04-06 10:41:59,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031526746] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 10:41:59,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 10:41:59,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-06 10:41:59,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810102325] [2022-04-06 10:41:59,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 10:41:59,482 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-06 10:41:59,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 10:41:59,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-06 10:41:59,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-04-06 10:41:59,483 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-04-06 10:41:59,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 10:41:59,984 INFO L93 Difference]: Finished difference Result 163 states and 208 transitions. [2022-04-06 10:41:59,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-06 10:41:59,986 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-04-06 10:41:59,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 10:41:59,988 INFO L225 Difference]: With dead ends: 163 [2022-04-06 10:41:59,988 INFO L226 Difference]: Without dead ends: 98 [2022-04-06 10:41:59,989 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-04-06 10:41:59,991 INFO L913 BasicCegarLoop]: 68 mSDtfsCounter, 168 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-06 10:41:59,992 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 82 Invalid, 990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-06 10:41:59,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-06 10:42:00,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2022-04-06 10:42:00,008 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-04-06 10:42:00,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 119 transitions. [2022-04-06 10:42:00,010 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 119 transitions. Word has length 66 [2022-04-06 10:42:00,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 10:42:00,010 INFO L478 AbstractCegarLoop]: Abstraction has 94 states and 119 transitions. [2022-04-06 10:42:00,011 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-04-06 10:42:00,011 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 119 transitions. [2022-04-06 10:42:00,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-06 10:42:00,016 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 10:42:00,016 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-04-06 10:42:00,016 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-06 10:42:00,016 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 10:42:00,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 10:42:00,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1535547247, now seen corresponding path program 1 times [2022-04-06 10:42:00,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 10:42:00,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239610537] [2022-04-06 10:42:00,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 10:42:00,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 10:42:00,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:42:00,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 10:42:00,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:42:00,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-04-06 10:42:00,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:42:00,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-06 10:42:00,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:42:00,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-06 10:42:00,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:42:00,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-06 10:42:00,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:42:00,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-06 10:42:00,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:42:00,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-04-06 10:42:00,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:42:00,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-04-06 10:42:00,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:42:00,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-06 10:42:00,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:42:00,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-04-06 10:42:00,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:42:00,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-04-06 10:42:00,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:42:00,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-04-06 10:42:00,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:42:00,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-04-06 10:42:00,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:42:00,179 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-06 10:42:00,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 10:42:00,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239610537] [2022-04-06 10:42:00,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239610537] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 10:42:00,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 10:42:00,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-06 10:42:00,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815534815] [2022-04-06 10:42:00,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 10:42:00,181 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-06 10:42:00,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 10:42:00,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-06 10:42:00,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-04-06 10:42:00,181 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-04-06 10:42:00,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 10:42:00,685 INFO L93 Difference]: Finished difference Result 151 states and 192 transitions. [2022-04-06 10:42:00,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-06 10:42:00,686 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-04-06 10:42:00,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 10:42:00,687 INFO L225 Difference]: With dead ends: 151 [2022-04-06 10:42:00,687 INFO L226 Difference]: Without dead ends: 98 [2022-04-06 10:42:00,687 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-04-06 10:42:00,688 INFO L913 BasicCegarLoop]: 68 mSDtfsCounter, 160 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-06 10:42:00,703 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 82 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-06 10:42:00,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-06 10:42:00,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2022-04-06 10:42:00,708 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-04-06 10:42:00,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 123 transitions. [2022-04-06 10:42:00,709 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 123 transitions. Word has length 79 [2022-04-06 10:42:00,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 10:42:00,709 INFO L478 AbstractCegarLoop]: Abstraction has 96 states and 123 transitions. [2022-04-06 10:42:00,709 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-04-06 10:42:00,709 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 123 transitions. [2022-04-06 10:42:00,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-06 10:42:00,710 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 10:42:00,710 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-04-06 10:42:00,710 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-06 10:42:00,710 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 10:42:00,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 10:42:00,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1129846937, now seen corresponding path program 1 times [2022-04-06 10:42:00,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 10:42:00,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581941092] [2022-04-06 10:42:00,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 10:42:00,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 10:42:00,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-06 10:42:00,750 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-06 10:42:00,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-06 10:42:00,785 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-06 10:42:00,786 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-06 10:42:00,786 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-06 10:42:00,787 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-06 10:42:00,789 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-04-06 10:42:00,791 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-06 10:42:00,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.04 10:42:00 BasicIcfg [2022-04-06 10:42:00,817 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-06 10:42:00,818 INFO L158 Benchmark]: Toolchain (without parser) took 5320.09ms. Allocated memory was 187.7MB in the beginning and 256.9MB in the end (delta: 69.2MB). Free memory was 159.7MB in the beginning and 209.7MB in the end (delta: -50.0MB). Peak memory consumption was 19.7MB. Max. memory is 8.0GB. [2022-04-06 10:42:00,818 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 187.7MB. Free memory is still 145.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-06 10:42:00,818 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.83ms. Allocated memory was 187.7MB in the beginning and 256.9MB in the end (delta: 69.2MB). Free memory was 159.3MB in the beginning and 225.0MB in the end (delta: -65.6MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-04-06 10:42:00,818 INFO L158 Benchmark]: Boogie Preprocessor took 28.53ms. Allocated memory is still 256.9MB. Free memory was 225.0MB in the beginning and 222.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-06 10:42:00,818 INFO L158 Benchmark]: RCFGBuilder took 363.29ms. Allocated memory is still 256.9MB. Free memory was 222.5MB in the beginning and 203.6MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-04-06 10:42:00,819 INFO L158 Benchmark]: IcfgTransformer took 31.81ms. Allocated memory is still 256.9MB. Free memory was 203.6MB in the beginning and 201.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-06 10:42:00,819 INFO L158 Benchmark]: TraceAbstraction took 4670.93ms. Allocated memory is still 256.9MB. Free memory was 201.0MB in the beginning and 209.7MB in the end (delta: -8.7MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-06 10:42:00,820 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.13ms. Allocated memory is still 187.7MB. Free memory is still 145.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 209.83ms. Allocated memory was 187.7MB in the beginning and 256.9MB in the end (delta: 69.2MB). Free memory was 159.3MB in the beginning and 225.0MB in the end (delta: -65.6MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.53ms. Allocated memory is still 256.9MB. Free memory was 225.0MB in the beginning and 222.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 363.29ms. Allocated memory is still 256.9MB. Free memory was 222.5MB in the beginning and 203.6MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * IcfgTransformer took 31.81ms. Allocated memory is still 256.9MB. Free memory was 203.6MB in the beginning and 201.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 4670.93ms. Allocated memory is still 256.9MB. Free memory was 201.0MB in the beginning and 209.7MB in the end (delta: -8.7MB). There was no memory consumed. 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; VAL [\result={0:0}] [L30] RET, EXPR nondet_tree() VAL [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 [n={-2:0}, nondet_tree()={0:0}] [L31] n->right = nondet_tree() [L32] return n; VAL [\result={-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={5: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={5: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={5:0}, n=1, t={-2:0}, t={-2:0}] [L88] EXPR, FCALL calloc(n, sizeof(int)) VAL [a=2147483647, b={5: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={5: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={5: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={5: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] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 12 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.6s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 789 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 734 mSDsluCounter, 407 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 54 mSDsCounter, 695 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3337 IncrementalHoareTripleChecker+Invalid, 4032 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 695 mSolverCounterUnsat, 353 mSDtfsCounter, 3337 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: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 436 NumberOfCodeBlocks, 436 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 394 ConstructedInterpolants, 0 QuantifiedInterpolants, 1065 SizeOfPredicates, 4 NumberOfNonLiveVariables, 280 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 84/90 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! [2022-04-06 10:42:00,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...