./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/tree_del_rec.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.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 448d6e9f7f0c094a8335d652a2766ae983308e33ec1a543ceaed97ae79744722 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 18:09:34,286 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 18:09:34,289 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 18:09:34,332 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 18:09:34,333 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 18:09:34,333 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 18:09:34,334 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 18:09:34,335 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 18:09:34,336 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 18:09:34,337 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 18:09:34,337 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 18:09:34,338 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 18:09:34,339 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 18:09:34,342 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 18:09:34,344 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 18:09:34,345 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 18:09:34,346 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 18:09:34,346 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 18:09:34,348 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 18:09:34,352 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 18:09:34,353 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 18:09:34,360 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 18:09:34,360 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 18:09:34,361 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 18:09:34,362 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 18:09:34,364 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 18:09:34,364 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 18:09:34,365 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 18:09:34,365 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 18:09:34,366 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 18:09:34,366 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 18:09:34,367 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 18:09:34,367 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 18:09:34,368 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 18:09:34,368 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 18:09:34,369 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 18:09:34,369 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 18:09:34,370 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 18:09:34,370 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 18:09:34,370 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 18:09:34,371 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 18:09:34,372 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 18:09:34,373 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:34,390 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 18:09:34,391 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 18:09:34,392 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 18:09:34,392 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 18:09:34,393 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 18:09:34,393 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 18:09:34,393 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 18:09:34,393 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 18:09:34,394 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 18:09:34,394 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 18:09:34,395 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 18:09:34,395 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 18:09:34,395 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 18:09:34,395 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 18:09:34,395 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 18:09:34,395 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 18:09:34,396 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 18:09:34,396 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 18:09:34,396 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 18:09:34,397 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 18:09:34,397 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 18:09:34,397 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 18:09:34,398 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 18:09:34,398 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 18:09:34,398 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 18:09:34,398 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 18:09:34,398 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 18:09:34,399 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 18:09:34,399 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 18:09:34,399 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 18:09:34,399 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 18:09:34,400 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 18:09:34,400 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 18:09:34,400 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 -> 448d6e9f7f0c094a8335d652a2766ae983308e33ec1a543ceaed97ae79744722 [2022-07-13 18:09:34,602 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 18:09:34,621 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 18:09:34,623 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 18:09:34,624 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 18:09:34,625 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 18:09:34,626 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/tree_del_rec.c [2022-07-13 18:09:34,712 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bc202362/c9e0812d3958401e95f5defee69673b9/FLAGaae5a622f [2022-07-13 18:09:35,084 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 18:09:35,084 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_rec.c [2022-07-13 18:09:35,089 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bc202362/c9e0812d3958401e95f5defee69673b9/FLAGaae5a622f [2022-07-13 18:09:35,097 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bc202362/c9e0812d3958401e95f5defee69673b9 [2022-07-13 18:09:35,099 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 18:09:35,100 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 18:09:35,100 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 18:09:35,101 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 18:09:35,103 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 18:09:35,103 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 06:09:35" (1/1) ... [2022-07-13 18:09:35,106 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4416cb39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:09:35, skipping insertion in model container [2022-07-13 18:09:35,106 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 06:09:35" (1/1) ... [2022-07-13 18:09:35,110 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 18:09:35,125 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 18:09:35,249 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.c[585,598] [2022-07-13 18:09:35,260 WARN L1550 CHandler]: Possible shadowing of function min [2022-07-13 18:09:35,261 WARN L1550 CHandler]: Possible shadowing of function min [2022-07-13 18:09:35,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 18:09:35,275 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 18:09:35,286 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.c[585,598] [2022-07-13 18:09:35,292 WARN L1550 CHandler]: Possible shadowing of function min [2022-07-13 18:09:35,293 WARN L1550 CHandler]: Possible shadowing of function min [2022-07-13 18:09:35,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 18:09:35,308 INFO L208 MainTranslator]: Completed translation [2022-07-13 18:09:35,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:09:35 WrapperNode [2022-07-13 18:09:35,310 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 18:09:35,311 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 18:09:35,311 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 18:09:35,311 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 18:09:35,316 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:35" (1/1) ... [2022-07-13 18:09:35,322 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:35" (1/1) ... [2022-07-13 18:09:35,342 INFO L137 Inliner]: procedures = 29, calls = 61, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 74 [2022-07-13 18:09:35,343 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 18:09:35,343 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 18:09:35,343 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 18:09:35,344 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 18:09:35,349 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:35" (1/1) ... [2022-07-13 18:09:35,349 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:35" (1/1) ... [2022-07-13 18:09:35,360 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:35" (1/1) ... [2022-07-13 18:09:35,361 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:35" (1/1) ... [2022-07-13 18:09:35,369 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:35" (1/1) ... [2022-07-13 18:09:35,382 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:35" (1/1) ... [2022-07-13 18:09:35,385 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:35" (1/1) ... [2022-07-13 18:09:35,395 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 18:09:35,396 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 18:09:35,396 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 18:09:35,396 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 18:09:35,397 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:09:35" (1/1) ... [2022-07-13 18:09:35,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 18:09:35,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:09:35,422 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:35,442 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:35,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 18:09:35,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 18:09:35,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 18:09:35,456 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2022-07-13 18:09:35,456 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2022-07-13 18:09:35,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 18:09:35,457 INFO L130 BoogieDeclarations]: Found specification of procedure min [2022-07-13 18:09:35,457 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2022-07-13 18:09:35,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 18:09:35,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-13 18:09:35,457 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-13 18:09:35,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 18:09:35,458 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2022-07-13 18:09:35,458 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2022-07-13 18:09:35,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 18:09:35,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 18:09:35,458 INFO L130 BoogieDeclarations]: Found specification of procedure size [2022-07-13 18:09:35,458 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2022-07-13 18:09:35,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 18:09:35,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 18:09:35,458 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-13 18:09:35,459 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-13 18:09:35,459 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2022-07-13 18:09:35,459 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2022-07-13 18:09:35,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 18:09:35,552 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 18:09:35,554 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 18:09:35,773 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 18:09:35,779 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 18:09:35,779 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-13 18:09:35,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 06:09:35 BoogieIcfgContainer [2022-07-13 18:09:35,781 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 18:09:35,797 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 18:09:35,797 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 18:09:35,800 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 18:09:35,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 06:09:35" (1/3) ... [2022-07-13 18:09:35,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35da1767 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 06:09:35, skipping insertion in model container [2022-07-13 18:09:35,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:09:35" (2/3) ... [2022-07-13 18:09:35,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35da1767 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 06:09:35, skipping insertion in model container [2022-07-13 18:09:35,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 06:09:35" (3/3) ... [2022-07-13 18:09:35,803 INFO L111 eAbstractionObserver]: Analyzing ICFG tree_del_rec.c [2022-07-13 18:09:35,816 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 18:09:35,816 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 18:09:35,862 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 18:09:35,866 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@50979307, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4ae39545 [2022-07-13 18:09:35,867 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 18:09:35,870 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 56 states have internal predecessors, (69), 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:35,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-13 18:09:35,878 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:09:35,879 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:35,880 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:09:35,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:09:35,885 INFO L85 PathProgramCache]: Analyzing trace with hash 909892653, now seen corresponding path program 1 times [2022-07-13 18:09:35,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:09:35,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301855022] [2022-07-13 18:09:35,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:09:35,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:09:36,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:36,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:09:36,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:36,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 18:09:36,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:36,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 18:09:36,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:36,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 18:09:36,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:36,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-13 18:09:36,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:36,224 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:36,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:09:36,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301855022] [2022-07-13 18:09:36,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301855022] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:09:36,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:09:36,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 18:09:36,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441075592] [2022-07-13 18:09:36,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:09:36,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 18:09:36,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:09:36,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 18:09:36,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-13 18:09:36,267 INFO L87 Difference]: Start difference. First operand has 86 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 56 states have internal predecessors, (69), 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 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:36,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:09:36,626 INFO L93 Difference]: Finished difference Result 155 states and 212 transitions. [2022-07-13 18:09:36,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 18:09:36,628 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:36,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:09:36,635 INFO L225 Difference]: With dead ends: 155 [2022-07-13 18:09:36,635 INFO L226 Difference]: Without dead ends: 87 [2022-07-13 18:09:36,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-13 18:09:36,640 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 32 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 18:09:36,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 292 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 18:09:36,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-13 18:09:36,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 82. [2022-07-13 18:09:36,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 52 states have internal predecessors, (59), 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:36,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 106 transitions. [2022-07-13 18:09:36,687 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 106 transitions. Word has length 36 [2022-07-13 18:09:36,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:09:36,688 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 106 transitions. [2022-07-13 18:09:36,688 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:36,688 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 106 transitions. [2022-07-13 18:09:36,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-13 18:09:36,690 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:09:36,690 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:36,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 18:09:36,690 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:09:36,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:09:36,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1373837682, now seen corresponding path program 1 times [2022-07-13 18:09:36,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:09:36,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001768257] [2022-07-13 18:09:36,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:09:36,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:09:36,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:36,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:09:36,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:36,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 18:09:36,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:36,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 18:09:36,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:36,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:09:36,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:36,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 18:09:36,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:36,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 18:09:36,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:36,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-13 18:09:36,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:36,909 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:36,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:09:36,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001768257] [2022-07-13 18:09:36,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001768257] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:09:36,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783540718] [2022-07-13 18:09:36,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:09:36,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:09:36,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:09:36,916 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:36,922 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:37,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:37,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-13 18:09:37,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:09:37,210 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:37,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:09:37,409 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:37,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783540718] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 18:09:37,410 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 18:09:37,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 13 [2022-07-13 18:09:37,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713543708] [2022-07-13 18:09:37,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 18:09:37,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-13 18:09:37,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:09:37,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-13 18:09:37,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-07-13 18:09:37,413 INFO L87 Difference]: Start difference. First operand 82 states and 106 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 9 states have internal predecessors, (43), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-13 18:09:37,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:09:37,791 INFO L93 Difference]: Finished difference Result 149 states and 195 transitions. [2022-07-13 18:09:37,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 18:09:37,791 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 9 states have internal predecessors, (43), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 48 [2022-07-13 18:09:37,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:09:37,800 INFO L225 Difference]: With dead ends: 149 [2022-07-13 18:09:37,800 INFO L226 Difference]: Without dead ends: 87 [2022-07-13 18:09:37,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 101 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2022-07-13 18:09:37,804 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 71 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 18:09:37,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 345 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 18:09:37,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-13 18:09:37,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2022-07-13 18:09:37,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 54 states have internal predecessors, (60), 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:37,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 109 transitions. [2022-07-13 18:09:37,823 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 109 transitions. Word has length 48 [2022-07-13 18:09:37,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:09:37,823 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 109 transitions. [2022-07-13 18:09:37,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 9 states have internal predecessors, (43), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-13 18:09:37,824 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 109 transitions. [2022-07-13 18:09:37,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-13 18:09:37,830 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:09:37,830 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:37,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-13 18:09:38,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:09:38,048 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:09:38,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:09:38,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1481222417, now seen corresponding path program 1 times [2022-07-13 18:09:38,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:09:38,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581417012] [2022-07-13 18:09:38,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:09:38,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:09:38,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:38,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:09:38,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:38,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:09:38,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:38,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 18:09:38,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:38,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 18:09:38,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:38,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:09:38,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:38,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:09:38,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:38,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 18:09:38,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:38,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 18:09:38,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:38,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-13 18:09:38,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:38,276 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:38,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:09:38,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581417012] [2022-07-13 18:09:38,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581417012] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:09:38,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:09:38,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-13 18:09:38,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915691822] [2022-07-13 18:09:38,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:09:38,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 18:09:38,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:09:38,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 18:09:38,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-13 18:09:38,278 INFO L87 Difference]: Start difference. First operand 84 states and 109 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:38,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:09:38,631 INFO L93 Difference]: Finished difference Result 149 states and 195 transitions. [2022-07-13 18:09:38,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 18:09:38,632 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:38,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:09:38,634 INFO L225 Difference]: With dead ends: 149 [2022-07-13 18:09:38,634 INFO L226 Difference]: Without dead ends: 89 [2022-07-13 18:09:38,635 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:38,635 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 75 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 18:09:38,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 359 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 18:09:38,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-13 18:09:38,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2022-07-13 18:09:38,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 53 states have (on average 1.150943396226415) internal successors, (61), 56 states have internal predecessors, (61), 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:38,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 112 transitions. [2022-07-13 18:09:38,645 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 112 transitions. Word has length 58 [2022-07-13 18:09:38,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:09:38,645 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 112 transitions. [2022-07-13 18:09:38,646 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:38,646 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 112 transitions. [2022-07-13 18:09:38,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-13 18:09:38,649 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:09:38,650 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:38,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 18:09:38,650 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:09:38,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:09:38,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1364034462, now seen corresponding path program 1 times [2022-07-13 18:09:38,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:09:38,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630604237] [2022-07-13 18:09:38,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:09:38,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:09:38,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:38,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:09:38,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:38,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:09:38,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:38,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 18:09:38,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:38,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 18:09:38,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:38,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:09:38,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:38,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 18:09:38,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:38,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 18:09:38,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:38,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:09:38,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:38,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 18:09:38,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:38,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 18:09:38,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:38,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 18:09:38,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:38,945 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:38,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:09:38,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630604237] [2022-07-13 18:09:38,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630604237] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:09:38,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479077646] [2022-07-13 18:09:38,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:09:38,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:09:38,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:09:38,957 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:38,958 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:39,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:39,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-13 18:09:39,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:09:39,139 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:39,139 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 18:09:39,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479077646] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:09:39,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 18:09:39,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [15] total 18 [2022-07-13 18:09:39,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599134374] [2022-07-13 18:09:39,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:09:39,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 18:09:39,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:09:39,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 18:09:39,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2022-07-13 18:09:39,142 INFO L87 Difference]: Start difference. First operand 86 states and 112 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:39,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:09:39,253 INFO L93 Difference]: Finished difference Result 140 states and 182 transitions. [2022-07-13 18:09:39,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 18:09:39,254 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:39,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:09:39,255 INFO L225 Difference]: With dead ends: 140 [2022-07-13 18:09:39,255 INFO L226 Difference]: Without dead ends: 88 [2022-07-13 18:09:39,256 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:39,257 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 36 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 548 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:39,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 548 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:39,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-13 18:09:39,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-07-13 18:09:39,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 58 states have internal predecessors, (62), 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:39,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 115 transitions. [2022-07-13 18:09:39,267 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 115 transitions. Word has length 71 [2022-07-13 18:09:39,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:09:39,267 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 115 transitions. [2022-07-13 18:09:39,267 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:39,268 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 115 transitions. [2022-07-13 18:09:39,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-13 18:09:39,269 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:09:39,269 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:39,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 18:09:39,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-13 18:09:39,492 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:09:39,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:09:39,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1861975499, now seen corresponding path program 1 times [2022-07-13 18:09:39,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:09:39,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822018851] [2022-07-13 18:09:39,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:09:39,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:09:39,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 18:09:39,536 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 18:09:39,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 18:09:39,613 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 18:09:39,613 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 18:09:39,614 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 18:09:39,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 18:09:39,617 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-07-13 18:09:39,620 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 18:09:39,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 06:09:39 BoogieIcfgContainer [2022-07-13 18:09:39,674 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 18:09:39,675 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 18:09:39,675 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 18:09:39,675 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 18:09:39,675 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:35" (3/4) ... [2022-07-13 18:09:39,677 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-13 18:09:39,718 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 18:09:39,718 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 18:09:39,719 INFO L158 Benchmark]: Toolchain (without parser) took 4618.97ms. Allocated memory was 98.6MB in the beginning and 148.9MB in the end (delta: 50.3MB). Free memory was 65.2MB in the beginning and 89.0MB in the end (delta: -23.8MB). Peak memory consumption was 27.0MB. Max. memory is 16.1GB. [2022-07-13 18:09:39,719 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 98.6MB. Free memory is still 53.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 18:09:39,719 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.80ms. Allocated memory is still 98.6MB. Free memory was 65.1MB in the beginning and 72.2MB in the end (delta: -7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 18:09:39,719 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.02ms. Allocated memory is still 98.6MB. Free memory was 72.2MB in the beginning and 70.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 18:09:39,720 INFO L158 Benchmark]: Boogie Preprocessor took 51.92ms. Allocated memory is still 98.6MB. Free memory was 70.4MB in the beginning and 68.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 18:09:39,720 INFO L158 Benchmark]: RCFGBuilder took 385.65ms. Allocated memory is still 98.6MB. Free memory was 68.6MB in the beginning and 51.1MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-13 18:09:39,720 INFO L158 Benchmark]: TraceAbstraction took 3877.64ms. Allocated memory was 121.6MB in the beginning and 148.9MB in the end (delta: 27.3MB). Free memory was 98.4MB in the beginning and 93.2MB in the end (delta: 5.2MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. [2022-07-13 18:09:39,721 INFO L158 Benchmark]: Witness Printer took 43.49ms. Allocated memory is still 148.9MB. Free memory was 93.2MB in the beginning and 89.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-13 18:09:39,722 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.19ms. Allocated memory is still 98.6MB. Free memory is still 53.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 209.80ms. Allocated memory is still 98.6MB. Free memory was 65.1MB in the beginning and 72.2MB in the end (delta: -7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.02ms. Allocated memory is still 98.6MB. Free memory was 72.2MB in the beginning and 70.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.92ms. Allocated memory is still 98.6MB. Free memory was 70.4MB in the beginning and 68.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 385.65ms. Allocated memory is still 98.6MB. Free memory was 68.6MB in the beginning and 51.1MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3877.64ms. Allocated memory was 121.6MB in the beginning and 148.9MB in the end (delta: 27.3MB). Free memory was 98.4MB in the beginning and 93.2MB in the end (delta: 5.2MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. * Witness Printer took 43.49ms. Allocated memory is still 148.9MB. Free memory was 93.2MB in the beginning and 89.0MB in the end (delta: 4.2MB). 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: [L102] 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={-1: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={-1:0}, nondet_tree()={0:0}] [L31] n->right = nondet_tree() [L32] return n; VAL [\result={-1:0}, n={-1:0}] [L102] RET, EXPR nondet_tree() VAL [nondet_tree()={-1:0}] [L102] CALL task(nondet_tree()) [L78] CALL, EXPR min(t) VAL [n={-1:0}] [L37] COND FALSE !(!n) [L40] EXPR n->data [L40] int a = n->data; [L41] EXPR n->left VAL [a=2147483647, n={-1:0}, n={-1:0}, n->left={0:0}] [L41] 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}] [L41] RET, EXPR min(n->left) VAL [a=2147483647, min(n->left)=2147483647, n={-1:0}, n={-1:0}, n->left={0:0}] [L41] int b = min(n->left); [L42] EXPR n->right VAL [a=2147483647, b=2147483647, n={-1:0}, n={-1:0}, n->right={0:0}] [L42] 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}] [L42] RET, EXPR min(n->right) VAL [a=2147483647, b=2147483647, min(n->right)=2147483647, n={-1:0}, n={-1:0}, n->right={0:0}] [L42] int c = min(n->right); [L43] COND TRUE b <= a && b <= c [L43] return b; VAL [\result=2147483647, a=2147483647, b=2147483647, c=2147483647, n={-1:0}, n={-1:0}] [L78] RET, EXPR min(t) VAL [min(t)=2147483647, t={-1:0}, t={-1:0}] [L78] int a = min(t); [L79] int b; VAL [a=2147483647, b={5:0}, t={-1:0}, t={-1:0}] [L81] CALL, EXPR size(t) VAL [t={-1:0}] [L73] COND FALSE !(!t) [L74] EXPR t->left VAL [t={-1:0}, t={-1:0}, t->left={0:0}] [L74] CALL, EXPR size(t->left) VAL [t={0:0}] [L73] COND TRUE !t [L73] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L74] RET, EXPR size(t->left) VAL [size(t->left)=0, t={-1:0}, t={-1:0}, t->left={0:0}] [L74] EXPR t->right VAL [size(t->left)=0, t={-1:0}, t={-1:0}, t->left={0:0}, t->right={0:0}] [L74] CALL, EXPR size(t->right) VAL [t={0:0}] [L73] COND TRUE !t [L73] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L74] RET, EXPR size(t->right) VAL [size(t->left)=0, size(t->right)=0, t={-1:0}, t={-1:0}, t->left={0:0}, t->right={0:0}] [L74] return size(t->left) + size(t->right) + 1; [L81] RET, EXPR size(t) VAL [a=2147483647, b={5:0}, size(t)=1, t={-1:0}, t={-1:0}] [L81] int n = size(t); [L82] CALL assume_cycle_if_not(n != 0) [L9] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L82] RET assume_cycle_if_not(n != 0) [L83] EXPR, FCALL calloc(n, sizeof(int)) VAL [a=2147483647, b={5:0}, calloc(n, sizeof(int))={-2:0}, n=1, t={-1:0}, t={-1:0}] [L83] int *x = calloc(n, sizeof(int)); VAL [a=2147483647, b={5:0}, calloc(n, sizeof(int))={-2:0}, n=1, t={-1:0}, t={-1:0}, x={-2:0}] [L84] CALL tree_inorder(t, x, n) VAL [\old(i)=1, a={-2:0}, t={-1:0}] [L62] COND FALSE !(!t) [L65] EXPR t->left VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=1, t={-1:0}, t={-1:0}, t->left={0:0}] [L65] CALL, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-2:0}, t={0:0}] [L62] COND TRUE !t [L63] return i; VAL [\old(i)=1, \result=1, a={-2:0}, a={-2:0}, i=1, t={0:0}, t={0:0}] [L65] RET, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=1, t={-1:0}, t={-1:0}, t->left={0:0}, tree_inorder(t->left, a, i)=1] [L65] i = tree_inorder(t->left, a, i) [L66] EXPR i++ [L66] EXPR t->data [L66] a[i++] = t->data [L67] EXPR t->right VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=2, t={-1:0}, t={-1:0}, t->right={0:0}] [L67] CALL, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=2, a={-2:0}, t={0:0}] [L62] COND TRUE !t [L63] return i; VAL [\old(i)=2, \result=2, a={-2:0}, a={-2:0}, i=2, t={0:0}, t={0:0}] [L67] RET, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=2, t={-1:0}, t={-1:0}, t->right={0:0}, tree_inorder(t->right, a, i)=2] [L67] i = tree_inorder(t->right, a, i) [L68] return i; VAL [\old(i)=1, \result=2, a={-2:0}, a={-2:0}, i=2, t={-1:0}, t={-1:0}] [L84] RET tree_inorder(t, x, n) VAL [a=2147483647, b={5:0}, calloc(n, sizeof(int))={-2:0}, n=1, t={-1:0}, t={-1:0}, tree_inorder(t, x, n)=2, x={-2:0}] [L85] EXPR x[0] VAL [a=2147483647, b={5:0}, calloc(n, sizeof(int))={-2:0}, n=1, t={-1:0}, t={-1:0}, x={-2:0}, x[0]=0] [L85] 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, 86 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 228 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 214 mSDsluCounter, 1544 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1190 mSDsCounter, 165 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1191 IncrementalHoareTripleChecker+Invalid, 1356 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 165 mSolverCounterUnsat, 354 mSDtfsCounter, 1191 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 269 GetRequests, 212 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=4, InterpolantAutomatonStates: 31, 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, 4 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 415 NumberOfCodeBlocks, 415 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 373 ConstructedInterpolants, 0 QuantifiedInterpolants, 1118 SizeOfPredicates, 10 NumberOfNonLiveVariables, 638 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 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:39,770 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