./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5a7a61549e909154c33d5cf68876338c8745b83dde5aedff258c17f34600afc7 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 18:09:37,393 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 18:09:37,394 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 18:09:37,418 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 18:09:37,419 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 18:09:37,420 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 18:09:37,426 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 18:09:37,428 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 18:09:37,430 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 18:09:37,434 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 18:09:37,435 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 18:09:37,436 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 18:09:37,436 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 18:09:37,438 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 18:09:37,439 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 18:09:37,440 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 18:09:37,441 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 18:09:37,443 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 18:09:37,446 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 18:09:37,447 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 18:09:37,451 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 18:09:37,452 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 18:09:37,452 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 18:09:37,453 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 18:09:37,454 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 18:09:37,458 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 18:09:37,458 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 18:09:37,459 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 18:09:37,459 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 18:09:37,460 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 18:09:37,461 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 18:09:37,461 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 18:09:37,462 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 18:09:37,462 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 18:09:37,463 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 18:09:37,463 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 18:09:37,463 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 18:09:37,464 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 18:09:37,464 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 18:09:37,464 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 18:09:37,465 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 18:09:37,466 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 18:09:37,467 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 18:09:37,492 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 18:09:37,494 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 18:09:37,494 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 18:09:37,495 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 18:09:37,495 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 18:09:37,495 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 18:09:37,496 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 18:09:37,496 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 18:09:37,496 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 18:09:37,497 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 18:09:37,497 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 18:09:37,497 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 18:09:37,497 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 18:09:37,497 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 18:09:37,497 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 18:09:37,498 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 18:09:37,498 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 18:09:37,498 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 18:09:37,498 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 18:09:37,499 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 18:09:37,499 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 18:09:37,499 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 18:09:37,500 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 18:09:37,500 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 18:09:37,500 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 18:09:37,500 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 18:09:37,500 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 18:09:37,501 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 18:09:37,501 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 18:09:37,501 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 18:09:37,501 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 18:09:37,501 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 18:09:37,501 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 18:09:37,501 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5a7a61549e909154c33d5cf68876338c8745b83dde5aedff258c17f34600afc7 [2022-07-13 18:09:37,673 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 18:09:37,687 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 18:09:37,689 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 18:09:37,690 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 18:09:37,690 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 18:09:37,691 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c [2022-07-13 18:09:37,745 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f2932310/b37d808588304b60a456bdaebf92adb6/FLAGe157895e6 [2022-07-13 18:09:38,118 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 18:09:38,118 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c [2022-07-13 18:09:38,127 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f2932310/b37d808588304b60a456bdaebf92adb6/FLAGe157895e6 [2022-07-13 18:09:38,137 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f2932310/b37d808588304b60a456bdaebf92adb6 [2022-07-13 18:09:38,139 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 18:09:38,140 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 18:09:38,141 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 18:09:38,141 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 18:09:38,153 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 18:09:38,153 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 06:09:38" (1/1) ... [2022-07-13 18:09:38,154 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b8b50f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:09:38, skipping insertion in model container [2022-07-13 18:09:38,154 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 06:09:38" (1/1) ... [2022-07-13 18:09:38,159 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 18:09:38,170 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 18:09:38,304 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c[618,631] [2022-07-13 18:09:38,316 WARN L1550 CHandler]: Possible shadowing of function min [2022-07-13 18:09:38,321 WARN L1550 CHandler]: Possible shadowing of function min [2022-07-13 18:09:38,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 18:09:38,347 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 18:09:38,359 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c[618,631] [2022-07-13 18:09:38,365 WARN L1550 CHandler]: Possible shadowing of function min [2022-07-13 18:09:38,368 WARN L1550 CHandler]: Possible shadowing of function min [2022-07-13 18:09:38,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 18:09:38,394 INFO L208 MainTranslator]: Completed translation [2022-07-13 18:09:38,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:09:38 WrapperNode [2022-07-13 18:09:38,394 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 18:09:38,395 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 18:09:38,396 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 18:09:38,396 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 18:09:38,401 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:09:38" (1/1) ... [2022-07-13 18:09:38,419 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:09:38" (1/1) ... [2022-07-13 18:09:38,439 INFO L137 Inliner]: procedures = 29, calls = 58, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 69 [2022-07-13 18:09:38,439 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 18:09:38,440 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 18:09:38,440 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 18:09:38,441 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 18:09:38,446 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:09:38" (1/1) ... [2022-07-13 18:09:38,447 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:09:38" (1/1) ... [2022-07-13 18:09:38,461 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:09:38" (1/1) ... [2022-07-13 18:09:38,461 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:09:38" (1/1) ... [2022-07-13 18:09:38,471 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:09:38" (1/1) ... [2022-07-13 18:09:38,479 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:09:38" (1/1) ... [2022-07-13 18:09:38,481 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:09:38" (1/1) ... [2022-07-13 18:09:38,486 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 18:09:38,489 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 18:09:38,489 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 18:09:38,490 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 18:09:38,491 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:09:38" (1/1) ... [2022-07-13 18:09:38,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 18:09:38,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:09:38,513 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-07-13 18:09:38,531 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-07-13 18:09:38,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 18:09:38,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 18:09:38,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 18:09:38,546 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2022-07-13 18:09:38,546 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2022-07-13 18:09:38,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 18:09:38,547 INFO L130 BoogieDeclarations]: Found specification of procedure min [2022-07-13 18:09:38,547 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2022-07-13 18:09:38,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 18:09:38,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-13 18:09:38,547 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-13 18:09:38,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 18:09:38,547 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2022-07-13 18:09:38,548 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2022-07-13 18:09:38,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 18:09:38,548 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 18:09:38,548 INFO L130 BoogieDeclarations]: Found specification of procedure size [2022-07-13 18:09:38,548 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2022-07-13 18:09:38,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 18:09:38,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 18:09:38,549 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-13 18:09:38,549 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-13 18:09:38,549 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2022-07-13 18:09:38,549 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2022-07-13 18:09:38,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 18:09:38,632 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 18:09:38,637 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 18:09:38,850 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 18:09:38,856 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 18:09:38,856 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-13 18:09:38,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 06:09:38 BoogieIcfgContainer [2022-07-13 18:09:38,858 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 18:09:38,859 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 18:09:38,859 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 18:09:38,861 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 18:09:38,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 06:09:38" (1/3) ... [2022-07-13 18:09:38,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ec258b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 06:09:38, skipping insertion in model container [2022-07-13 18:09:38,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:09:38" (2/3) ... [2022-07-13 18:09:38,863 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ec258b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 06:09:38, skipping insertion in model container [2022-07-13 18:09:38,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 06:09:38" (3/3) ... [2022-07-13 18:09:38,864 INFO L111 eAbstractionObserver]: Analyzing ICFG tree_del_rec_incorrect.c [2022-07-13 18:09:38,880 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 18:09:38,880 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 18:09:38,917 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 18:09:38,922 INFO L357 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=PETRI_NET, 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@559c7519, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@67354c0b [2022-07-13 18:09:38,922 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 18:09:38,928 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 54 states have internal predecessors, (64), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-07-13 18:09:38,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-13 18:09:38,934 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:09:38,935 INFO L195 NwaCegarLoop]: 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] [2022-07-13 18:09:38,936 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:09:38,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:09:38,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1201346449, now seen corresponding path program 1 times [2022-07-13 18:09:38,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:09:38,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106006628] [2022-07-13 18:09:38,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:09:38,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:09:39,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:39,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:09:39,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:39,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 18:09:39,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:39,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 18:09:39,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:39,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 18:09:39,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:39,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-13 18:09:39,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:39,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 18:09:39,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:09:39,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106006628] [2022-07-13 18:09:39,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106006628] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:09:39,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:09:39,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 18:09:39,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657232088] [2022-07-13 18:09:39,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:09:39,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 18:09:39,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:09:39,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 18:09:39,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-13 18:09:39,223 INFO L87 Difference]: Start difference. First operand has 84 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 54 states have internal predecessors, (64), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 18:09:39,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:09:39,391 INFO L93 Difference]: Finished difference Result 148 states and 196 transitions. [2022-07-13 18:09:39,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 18:09:39,393 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-07-13 18:09:39,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:09:39,402 INFO L225 Difference]: With dead ends: 148 [2022-07-13 18:09:39,402 INFO L226 Difference]: Without dead ends: 84 [2022-07-13 18:09:39,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-13 18:09:39,409 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 27 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 18:09:39,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 137 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 18:09:39,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-07-13 18:09:39,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 79. [2022-07-13 18:09:39,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 49 states have internal predecessors, (56), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-07-13 18:09:39,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 100 transitions. [2022-07-13 18:09:39,446 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 100 transitions. Word has length 36 [2022-07-13 18:09:39,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:09:39,446 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 100 transitions. [2022-07-13 18:09:39,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 18:09:39,447 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 100 transitions. [2022-07-13 18:09:39,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-13 18:09:39,449 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:09:39,449 INFO L195 NwaCegarLoop]: 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] [2022-07-13 18:09:39,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 18:09:39,449 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:09:39,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:09:39,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1505272945, now seen corresponding path program 1 times [2022-07-13 18:09:39,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:09:39,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943853265] [2022-07-13 18:09:39,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:09:39,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:09:39,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:39,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:09:39,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:39,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 18:09:39,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:39,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 18:09:39,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:39,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 18:09:39,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:39,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-13 18:09:39,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:39,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 18:09:39,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:09:39,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943853265] [2022-07-13 18:09:39,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943853265] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:09:39,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:09:39,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 18:09:39,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689824645] [2022-07-13 18:09:39,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:09:39,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 18:09:39,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:09:39,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 18:09:39,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-13 18:09:39,583 INFO L87 Difference]: Start difference. First operand 79 states and 100 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 18:09:39,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:09:39,784 INFO L93 Difference]: Finished difference Result 142 states and 184 transitions. [2022-07-13 18:09:39,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 18:09:39,784 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-07-13 18:09:39,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:09:39,790 INFO L225 Difference]: With dead ends: 142 [2022-07-13 18:09:39,791 INFO L226 Difference]: Without dead ends: 86 [2022-07-13 18:09:39,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-13 18:09:39,796 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 28 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 18:09:39,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 255 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 18:09:39,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-13 18:09:39,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 81. [2022-07-13 18:09:39,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 50 states have (on average 1.14) internal successors, (57), 51 states have internal predecessors, (57), 22 states have call successors, (22), 7 states have call predecessors, (22), 8 states have return successors, (25), 22 states have call predecessors, (25), 22 states have call successors, (25) [2022-07-13 18:09:39,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 104 transitions. [2022-07-13 18:09:39,810 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 104 transitions. Word has length 36 [2022-07-13 18:09:39,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:09:39,811 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 104 transitions. [2022-07-13 18:09:39,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 18:09:39,811 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 104 transitions. [2022-07-13 18:09:39,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-13 18:09:39,812 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:09:39,813 INFO L195 NwaCegarLoop]: 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] [2022-07-13 18:09:39,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 18:09:39,813 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:09:39,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:09:39,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1392403970, now seen corresponding path program 1 times [2022-07-13 18:09:39,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:09:39,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115905078] [2022-07-13 18:09:39,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:09:39,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:09:39,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:39,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:09:39,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:39,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 18:09:39,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:39,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 18:09:39,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:39,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:09:39,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:39,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 18:09:39,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:39,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 18:09:39,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:39,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-13 18:09:39,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:39,976 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-13 18:09:39,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:09:39,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115905078] [2022-07-13 18:09:39,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115905078] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:09:39,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738906169] [2022-07-13 18:09:39,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:09:39,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:09:39,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:09:39,982 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-07-13 18:09:39,991 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-07-13 18:09:40,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:40,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-13 18:09:40,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:09:40,259 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-13 18:09:40,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:09:40,386 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-13 18:09:40,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738906169] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 18:09:40,386 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 18:09:40,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 11 [2022-07-13 18:09:40,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082970511] [2022-07-13 18:09:40,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 18:09:40,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 18:09:40,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:09:40,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 18:09:40,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-07-13 18:09:40,388 INFO L87 Difference]: Start difference. First operand 81 states and 104 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 7 states have internal predecessors, (40), 4 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-13 18:09:40,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:09:40,720 INFO L93 Difference]: Finished difference Result 148 states and 193 transitions. [2022-07-13 18:09:40,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 18:09:40,721 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 7 states have internal predecessors, (40), 4 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 48 [2022-07-13 18:09:40,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:09:40,722 INFO L225 Difference]: With dead ends: 148 [2022-07-13 18:09:40,722 INFO L226 Difference]: Without dead ends: 86 [2022-07-13 18:09:40,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 102 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2022-07-13 18:09:40,723 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 34 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 18:09:40,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 382 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 18:09:40,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-13 18:09:40,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 83. [2022-07-13 18:09:40,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 53 states have internal predecessors, (58), 22 states have call successors, (22), 7 states have call predecessors, (22), 9 states have return successors, (27), 22 states have call predecessors, (27), 22 states have call successors, (27) [2022-07-13 18:09:40,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 107 transitions. [2022-07-13 18:09:40,731 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 107 transitions. Word has length 48 [2022-07-13 18:09:40,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:09:40,731 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 107 transitions. [2022-07-13 18:09:40,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 7 states have internal predecessors, (40), 4 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-13 18:09:40,731 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 107 transitions. [2022-07-13 18:09:40,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-13 18:09:40,733 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:09:40,733 INFO L195 NwaCegarLoop]: 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] [2022-07-13 18:09:40,751 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-07-13 18:09:40,951 WARN L477 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-07-13 18:09:40,951 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:09:40,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:09:40,951 INFO L85 PathProgramCache]: Analyzing trace with hash 164705413, now seen corresponding path program 1 times [2022-07-13 18:09:40,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:09:40,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607148926] [2022-07-13 18:09:40,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:09:40,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:09:40,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:40,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:09:41,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:41,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:09:41,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:41,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 18:09:41,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:41,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 18:09:41,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:41,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:09:41,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:41,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:09:41,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:41,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 18:09:41,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:41,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 18:09:41,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:41,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-13 18:09:41,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:41,128 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-13 18:09:41,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:09:41,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607148926] [2022-07-13 18:09:41,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607148926] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:09:41,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:09:41,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-13 18:09:41,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971899668] [2022-07-13 18:09:41,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:09:41,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 18:09:41,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:09:41,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 18:09:41,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-13 18:09:41,134 INFO L87 Difference]: Start difference. First operand 83 states and 107 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 7 states have internal predecessors, (32), 4 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-13 18:09:41,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:09:41,430 INFO L93 Difference]: Finished difference Result 148 states and 193 transitions. [2022-07-13 18:09:41,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 18:09:41,430 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 7 states have internal predecessors, (32), 4 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 58 [2022-07-13 18:09:41,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:09:41,432 INFO L225 Difference]: With dead ends: 148 [2022-07-13 18:09:41,432 INFO L226 Difference]: Without dead ends: 88 [2022-07-13 18:09:41,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-07-13 18:09:41,435 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 71 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 18:09:41,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 357 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 18:09:41,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-13 18:09:41,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2022-07-13 18:09:41,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 55 states have internal predecessors, (59), 22 states have call successors, (22), 7 states have call predecessors, (22), 10 states have return successors, (29), 22 states have call predecessors, (29), 22 states have call successors, (29) [2022-07-13 18:09:41,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 110 transitions. [2022-07-13 18:09:41,448 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 110 transitions. Word has length 58 [2022-07-13 18:09:41,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:09:41,450 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 110 transitions. [2022-07-13 18:09:41,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 7 states have internal predecessors, (32), 4 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-13 18:09:41,450 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 110 transitions. [2022-07-13 18:09:41,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-13 18:09:41,454 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:09:41,454 INFO L195 NwaCegarLoop]: 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] [2022-07-13 18:09:41,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 18:09:41,454 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:09:41,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:09:41,455 INFO L85 PathProgramCache]: Analyzing trace with hash 159940150, now seen corresponding path program 1 times [2022-07-13 18:09:41,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:09:41,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514256308] [2022-07-13 18:09:41,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:09:41,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:09:41,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:41,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:09:41,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:41,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:09:41,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:41,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 18:09:41,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:41,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 18:09:41,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:41,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:09:41,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:41,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 18:09:41,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:41,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 18:09:41,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:41,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:09:41,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:41,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 18:09:41,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:41,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 18:09:41,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:41,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 18:09:41,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:41,694 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-13 18:09:41,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:09:41,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514256308] [2022-07-13 18:09:41,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514256308] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:09:41,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270695040] [2022-07-13 18:09:41,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:09:41,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:09:41,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:09:41,696 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:09:41,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 18:09:41,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:41,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-13 18:09:41,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:09:41,850 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-13 18:09:41,850 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 18:09:41,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270695040] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:09:41,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 18:09:41,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [15] total 18 [2022-07-13 18:09:41,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336031245] [2022-07-13 18:09:41,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:09:41,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 18:09:41,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:09:41,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 18:09:41,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2022-07-13 18:09:41,852 INFO L87 Difference]: Start difference. First operand 85 states and 110 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-13 18:09:41,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:09:41,947 INFO L93 Difference]: Finished difference Result 139 states and 180 transitions. [2022-07-13 18:09:41,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 18:09:41,948 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) Word has length 71 [2022-07-13 18:09:41,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:09:41,949 INFO L225 Difference]: With dead ends: 139 [2022-07-13 18:09:41,949 INFO L226 Difference]: Without dead ends: 87 [2022-07-13 18:09:41,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2022-07-13 18:09:41,950 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 36 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 18:09:41,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 534 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 18:09:41,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-13 18:09:41,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-07-13 18:09:41,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 53 states have (on average 1.1320754716981132) internal successors, (60), 57 states have internal predecessors, (60), 22 states have call successors, (22), 7 states have call predecessors, (22), 11 states have return successors, (31), 22 states have call predecessors, (31), 22 states have call successors, (31) [2022-07-13 18:09:41,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 113 transitions. [2022-07-13 18:09:41,961 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 113 transitions. Word has length 71 [2022-07-13 18:09:41,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:09:41,961 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 113 transitions. [2022-07-13 18:09:41,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-13 18:09:41,961 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 113 transitions. [2022-07-13 18:09:41,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-13 18:09:41,962 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:09:41,962 INFO L195 NwaCegarLoop]: 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] [2022-07-13 18:09:41,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-13 18:09:42,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:09:42,180 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:09:42,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:09:42,180 INFO L85 PathProgramCache]: Analyzing trace with hash 661772809, now seen corresponding path program 1 times [2022-07-13 18:09:42,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:09:42,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109648543] [2022-07-13 18:09:42,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:09:42,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:09:42,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 18:09:42,208 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 18:09:42,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 18:09:42,243 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 18:09:42,243 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 18:09:42,244 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 18:09:42,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 18:09:42,247 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-07-13 18:09:42,249 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 18:09:42,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 06:09:42 BoogieIcfgContainer [2022-07-13 18:09:42,304 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 18:09:42,304 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 18:09:42,304 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 18:09:42,304 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 18:09:42,305 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 06:09:38" (3/4) ... [2022-07-13 18:09:42,306 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-13 18:09:42,352 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 18:09:42,353 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 18:09:42,353 INFO L158 Benchmark]: Toolchain (without parser) took 4212.71ms. Allocated memory was 144.7MB in the beginning and 190.8MB in the end (delta: 46.1MB). Free memory was 109.6MB in the beginning and 157.7MB in the end (delta: -48.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 18:09:42,353 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 81.8MB. Free memory was 39.2MB in the beginning and 39.1MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 18:09:42,353 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.24ms. Allocated memory is still 144.7MB. Free memory was 109.4MB in the beginning and 116.7MB in the end (delta: -7.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-13 18:09:42,353 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.24ms. Allocated memory is still 144.7MB. Free memory was 116.7MB in the beginning and 115.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 18:09:42,354 INFO L158 Benchmark]: Boogie Preprocessor took 47.80ms. Allocated memory is still 144.7MB. Free memory was 115.0MB in the beginning and 113.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 18:09:42,354 INFO L158 Benchmark]: RCFGBuilder took 369.31ms. Allocated memory is still 144.7MB. Free memory was 113.2MB in the beginning and 95.8MB in the end (delta: 17.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-07-13 18:09:42,354 INFO L158 Benchmark]: TraceAbstraction took 3444.74ms. Allocated memory was 144.7MB in the beginning and 190.8MB in the end (delta: 46.1MB). Free memory was 95.4MB in the beginning and 161.8MB in the end (delta: -66.4MB). Peak memory consumption was 87.0MB. Max. memory is 16.1GB. [2022-07-13 18:09:42,354 INFO L158 Benchmark]: Witness Printer took 48.45ms. Allocated memory is still 190.8MB. Free memory was 161.8MB in the beginning and 157.7MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-13 18:09:42,355 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.18ms. Allocated memory is still 81.8MB. Free memory was 39.2MB in the beginning and 39.1MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 253.24ms. Allocated memory is still 144.7MB. Free memory was 109.4MB in the beginning and 116.7MB in the end (delta: -7.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.24ms. Allocated memory is still 144.7MB. Free memory was 116.7MB in the beginning and 115.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.80ms. Allocated memory is still 144.7MB. Free memory was 115.0MB in the beginning and 113.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 369.31ms. Allocated memory is still 144.7MB. Free memory was 113.2MB in the beginning and 95.8MB in the end (delta: 17.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 3444.74ms. Allocated memory was 144.7MB in the beginning and 190.8MB in the end (delta: 46.1MB). Free memory was 95.4MB in the beginning and 161.8MB in the end (delta: -66.4MB). Peak memory consumption was 87.0MB. Max. memory is 16.1GB. * Witness Printer took 48.45ms. Allocated memory is still 190.8MB. Free memory was 161.8MB in the beginning and 157.7MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * 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: [L98] 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}] [L98] RET, EXPR nondet_tree() VAL [nondet_tree()={-2:0}] [L98] CALL task(nondet_tree()) [L76] 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}] [L76] RET, EXPR min(t) VAL [min(t)=2147483647, t={-2:0}, t={-2:0}] [L76] int a = min(t); [L77] int b; VAL [a=2147483647, b={5:0}, t={-2:0}, t={-2:0}] [L79] CALL, EXPR size(t) VAL [t={-2:0}] [L71] COND FALSE !(!t) [L72] EXPR t->left VAL [t={-2:0}, t={-2:0}, t->left={0:0}] [L72] CALL, EXPR size(t->left) VAL [t={0:0}] [L71] COND TRUE !t [L71] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L72] RET, EXPR size(t->left) VAL [size(t->left)=0, t={-2:0}, t={-2:0}, t->left={0:0}] [L72] EXPR t->right VAL [size(t->left)=0, t={-2:0}, t={-2:0}, t->left={0:0}, t->right={0:0}] [L72] CALL, EXPR size(t->right) VAL [t={0:0}] [L71] COND TRUE !t [L71] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L72] RET, EXPR size(t->right) VAL [size(t->left)=0, size(t->right)=0, t={-2:0}, t={-2:0}, t->left={0:0}, t->right={0:0}] [L72] return size(t->left) + size(t->right) + 1; [L79] RET, EXPR size(t) VAL [a=2147483647, b={5:0}, size(t)=1, t={-2:0}, t={-2:0}] [L79] int n = size(t); [L80] CALL assume_abort_if_not(n != 0) [L10] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L80] RET assume_abort_if_not(n != 0) [L81] 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}] [L81] 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}] [L82] CALL tree_inorder(t, x, n) VAL [\old(i)=1, a={-3:0}, t={-2:0}] [L60] COND FALSE !(!t) [L63] 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}] [L63] CALL, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-3:0}, t={0:0}] [L60] COND TRUE !t [L61] return i; VAL [\old(i)=1, \result=1, a={-3:0}, a={-3:0}, i=1, t={0:0}, t={0:0}] [L63] 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] [L63] i = tree_inorder(t->left, a, i) [L64] EXPR i++ [L64] EXPR t->data [L64] a[i++] = t->data [L65] EXPR t->right VAL [\old(i)=1, a={-3:0}, a={-3:0}, i=2, t={-2:0}, t={-2:0}, t->right={0:0}] [L65] CALL, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=2, a={-3:0}, t={0:0}] [L60] COND TRUE !t [L61] return i; VAL [\old(i)=2, \result=2, a={-3:0}, a={-3:0}, i=2, t={0:0}, t={0:0}] [L65] 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] [L65] i = tree_inorder(t->right, a, i) [L66] return i; VAL [\old(i)=1, \result=2, a={-3:0}, a={-3:0}, i=2, t={-2:0}, t={-2:0}] [L82] 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}] [L83] 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] [L83] 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 8 procedures, 84 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 214 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 196 mSDsluCounter, 1665 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1236 mSDsCounter, 160 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1286 IncrementalHoareTripleChecker+Invalid, 1446 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 160 mSolverCounterUnsat, 429 mSDtfsCounter, 1286 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 280 GetRequests, 222 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=5, InterpolantAutomatonStates: 34, 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, 16 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 451 NumberOfCodeBlocks, 451 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 408 ConstructedInterpolants, 0 QuantifiedInterpolants, 1167 SizeOfPredicates, 10 NumberOfNonLiveVariables, 635 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 115/123 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-07-13 18:09:42,378 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE