./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/13-privatized_25-struct_nr_true.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/goblint-regression/13-privatized_25-struct_nr_true.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4017723c7e4b1f7c431c7e7a6ea6ca9df8ac56fc590cd03021a11577cb455eff --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:57:19,232 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:57:19,287 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 00:57:19,294 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:57:19,295 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:57:19,311 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:57:19,311 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:57:19,312 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:57:19,312 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:57:19,312 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:57:19,312 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:57:19,312 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:57:19,312 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:57:19,312 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:57:19,312 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:57:19,313 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:57:19,313 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:57:19,313 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:57:19,313 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:57:19,313 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:57:19,313 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:57:19,314 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:57:19,314 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:57:19,314 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:57:19,314 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:57:19,314 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:57:19,314 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:57:19,314 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:57:19,315 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:57:19,315 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:57:19,315 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:57:19,315 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:57:19,315 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:57:19,315 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:57:19,315 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:57:19,315 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:57:19,315 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:57:19,315 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:57:19,315 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:57:19,316 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:57:19,316 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:57:19,316 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:57:19,316 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:57:19,316 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:57:19,316 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:57:19,316 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:57:19,316 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:57:19,317 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 4017723c7e4b1f7c431c7e7a6ea6ca9df8ac56fc590cd03021a11577cb455eff [2025-01-10 00:57:19,564 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:57:19,572 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:57:19,574 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:57:19,576 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:57:19,576 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:57:19,577 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/13-privatized_25-struct_nr_true.i [2025-01-10 00:57:20,770 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4e9603bb4/67090e20877d4ed5833031457fdb06c9/FLAG0f8915857 [2025-01-10 00:57:21,194 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:57:21,195 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_25-struct_nr_true.i [2025-01-10 00:57:21,209 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4e9603bb4/67090e20877d4ed5833031457fdb06c9/FLAG0f8915857 [2025-01-10 00:57:21,419 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4e9603bb4/67090e20877d4ed5833031457fdb06c9 [2025-01-10 00:57:21,421 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:57:21,422 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:57:21,423 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:57:21,423 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:57:21,426 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:57:21,427 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:57:21" (1/1) ... [2025-01-10 00:57:21,429 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68b15b05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:21, skipping insertion in model container [2025-01-10 00:57:21,429 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:57:21" (1/1) ... [2025-01-10 00:57:21,453 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:57:21,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:57:21,678 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:57:21,714 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:57:21,742 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:57:21,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:21 WrapperNode [2025-01-10 00:57:21,743 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:57:21,744 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:57:21,745 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:57:21,745 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:57:21,749 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:21" (1/1) ... [2025-01-10 00:57:21,758 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:21" (1/1) ... [2025-01-10 00:57:21,775 INFO L138 Inliner]: procedures = 162, calls = 22, calls flagged for inlining = 7, calls inlined = 10, statements flattened = 83 [2025-01-10 00:57:21,776 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:57:21,776 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:57:21,777 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:57:21,777 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:57:21,782 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:21" (1/1) ... [2025-01-10 00:57:21,782 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:21" (1/1) ... [2025-01-10 00:57:21,784 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:21" (1/1) ... [2025-01-10 00:57:21,793 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5]. The 0 writes are split as follows [0, 0]. [2025-01-10 00:57:21,793 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:21" (1/1) ... [2025-01-10 00:57:21,793 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:21" (1/1) ... [2025-01-10 00:57:21,803 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:21" (1/1) ... [2025-01-10 00:57:21,803 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:21" (1/1) ... [2025-01-10 00:57:21,805 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:21" (1/1) ... [2025-01-10 00:57:21,805 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:21" (1/1) ... [2025-01-10 00:57:21,810 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:21" (1/1) ... [2025-01-10 00:57:21,811 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:57:21,813 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:57:21,813 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:57:21,813 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:57:21,814 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:21" (1/1) ... [2025-01-10 00:57:21,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:57:21,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:57:21,840 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 00:57:21,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 00:57:21,862 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 00:57:21,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:57:21,862 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-10 00:57:21,862 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-10 00:57:21,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:57:21,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 00:57:21,862 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 00:57:21,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:57:21,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:57:21,863 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 00:57:21,957 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:57:21,958 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:57:22,105 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:57:22,105 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:57:22,207 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:57:22,208 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 00:57:22,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:57:22 BoogieIcfgContainer [2025-01-10 00:57:22,208 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:57:22,210 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:57:22,211 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:57:22,215 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:57:22,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:57:21" (1/3) ... [2025-01-10 00:57:22,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b1405ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:57:22, skipping insertion in model container [2025-01-10 00:57:22,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:21" (2/3) ... [2025-01-10 00:57:22,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b1405ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:57:22, skipping insertion in model container [2025-01-10 00:57:22,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:57:22" (3/3) ... [2025-01-10 00:57:22,218 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_25-struct_nr_true.i [2025-01-10 00:57:22,231 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:57:22,232 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 13-privatized_25-struct_nr_true.i that has 2 procedures, 42 locations, 1 initial locations, 0 loop locations, and 5 error locations. [2025-01-10 00:57:22,233 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:57:22,280 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-10 00:57:22,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 49 transitions, 105 flow [2025-01-10 00:57:22,334 INFO L124 PetriNetUnfolderBase]: 8/48 cut-off events. [2025-01-10 00:57:22,336 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 00:57:22,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 48 events. 8/48 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 87 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2025-01-10 00:57:22,341 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 49 transitions, 105 flow [2025-01-10 00:57:22,344 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 47 transitions, 100 flow [2025-01-10 00:57:22,350 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:57:22,368 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;@10eaae99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:57:22,369 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-01-10 00:57:22,375 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:57:22,375 INFO L124 PetriNetUnfolderBase]: 2/9 cut-off events. [2025-01-10 00:57:22,375 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:57:22,375 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:57:22,376 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 00:57:22,378 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:57:22,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:57:22,384 INFO L85 PathProgramCache]: Analyzing trace with hash 9126208, now seen corresponding path program 1 times [2025-01-10 00:57:22,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:57:22,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104234735] [2025-01-10 00:57:22,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:57:22,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:57:22,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 00:57:22,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 00:57:22,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:57:22,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:57:22,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:57:22,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:57:22,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104234735] [2025-01-10 00:57:22,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104234735] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:57:22,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:57:22,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:57:22,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190275392] [2025-01-10 00:57:22,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:57:22,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:57:22,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:57:22,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:57:22,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:57:22,682 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2025-01-10 00:57:22,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 47 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:57:22,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:57:22,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2025-01-10 00:57:22,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:57:22,806 INFO L124 PetriNetUnfolderBase]: 63/202 cut-off events. [2025-01-10 00:57:22,806 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 00:57:22,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 355 conditions, 202 events. 63/202 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 920 event pairs, 54 based on Foata normal form. 51/241 useless extension candidates. Maximal degree in co-relation 337. Up to 127 conditions per place. [2025-01-10 00:57:22,808 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 26 selfloop transitions, 4 changer transitions 0/41 dead transitions. [2025-01-10 00:57:22,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 41 transitions, 148 flow [2025-01-10 00:57:22,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:57:22,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:57:22,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2025-01-10 00:57:22,828 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.564625850340136 [2025-01-10 00:57:22,831 INFO L175 Difference]: Start difference. First operand has 43 places, 47 transitions, 100 flow. Second operand 3 states and 83 transitions. [2025-01-10 00:57:22,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 41 transitions, 148 flow [2025-01-10 00:57:22,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 41 transitions, 144 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:57:22,836 INFO L231 Difference]: Finished difference. Result has 36 places, 32 transitions, 74 flow [2025-01-10 00:57:22,837 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=36, PETRI_TRANSITIONS=32} [2025-01-10 00:57:22,840 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, -7 predicate places. [2025-01-10 00:57:22,840 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 32 transitions, 74 flow [2025-01-10 00:57:22,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:57:22,840 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:57:22,840 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:57:22,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:57:22,841 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:57:22,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:57:22,842 INFO L85 PathProgramCache]: Analyzing trace with hash -862377079, now seen corresponding path program 1 times [2025-01-10 00:57:22,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:57:22,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760820626] [2025-01-10 00:57:22,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:57:22,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:57:22,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 00:57:22,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 00:57:22,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:57:22,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:57:22,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:57:22,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:57:22,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760820626] [2025-01-10 00:57:22,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760820626] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:57:22,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:57:22,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:57:22,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434128018] [2025-01-10 00:57:22,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:57:22,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:57:22,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:57:22,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:57:22,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:57:22,970 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2025-01-10 00:57:22,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 32 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:57:22,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:57:22,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2025-01-10 00:57:22,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:57:23,058 INFO L124 PetriNetUnfolderBase]: 62/190 cut-off events. [2025-01-10 00:57:23,058 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-01-10 00:57:23,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 367 conditions, 190 events. 62/190 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 783 event pairs, 25 based on Foata normal form. 10/200 useless extension candidates. Maximal degree in co-relation 190. Up to 83 conditions per place. [2025-01-10 00:57:23,060 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 33 selfloop transitions, 6 changer transitions 0/50 dead transitions. [2025-01-10 00:57:23,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 50 transitions, 190 flow [2025-01-10 00:57:23,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:57:23,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:57:23,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2025-01-10 00:57:23,061 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4489795918367347 [2025-01-10 00:57:23,061 INFO L175 Difference]: Start difference. First operand has 36 places, 32 transitions, 74 flow. Second operand 5 states and 110 transitions. [2025-01-10 00:57:23,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 50 transitions, 190 flow [2025-01-10 00:57:23,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 50 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:57:23,063 INFO L231 Difference]: Finished difference. Result has 41 places, 35 transitions, 102 flow [2025-01-10 00:57:23,063 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=102, PETRI_PLACES=41, PETRI_TRANSITIONS=35} [2025-01-10 00:57:23,064 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2025-01-10 00:57:23,064 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 35 transitions, 102 flow [2025-01-10 00:57:23,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:57:23,064 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:57:23,064 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:57:23,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:57:23,064 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:57:23,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:57:23,065 INFO L85 PathProgramCache]: Analyzing trace with hash 417072151, now seen corresponding path program 1 times [2025-01-10 00:57:23,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:57:23,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538060432] [2025-01-10 00:57:23,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:57:23,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:57:23,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 00:57:23,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 00:57:23,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:57:23,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:57:23,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:57:23,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:57:23,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538060432] [2025-01-10 00:57:23,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538060432] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:57:23,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:57:23,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:57:23,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79195724] [2025-01-10 00:57:23,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:57:23,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:57:23,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:57:23,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:57:23,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:57:23,123 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2025-01-10 00:57:23,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 102 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:57:23,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:57:23,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2025-01-10 00:57:23,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:57:23,190 INFO L124 PetriNetUnfolderBase]: 57/160 cut-off events. [2025-01-10 00:57:23,191 INFO L125 PetriNetUnfolderBase]: For 76/84 co-relation queries the response was YES. [2025-01-10 00:57:23,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 376 conditions, 160 events. 57/160 cut-off events. For 76/84 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 589 event pairs, 16 based on Foata normal form. 0/157 useless extension candidates. Maximal degree in co-relation 134. Up to 72 conditions per place. [2025-01-10 00:57:23,192 INFO L140 encePairwiseOnDemand]: 41/49 looper letters, 31 selfloop transitions, 7 changer transitions 0/48 dead transitions. [2025-01-10 00:57:23,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 48 transitions, 216 flow [2025-01-10 00:57:23,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:57:23,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:57:23,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2025-01-10 00:57:23,193 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4530612244897959 [2025-01-10 00:57:23,193 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 102 flow. Second operand 5 states and 111 transitions. [2025-01-10 00:57:23,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 48 transitions, 216 flow [2025-01-10 00:57:23,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 48 transitions, 209 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:57:23,195 INFO L231 Difference]: Finished difference. Result has 44 places, 35 transitions, 136 flow [2025-01-10 00:57:23,195 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=136, PETRI_PLACES=44, PETRI_TRANSITIONS=35} [2025-01-10 00:57:23,195 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 1 predicate places. [2025-01-10 00:57:23,195 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 35 transitions, 136 flow [2025-01-10 00:57:23,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:57:23,196 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:57:23,196 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:57:23,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:57:23,196 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:57:23,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:57:23,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1980935580, now seen corresponding path program 1 times [2025-01-10 00:57:23,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:57:23,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775570334] [2025-01-10 00:57:23,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:57:23,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:57:23,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 00:57:23,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 00:57:23,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:57:23,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:57:23,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:57:23,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:57:23,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775570334] [2025-01-10 00:57:23,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775570334] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:57:23,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:57:23,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:57:23,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993911210] [2025-01-10 00:57:23,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:57:23,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:57:23,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:57:23,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:57:23,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:57:23,237 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2025-01-10 00:57:23,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:57:23,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:57:23,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2025-01-10 00:57:23,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:57:23,269 INFO L124 PetriNetUnfolderBase]: 17/80 cut-off events. [2025-01-10 00:57:23,269 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-01-10 00:57:23,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 80 events. 17/80 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 185 event pairs, 4 based on Foata normal form. 7/87 useless extension candidates. Maximal degree in co-relation 98. Up to 38 conditions per place. [2025-01-10 00:57:23,270 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 20 selfloop transitions, 4 changer transitions 0/37 dead transitions. [2025-01-10 00:57:23,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 37 transitions, 181 flow [2025-01-10 00:57:23,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:57:23,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:57:23,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2025-01-10 00:57:23,271 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48299319727891155 [2025-01-10 00:57:23,271 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 136 flow. Second operand 3 states and 71 transitions. [2025-01-10 00:57:23,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 37 transitions, 181 flow [2025-01-10 00:57:23,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 37 transitions, 173 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-10 00:57:23,272 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 127 flow [2025-01-10 00:57:23,272 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=127, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2025-01-10 00:57:23,273 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 1 predicate places. [2025-01-10 00:57:23,273 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 127 flow [2025-01-10 00:57:23,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:57:23,273 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:57:23,273 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:57:23,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:57:23,273 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:57:23,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:57:23,274 INFO L85 PathProgramCache]: Analyzing trace with hash -526624621, now seen corresponding path program 1 times [2025-01-10 00:57:23,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:57:23,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719725223] [2025-01-10 00:57:23,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:57:23,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:57:23,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 00:57:23,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 00:57:23,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:57:23,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:57:23,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:57:23,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:57:23,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719725223] [2025-01-10 00:57:23,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719725223] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:57:23,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:57:23,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:57:23,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317365122] [2025-01-10 00:57:23,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:57:23,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:57:23,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:57:23,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:57:23,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:57:23,363 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2025-01-10 00:57:23,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 127 flow. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:57:23,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:57:23,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2025-01-10 00:57:23,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:57:23,416 INFO L124 PetriNetUnfolderBase]: 19/79 cut-off events. [2025-01-10 00:57:23,416 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-01-10 00:57:23,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213 conditions, 79 events. 19/79 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 165 event pairs, 9 based on Foata normal form. 1/80 useless extension candidates. Maximal degree in co-relation 110. Up to 28 conditions per place. [2025-01-10 00:57:23,417 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 22 selfloop transitions, 8 changer transitions 0/38 dead transitions. [2025-01-10 00:57:23,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 38 transitions, 200 flow [2025-01-10 00:57:23,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:57:23,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:57:23,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2025-01-10 00:57:23,418 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38095238095238093 [2025-01-10 00:57:23,418 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 127 flow. Second operand 6 states and 112 transitions. [2025-01-10 00:57:23,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 38 transitions, 200 flow [2025-01-10 00:57:23,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 38 transitions, 192 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:57:23,419 INFO L231 Difference]: Finished difference. Result has 45 places, 32 transitions, 138 flow [2025-01-10 00:57:23,420 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=138, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2025-01-10 00:57:23,420 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2025-01-10 00:57:23,420 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 138 flow [2025-01-10 00:57:23,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:57:23,421 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:57:23,421 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:57:23,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:57:23,421 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:57:23,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:57:23,421 INFO L85 PathProgramCache]: Analyzing trace with hash 541578241, now seen corresponding path program 1 times [2025-01-10 00:57:23,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:57:23,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728549976] [2025-01-10 00:57:23,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:57:23,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:57:23,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 00:57:23,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 00:57:23,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:57:23,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:57:23,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:57:23,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:57:23,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728549976] [2025-01-10 00:57:23,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728549976] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:57:23,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:57:23,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:57:23,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549823164] [2025-01-10 00:57:23,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:57:23,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:57:23,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:57:23,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:57:23,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:57:23,490 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2025-01-10 00:57:23,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 138 flow. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:57:23,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:57:23,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2025-01-10 00:57:23,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:57:23,556 INFO L124 PetriNetUnfolderBase]: 17/78 cut-off events. [2025-01-10 00:57:23,556 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2025-01-10 00:57:23,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 78 events. 17/78 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 146 event pairs, 4 based on Foata normal form. 2/80 useless extension candidates. Maximal degree in co-relation 110. Up to 15 conditions per place. [2025-01-10 00:57:23,556 INFO L140 encePairwiseOnDemand]: 41/49 looper letters, 27 selfloop transitions, 9 changer transitions 0/42 dead transitions. [2025-01-10 00:57:23,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 42 transitions, 237 flow [2025-01-10 00:57:23,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:57:23,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 00:57:23,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2025-01-10 00:57:23,557 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38010204081632654 [2025-01-10 00:57:23,557 INFO L175 Difference]: Start difference. First operand has 45 places, 32 transitions, 138 flow. Second operand 8 states and 149 transitions. [2025-01-10 00:57:23,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 42 transitions, 237 flow [2025-01-10 00:57:23,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 42 transitions, 217 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-10 00:57:23,559 INFO L231 Difference]: Finished difference. Result has 45 places, 30 transitions, 139 flow [2025-01-10 00:57:23,559 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=139, PETRI_PLACES=45, PETRI_TRANSITIONS=30} [2025-01-10 00:57:23,560 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2025-01-10 00:57:23,560 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 30 transitions, 139 flow [2025-01-10 00:57:23,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:57:23,560 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:57:23,560 INFO L206 CegarLoopForPetriNet]: 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] [2025-01-10 00:57:23,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:57:23,561 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:57:23,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:57:23,561 INFO L85 PathProgramCache]: Analyzing trace with hash 293300969, now seen corresponding path program 1 times [2025-01-10 00:57:23,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:57:23,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802336883] [2025-01-10 00:57:23,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:57:23,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:57:23,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 00:57:23,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 00:57:23,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:57:23,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:57:23,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:57:23,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:57:23,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802336883] [2025-01-10 00:57:23,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802336883] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:57:23,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:57:23,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:57:23,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557077461] [2025-01-10 00:57:23,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:57:23,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:57:23,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:57:23,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:57:23,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:57:23,587 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2025-01-10 00:57:23,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 30 transitions, 139 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:57:23,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:57:23,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2025-01-10 00:57:23,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:57:23,606 INFO L124 PetriNetUnfolderBase]: 15/74 cut-off events. [2025-01-10 00:57:23,606 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2025-01-10 00:57:23,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210 conditions, 74 events. 15/74 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 147 event pairs, 15 based on Foata normal form. 2/76 useless extension candidates. Maximal degree in co-relation 110. Up to 57 conditions per place. [2025-01-10 00:57:23,607 INFO L140 encePairwiseOnDemand]: 47/49 looper letters, 0 selfloop transitions, 0 changer transitions 29/29 dead transitions. [2025-01-10 00:57:23,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 29 transitions, 179 flow [2025-01-10 00:57:23,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:57:23,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:57:23,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2025-01-10 00:57:23,607 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4217687074829932 [2025-01-10 00:57:23,608 INFO L175 Difference]: Start difference. First operand has 45 places, 30 transitions, 139 flow. Second operand 3 states and 62 transitions. [2025-01-10 00:57:23,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 29 transitions, 179 flow [2025-01-10 00:57:23,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 29 transitions, 163 flow, removed 1 selfloop flow, removed 6 redundant places. [2025-01-10 00:57:23,608 INFO L231 Difference]: Finished difference. Result has 40 places, 0 transitions, 0 flow [2025-01-10 00:57:23,609 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=40, PETRI_TRANSITIONS=0} [2025-01-10 00:57:23,609 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2025-01-10 00:57:23,609 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 0 transitions, 0 flow [2025-01-10 00:57:23,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:57:23,611 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2025-01-10 00:57:23,611 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2025-01-10 00:57:23,611 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2025-01-10 00:57:23,611 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2025-01-10 00:57:23,611 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 8 remaining) [2025-01-10 00:57:23,612 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONMEMORY_LEAK (2 of 8 remaining) [2025-01-10 00:57:23,612 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 8 remaining) [2025-01-10 00:57:23,612 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2025-01-10 00:57:23,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:57:23,612 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:57:23,615 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 00:57:23,615 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 00:57:23,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:57:23 BasicIcfg [2025-01-10 00:57:23,618 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 00:57:23,619 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 00:57:23,619 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 00:57:23,619 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 00:57:23,620 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:57:22" (3/4) ... [2025-01-10 00:57:23,621 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 00:57:23,622 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-01-10 00:57:23,624 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2025-01-10 00:57:23,624 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-01-10 00:57:23,625 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-10 00:57:23,625 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-01-10 00:57:23,684 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 00:57:23,685 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 00:57:23,685 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 00:57:23,686 INFO L158 Benchmark]: Toolchain (without parser) took 2263.66ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 105.0MB in the end (delta: 761.6kB). Peak memory consumption was 69.5MB. Max. memory is 16.1GB. [2025-01-10 00:57:23,686 INFO L158 Benchmark]: CDTParser took 0.63ms. Allocated memory is still 201.3MB. Free memory is still 129.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:57:23,686 INFO L158 Benchmark]: CACSL2BoogieTranslator took 320.65ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 86.5MB in the end (delta: 19.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 00:57:23,686 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.86ms. Allocated memory is still 142.6MB. Free memory was 86.5MB in the beginning and 85.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:57:23,686 INFO L158 Benchmark]: Boogie Preprocessor took 36.04ms. Allocated memory is still 142.6MB. Free memory was 85.1MB in the beginning and 83.1MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 00:57:23,687 INFO L158 Benchmark]: RCFGBuilder took 395.41ms. Allocated memory is still 142.6MB. Free memory was 83.1MB in the beginning and 62.0MB in the end (delta: 21.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 00:57:23,687 INFO L158 Benchmark]: TraceAbstraction took 1408.99ms. Allocated memory is still 142.6MB. Free memory was 61.4MB in the beginning and 43.0MB in the end (delta: 18.4MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. [2025-01-10 00:57:23,687 INFO L158 Benchmark]: Witness Printer took 66.13ms. Allocated memory is still 142.6MB. Free memory was 43.0MB in the beginning and 105.0MB in the end (delta: -62.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 00:57:23,688 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.63ms. Allocated memory is still 201.3MB. Free memory is still 129.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 320.65ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 86.5MB in the end (delta: 19.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.86ms. Allocated memory is still 142.6MB. Free memory was 86.5MB in the beginning and 85.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.04ms. Allocated memory is still 142.6MB. Free memory was 85.1MB in the beginning and 83.1MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 395.41ms. Allocated memory is still 142.6MB. Free memory was 83.1MB in the beginning and 62.0MB in the end (delta: 21.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1408.99ms. Allocated memory is still 142.6MB. Free memory was 61.4MB in the beginning and 43.0MB in the end (delta: 18.4MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. * Witness Printer took 66.13ms. Allocated memory is still 142.6MB. Free memory was 43.0MB in the beginning and 105.0MB in the end (delta: -62.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 18]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 697]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 18]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 18]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 61 locations, 8 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.3s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 82 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 73 mSDsluCounter, 7 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 380 IncrementalHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 4 mSDtfsCounter, 380 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=139occurred in iteration=6, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 94 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 87 ConstructedInterpolants, 0 QuantifiedInterpolants, 228 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 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, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-10 00:57:23,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 Result: TRUE