./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/verifythis/tree_del_iter.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/verifythis/tree_del_iter.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cce1bb7a06b9dd56fbf663e182ffe801720ee05ee19a126a08070f1616bc4afe --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 12:49:51,475 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 12:49:51,570 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-12 12:49:51,576 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 12:49:51,577 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 12:49:51,601 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 12:49:51,602 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 12:49:51,603 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 12:49:51,603 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 12:49:51,604 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 12:49:51,605 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 12:49:51,605 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 12:49:51,606 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 12:49:51,606 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 12:49:51,607 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 12:49:51,607 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 12:49:51,607 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 12:49:51,608 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 12:49:51,608 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 12:49:51,608 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 12:49:51,609 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 12:49:51,609 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 12:49:51,609 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 12:49:51,609 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 12:49:51,610 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 12:49:51,610 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 12:49:51,610 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 12:49:51,610 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 12:49:51,611 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 12:49:51,611 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 12:49:51,611 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 12:49:51,611 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 12:49:51,612 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 12:49:51,612 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 12:49:51,615 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 12:49:51,616 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 12:49:51,616 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 12:49:51,616 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 12:49:51,616 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 12:49:51,617 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 12:49:51,617 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 12:49:51,618 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 12:49:51,618 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 12:49:51,618 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 12:49:51,618 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 12:49:51,619 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 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 valid-memcleanup) ) 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 -> cce1bb7a06b9dd56fbf663e182ffe801720ee05ee19a126a08070f1616bc4afe [2024-11-12 12:49:51,866 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 12:49:51,892 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 12:49:51,896 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 12:49:51,897 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 12:49:51,899 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 12:49:51,901 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/tree_del_iter.c [2024-11-12 12:49:53,411 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 12:49:53,603 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 12:49:53,603 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_iter.c [2024-11-12 12:49:53,610 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/841cb6f3c/b84ccad0c8214894b66019f734d9dbf0/FLAGc197c0477 [2024-11-12 12:49:53,625 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/841cb6f3c/b84ccad0c8214894b66019f734d9dbf0 [2024-11-12 12:49:53,628 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 12:49:53,631 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 12:49:53,632 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 12:49:53,632 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 12:49:53,639 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 12:49:53,640 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:49:53" (1/1) ... [2024-11-12 12:49:53,641 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@299fcfee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:53, skipping insertion in model container [2024-11-12 12:49:53,641 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:49:53" (1/1) ... [2024-11-12 12:49:53,674 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 12:49:53,902 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:49:53,918 WARN L1674 CHandler]: Possible shadowing of function min [2024-11-12 12:49:53,939 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:49:53,950 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 12:49:53,970 WARN L1674 CHandler]: Possible shadowing of function min [2024-11-12 12:49:53,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:49:54,015 INFO L204 MainTranslator]: Completed translation [2024-11-12 12:49:54,015 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:54 WrapperNode [2024-11-12 12:49:54,016 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 12:49:54,017 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 12:49:54,017 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 12:49:54,017 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 12:49:54,023 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:54" (1/1) ... [2024-11-12 12:49:54,040 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:54" (1/1) ... [2024-11-12 12:49:54,062 INFO L138 Inliner]: procedures = 29, calls = 65, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 119 [2024-11-12 12:49:54,065 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 12:49:54,065 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 12:49:54,065 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 12:49:54,065 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 12:49:54,075 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:54" (1/1) ... [2024-11-12 12:49:54,076 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:54" (1/1) ... [2024-11-12 12:49:54,083 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:54" (1/1) ... [2024-11-12 12:49:54,114 INFO L175 MemorySlicer]: Split 28 memory accesses to 4 slices as follows [2, 5, 19, 2]. 68 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 7 writes are split as follows [0, 2, 4, 1]. [2024-11-12 12:49:54,115 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:54" (1/1) ... [2024-11-12 12:49:54,115 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:54" (1/1) ... [2024-11-12 12:49:54,126 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:54" (1/1) ... [2024-11-12 12:49:54,129 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:54" (1/1) ... [2024-11-12 12:49:54,132 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:54" (1/1) ... [2024-11-12 12:49:54,133 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:54" (1/1) ... [2024-11-12 12:49:54,137 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 12:49:54,138 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 12:49:54,138 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 12:49:54,138 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 12:49:54,139 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:54" (1/1) ... [2024-11-12 12:49:54,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 12:49:54,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 12:49:54,169 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 12:49:54,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 12:49:54,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 12:49:54,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-12 12:49:54,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-12 12:49:54,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-12 12:49:54,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-12 12:49:54,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-12 12:49:54,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 12:49:54,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 12:49:54,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-12 12:49:54,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-12 12:49:54,214 INFO L130 BoogieDeclarations]: Found specification of procedure min [2024-11-12 12:49:54,214 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2024-11-12 12:49:54,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 12:49:54,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-12 12:49:54,215 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-12 12:49:54,215 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-12 12:49:54,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-11-12 12:49:54,216 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-11-12 12:49:54,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-12 12:49:54,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-12 12:49:54,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-12 12:49:54,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-12 12:49:54,216 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2024-11-12 12:49:54,217 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2024-11-12 12:49:54,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 12:49:54,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 12:49:54,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-12 12:49:54,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-12 12:49:54,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 12:49:54,218 INFO L130 BoogieDeclarations]: Found specification of procedure size [2024-11-12 12:49:54,218 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2024-11-12 12:49:54,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 12:49:54,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 12:49:54,219 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-12 12:49:54,219 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-12 12:49:54,219 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2024-11-12 12:49:54,219 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2024-11-12 12:49:54,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 12:49:54,351 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 12:49:54,353 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 12:49:54,691 INFO L? ?]: Removed 74 outVars from TransFormulas that were not future-live. [2024-11-12 12:49:54,691 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 12:49:54,712 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 12:49:54,714 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-12 12:49:54,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:49:54 BoogieIcfgContainer [2024-11-12 12:49:54,714 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 12:49:54,716 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 12:49:54,717 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 12:49:54,721 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 12:49:54,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:49:53" (1/3) ... [2024-11-12 12:49:54,722 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cf872eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:49:54, skipping insertion in model container [2024-11-12 12:49:54,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:54" (2/3) ... [2024-11-12 12:49:54,723 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cf872eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:49:54, skipping insertion in model container [2024-11-12 12:49:54,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:49:54" (3/3) ... [2024-11-12 12:49:54,724 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_del_iter.c [2024-11-12 12:49:54,740 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 12:49:54,741 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-12 12:49:54,780 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 12:49:54,789 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@590ac163, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 12:49:54,790 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-12 12:49:54,797 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 58 states have internal predecessors, (73), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 12:49:54,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-12 12:49:54,810 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:49:54,811 INFO L218 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, 1] [2024-11-12 12:49:54,812 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:49:54,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:49:54,819 INFO L85 PathProgramCache]: Analyzing trace with hash -590456071, now seen corresponding path program 1 times [2024-11-12 12:49:54,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:49:54,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328374779] [2024-11-12 12:49:54,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:49:54,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:49:54,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:49:55,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 12:49:55,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:49:55,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 12:49:55,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:49:55,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-12 12:49:55,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:49:55,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 12:49:55,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:49:55,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 12:49:55,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:49:55,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:49:55,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:49:55,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328374779] [2024-11-12 12:49:55,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328374779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:49:55,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:49:55,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 12:49:55,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577745718] [2024-11-12 12:49:55,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:49:55,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 12:49:55,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:49:55,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 12:49:55,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-12 12:49:55,433 INFO L87 Difference]: Start difference. First operand has 85 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 58 states have internal predecessors, (73), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 4 states have internal predecessors, (26), 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) [2024-11-12 12:49:56,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:49:56,057 INFO L93 Difference]: Finished difference Result 93 states and 124 transitions. [2024-11-12 12:49:56,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 12:49:56,060 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 4 states have internal predecessors, (26), 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 37 [2024-11-12 12:49:56,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:49:56,070 INFO L225 Difference]: With dead ends: 93 [2024-11-12 12:49:56,071 INFO L226 Difference]: Without dead ends: 88 [2024-11-12 12:49:56,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-12 12:49:56,078 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 104 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 12:49:56,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 218 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 12:49:56,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-12 12:49:56,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 83. [2024-11-12 12:49:56,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 56 states have internal predecessors, (64), 20 states have call successors, (20), 6 states have call predecessors, (20), 7 states have return successors, (23), 20 states have call predecessors, (23), 20 states have call successors, (23) [2024-11-12 12:49:56,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 107 transitions. [2024-11-12 12:49:56,121 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 107 transitions. Word has length 37 [2024-11-12 12:49:56,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:49:56,122 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 107 transitions. [2024-11-12 12:49:56,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 4 states have internal predecessors, (26), 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) [2024-11-12 12:49:56,122 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 107 transitions. [2024-11-12 12:49:56,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-12 12:49:56,125 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:49:56,125 INFO L218 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, 1] [2024-11-12 12:49:56,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 12:49:56,126 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:49:56,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:49:56,126 INFO L85 PathProgramCache]: Analyzing trace with hash -36207534, now seen corresponding path program 1 times [2024-11-12 12:49:56,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:49:56,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745425381] [2024-11-12 12:49:56,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:49:56,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:49:56,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:49:56,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 12:49:56,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:49:56,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 12:49:56,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:49:56,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-12 12:49:56,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:49:56,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 12:49:56,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:49:56,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 12:49:56,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:49:56,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-12 12:49:56,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:49:56,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 12:49:56,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:49:56,530 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-12 12:49:56,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:49:56,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745425381] [2024-11-12 12:49:56,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745425381] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 12:49:56,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358546661] [2024-11-12 12:49:56,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:49:56,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 12:49:56,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 12:49:56,537 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) [2024-11-12 12:49:56,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 12:49:56,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:49:56,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-12 12:49:56,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:49:56,816 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-12 12:49:56,817 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 12:49:57,023 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-12 12:49:57,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [358546661] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 12:49:57,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 12:49:57,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 13 [2024-11-12 12:49:57,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841807307] [2024-11-12 12:49:57,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 12:49:57,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 12:49:57,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:49:57,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 12:49:57,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-12 12:49:57,028 INFO L87 Difference]: Start difference. First operand 83 states and 107 transitions. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 9 states have internal predecessors, (44), 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) [2024-11-12 12:49:57,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:49:57,613 INFO L93 Difference]: Finished difference Result 92 states and 122 transitions. [2024-11-12 12:49:57,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 12:49:57,614 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 9 states have internal predecessors, (44), 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 49 [2024-11-12 12:49:57,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:49:57,616 INFO L225 Difference]: With dead ends: 92 [2024-11-12 12:49:57,616 INFO L226 Difference]: Without dead ends: 88 [2024-11-12 12:49:57,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2024-11-12 12:49:57,617 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 102 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 12:49:57,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 277 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 12:49:57,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-12 12:49:57,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2024-11-12 12:49:57,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 55 states have (on average 1.1818181818181819) internal successors, (65), 58 states have internal predecessors, (65), 20 states have call successors, (20), 6 states have call predecessors, (20), 8 states have return successors, (25), 20 states have call predecessors, (25), 20 states have call successors, (25) [2024-11-12 12:49:57,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 110 transitions. [2024-11-12 12:49:57,634 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 110 transitions. Word has length 49 [2024-11-12 12:49:57,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:49:57,634 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 110 transitions. [2024-11-12 12:49:57,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 9 states have internal predecessors, (44), 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) [2024-11-12 12:49:57,635 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 110 transitions. [2024-11-12 12:49:57,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-12 12:49:57,636 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:49:57,637 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2024-11-12 12:49:57,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 12:49:57,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 12:49:57,838 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:49:57,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:49:57,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1856204013, now seen corresponding path program 1 times [2024-11-12 12:49:57,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:49:57,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650616087] [2024-11-12 12:49:57,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:49:57,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:49:57,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:49:57,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 12:49:58,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:49:58,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 12:49:58,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:49:58,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 12:49:58,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:49:58,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 12:49:58,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:49:58,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 12:49:58,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:49:58,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 12:49:58,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:49:58,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 12:49:58,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:49:58,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-12 12:49:58,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:49:58,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-12 12:49:58,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:49:58,193 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-12 12:49:58,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:49:58,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650616087] [2024-11-12 12:49:58,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650616087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:49:58,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:49:58,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 12:49:58,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851303293] [2024-11-12 12:49:58,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:49:58,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 12:49:58,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:49:58,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 12:49:58,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-12 12:49:58,196 INFO L87 Difference]: Start difference. First operand 85 states and 110 transitions. Second operand has 11 states, 10 states have (on average 3.3) internal successors, (33), 7 states have internal predecessors, (33), 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) [2024-11-12 12:49:58,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:49:58,693 INFO L93 Difference]: Finished difference Result 90 states and 119 transitions. [2024-11-12 12:49:58,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 12:49:58,694 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 7 states have internal predecessors, (33), 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 61 [2024-11-12 12:49:58,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:49:58,698 INFO L225 Difference]: With dead ends: 90 [2024-11-12 12:49:58,699 INFO L226 Difference]: Without dead ends: 90 [2024-11-12 12:49:58,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-11-12 12:49:58,701 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 93 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 12:49:58,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 314 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 12:49:58,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-12 12:49:58,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2024-11-12 12:49:58,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 56 states have (on average 1.1785714285714286) internal successors, (66), 60 states have internal predecessors, (66), 20 states have call successors, (20), 6 states have call predecessors, (20), 9 states have return successors, (27), 20 states have call predecessors, (27), 20 states have call successors, (27) [2024-11-12 12:49:58,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 113 transitions. [2024-11-12 12:49:58,722 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 113 transitions. Word has length 61 [2024-11-12 12:49:58,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:49:58,723 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 113 transitions. [2024-11-12 12:49:58,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 7 states have internal predecessors, (33), 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) [2024-11-12 12:49:58,723 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 113 transitions. [2024-11-12 12:49:58,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-12 12:49:58,729 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:49:58,729 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2024-11-12 12:49:58,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 12:49:58,729 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:49:58,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:49:58,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1168245, now seen corresponding path program 1 times [2024-11-12 12:49:58,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:49:58,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794214950] [2024-11-12 12:49:58,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:49:58,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:49:58,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:49:58,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 12:49:58,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:49:59,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 12:49:59,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:49:59,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 12:49:59,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:49:59,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 12:49:59,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:49:59,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 12:49:59,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:49:59,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 12:49:59,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:49:59,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 12:49:59,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:49:59,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 12:49:59,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:49:59,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 12:49:59,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:49:59,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 12:49:59,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:49:59,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-12 12:49:59,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:49:59,226 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-12 12:49:59,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:49:59,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794214950] [2024-11-12 12:49:59,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794214950] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 12:49:59,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780924082] [2024-11-12 12:49:59,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:49:59,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 12:49:59,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 12:49:59,231 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) [2024-11-12 12:49:59,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 12:49:59,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:49:59,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-12 12:49:59,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:49:59,466 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-12 12:49:59,467 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 12:49:59,676 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-12 12:49:59,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780924082] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 12:49:59,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 12:49:59,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 19 [2024-11-12 12:49:59,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236263448] [2024-11-12 12:49:59,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 12:49:59,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-12 12:49:59,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:49:59,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-12 12:49:59,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2024-11-12 12:49:59,679 INFO L87 Difference]: Start difference. First operand 87 states and 113 transitions. Second operand has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 15 states have internal predecessors, (56), 8 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (17), 9 states have call predecessors, (17), 7 states have call successors, (17) [2024-11-12 12:50:00,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:50:00,631 INFO L93 Difference]: Finished difference Result 92 states and 119 transitions. [2024-11-12 12:50:00,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-12 12:50:00,632 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 15 states have internal predecessors, (56), 8 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (17), 9 states have call predecessors, (17), 7 states have call successors, (17) Word has length 74 [2024-11-12 12:50:00,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:50:00,634 INFO L225 Difference]: With dead ends: 92 [2024-11-12 12:50:00,634 INFO L226 Difference]: Without dead ends: 92 [2024-11-12 12:50:00,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=914, Unknown=0, NotChecked=0, Total=1056 [2024-11-12 12:50:00,639 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 119 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 12:50:00,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 469 Invalid, 964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 12:50:00,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-12 12:50:00,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2024-11-12 12:50:00,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 63 states have internal predecessors, (69), 20 states have call successors, (20), 7 states have call predecessors, (20), 10 states have return successors, (29), 20 states have call predecessors, (29), 20 states have call successors, (29) [2024-11-12 12:50:00,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 118 transitions. [2024-11-12 12:50:00,655 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 118 transitions. Word has length 74 [2024-11-12 12:50:00,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:50:00,655 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 118 transitions. [2024-11-12 12:50:00,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 15 states have internal predecessors, (56), 8 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (17), 9 states have call predecessors, (17), 7 states have call successors, (17) [2024-11-12 12:50:00,656 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 118 transitions. [2024-11-12 12:50:00,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-12 12:50:00,661 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:50:00,661 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2024-11-12 12:50:00,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 12:50:00,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-12 12:50:00,866 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:50:00,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:50:00,867 INFO L85 PathProgramCache]: Analyzing trace with hash -524185842, now seen corresponding path program 1 times [2024-11-12 12:50:00,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:50:00,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061609826] [2024-11-12 12:50:00,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:50:00,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:50:00,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 12:50:00,917 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 12:50:00,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 12:50:00,983 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 12:50:00,983 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 12:50:00,984 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2024-11-12 12:50:00,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2024-11-12 12:50:00,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 12:50:00,989 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-12 12:50:01,051 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 12:50:01,057 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 12:50:01 BoogieIcfgContainer [2024-11-12 12:50:01,057 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 12:50:01,058 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 12:50:01,058 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 12:50:01,058 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 12:50:01,059 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:49:54" (3/4) ... [2024-11-12 12:50:01,060 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-12 12:50:01,109 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 12:50:01,109 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 12:50:01,110 INFO L158 Benchmark]: Toolchain (without parser) took 7479.61ms. Allocated memory was 138.4MB in the beginning and 232.8MB in the end (delta: 94.4MB). Free memory was 64.7MB in the beginning and 138.8MB in the end (delta: -74.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-12 12:50:01,110 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 138.4MB. Free memory is still 98.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 12:50:01,110 INFO L158 Benchmark]: CACSL2BoogieTranslator took 383.61ms. Allocated memory was 138.4MB in the beginning and 192.9MB in the end (delta: 54.5MB). Free memory was 64.4MB in the beginning and 160.2MB in the end (delta: -95.8MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. [2024-11-12 12:50:01,110 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.17ms. Allocated memory is still 192.9MB. Free memory was 160.2MB in the beginning and 161.7MB in the end (delta: -1.5MB). Peak memory consumption was 4.3MB. Max. memory is 16.1GB. [2024-11-12 12:50:01,111 INFO L158 Benchmark]: Boogie Preprocessor took 72.11ms. Allocated memory is still 192.9MB. Free memory was 161.7MB in the beginning and 158.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 12:50:01,111 INFO L158 Benchmark]: RCFGBuilder took 576.34ms. Allocated memory is still 192.9MB. Free memory was 157.5MB in the beginning and 131.3MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-12 12:50:01,111 INFO L158 Benchmark]: TraceAbstraction took 6341.04ms. Allocated memory was 192.9MB in the beginning and 232.8MB in the end (delta: 39.8MB). Free memory was 130.2MB in the beginning and 142.0MB in the end (delta: -11.8MB). Peak memory consumption was 28.1MB. Max. memory is 16.1GB. [2024-11-12 12:50:01,111 INFO L158 Benchmark]: Witness Printer took 51.44ms. Allocated memory is still 232.8MB. Free memory was 142.0MB in the beginning and 138.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 12:50:01,113 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 138.4MB. Free memory is still 98.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 383.61ms. Allocated memory was 138.4MB in the beginning and 192.9MB in the end (delta: 54.5MB). Free memory was 64.4MB in the beginning and 160.2MB in the end (delta: -95.8MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.17ms. Allocated memory is still 192.9MB. Free memory was 160.2MB in the beginning and 161.7MB in the end (delta: -1.5MB). Peak memory consumption was 4.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.11ms. Allocated memory is still 192.9MB. Free memory was 161.7MB in the beginning and 158.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 576.34ms. Allocated memory is still 192.9MB. Free memory was 157.5MB in the beginning and 131.3MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 6341.04ms. Allocated memory was 192.9MB in the beginning and 232.8MB in the end (delta: 39.8MB). Free memory was 130.2MB in the beginning and 142.0MB in the end (delta: -11.8MB). Peak memory consumption was 28.1MB. Max. memory is 16.1GB. * Witness Printer took 51.44ms. Allocated memory is still 232.8MB. Free memory was 142.0MB in the beginning and 138.8MB in the end (delta: 3.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: 14]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L110] 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}] [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}] [L31] n->right = nondet_tree() [L32] return n; VAL [\result={-1:0}] [L110] RET, EXPR nondet_tree() [L110] CALL task(nondet_tree()) [L86] CALL, EXPR min(t) VAL [\old(n)={-1:0}] [L37] COND FALSE !(!n) [L40] EXPR n->data [L40] int a = n->data; [L41] EXPR n->left VAL [\old(n)={-1:0}, a=2147483647, n={-1:0}] [L41] CALL, EXPR min(n->left) VAL [\old(n)={0:0}] [L37] COND TRUE !n [L38] return 2147483647; VAL [\old(n)={0:0}, \result=2147483647] [L41] RET, EXPR min(n->left) VAL [\old(n)={-1:0}, a=2147483647, n={-1:0}] [L41] int b = min(n->left); [L42] EXPR n->right VAL [\old(n)={-1:0}, a=2147483647, b=2147483647] [L42] CALL, EXPR min(n->right) VAL [\old(n)={0:0}] [L37] COND TRUE !n [L38] return 2147483647; VAL [\old(n)={0:0}, \result=2147483647] [L42] RET, EXPR min(n->right) VAL [\old(n)={-1:0}, a=2147483647, b=2147483647] [L42] int c = min(n->right); [L43] COND TRUE b <= a && b <= c [L43] return b; VAL [\old(n)={-1:0}, \result=2147483647] [L86] RET, EXPR min(t) VAL [t={-1:0}] [L86] int a = min(t); [L87] int b; VAL [a=2147483647, b={5:0}, t={-1:0}] [L89] CALL, EXPR size(t) VAL [\old(t)={-1:0}] [L81] COND FALSE !(!t) [L82] EXPR t->left VAL [\old(t)={-1:0}, t={-1:0}] [L82] CALL, EXPR size(t->left) VAL [\old(t)={0:0}] [L81] COND TRUE !t [L81] return 0; VAL [\old(t)={0:0}, \result=0] [L82] RET, EXPR size(t->left) VAL [\old(t)={-1:0}, t={-1:0}] [L82] EXPR t->right VAL [\old(t)={-1:0}] [L82] CALL, EXPR size(t->right) VAL [\old(t)={0:0}] [L81] COND TRUE !t [L81] return 0; VAL [\old(t)={0:0}, \result=0] [L82] RET, EXPR size(t->right) VAL [\old(t)={-1:0}] [L82] return size(t->left) + size(t->right) + 1; [L89] RET, EXPR size(t) VAL [a=2147483647, b={5:0}, t={-1:0}] [L89] int n = size(t); [L90] CALL assume_cycle_if_not(n != 0) [L9] COND FALSE !(!cond) [L90] RET assume_cycle_if_not(n != 0) [L91] EXPR, FCALL calloc(n, sizeof(int)) VAL [a=2147483647, b={5:0}, n=1, t={-1:0}] [L91] int *x = calloc(n, sizeof(int)); [L92] CALL tree_inorder(t, x, n) VAL [\old(a)={-2:0}, \old(i)=1, \old(t)={-1:0}] [L70] COND FALSE !(!t) [L73] EXPR t->left VAL [\old(a)={-2:0}, \old(i)=1, \old(t)={-1:0}, a={-2:0}, i=1, t={-1:0}] [L73] CALL, EXPR tree_inorder(t->left, a, i) VAL [\old(a)={-2:0}, \old(i)=1, \old(t)={0:0}] [L70] COND TRUE !t [L71] return i; VAL [\old(a)={-2:0}, \old(i)=1, \old(t)={0:0}, \result=1, a={-2:0}] [L73] RET, EXPR tree_inorder(t->left, a, i) VAL [\old(a)={-2:0}, \old(i)=1, \old(t)={-1:0}, a={-2:0}, i=1, t={-1:0}] [L73] i = tree_inorder(t->left, a, i) [L74] EXPR i++ [L74] EXPR t->data [L74] a[i++] = t->data [L75] EXPR t->right VAL [\old(a)={-2:0}, \old(i)=1, \old(t)={-1:0}, a={-2:0}, i=2] [L75] CALL, EXPR tree_inorder(t->right, a, i) VAL [\old(a)={-2:0}, \old(i)=2, \old(t)={0:0}] [L70] COND TRUE !t [L71] return i; VAL [\old(a)={-2:0}, \old(i)=2, \old(t)={0:0}, \result=2, a={-2:0}] [L75] RET, EXPR tree_inorder(t->right, a, i) VAL [\old(a)={-2:0}, \old(i)=1, \old(t)={-1:0}, a={-2:0}, i=2] [L75] i = tree_inorder(t->right, a, i) [L76] return i; VAL [\old(a)={-2:0}, \old(i)=1, \old(t)={-1:0}, \result=2, a={-2:0}, i=2] [L92] RET tree_inorder(t, x, n) VAL [a=2147483647, b={5:0}, n=1, t={-1:0}, x={-2:0}] [L93] EXPR x[0] [L93] CALL __VERIFIER_assert(a == x[0]) [L16] COND TRUE !cond [L16] CALL reach_error() [L14] __assert_fail("0", "tree_del_iter.c", 14, "reach_error") - UnprovableResult [Line: 109]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 85 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 6.2s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 447 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 418 mSDsluCounter, 1278 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1078 mSDsCounter, 302 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2174 IncrementalHoareTripleChecker+Invalid, 2476 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 302 mSolverCounterUnsat, 200 mSDtfsCounter, 2174 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 370 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91occurred in iteration=4, InterpolantAutomatonStates: 48, 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, 12 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 430 NumberOfCodeBlocks, 430 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 459 ConstructedInterpolants, 0 QuantifiedInterpolants, 1296 SizeOfPredicates, 6 NumberOfNonLiveVariables, 634 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 156/168 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! [2024-11-12 12:50:01,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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(valid-memcleanup)