./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/parallel-misc-5.wvr.c --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/weaver/parallel-misc-5.wvr.c -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 103efe8931e099ca6c2446ad32c4c46818a6d213fc850bc42032bda38d601e6f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:05:45,081 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:05:45,129 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 01:05:45,133 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:05:45,133 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:05:45,156 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:05:45,156 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:05:45,157 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:05:45,157 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:05:45,157 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:05:45,157 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:05:45,157 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:05:45,157 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:05:45,158 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:05:45,158 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:05:45,158 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:05:45,158 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:05:45,158 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:05:45,158 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:05:45,162 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:05:45,163 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:05:45,163 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:05:45,163 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:05:45,163 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:05:45,163 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:05:45,163 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:05:45,163 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:05:45,163 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:05:45,163 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:05:45,164 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:05:45,164 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:05:45,164 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:05:45,164 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:05:45,164 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:05:45,164 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:05:45,164 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:05:45,164 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:05:45,164 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:05:45,164 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:05:45,164 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:05:45,164 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:05:45,164 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:05:45,164 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:05:45,164 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:05:45,164 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:05:45,165 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:05:45,165 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:05:45,165 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 -> 103efe8931e099ca6c2446ad32c4c46818a6d213fc850bc42032bda38d601e6f [2025-01-10 01:05:45,477 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:05:45,491 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:05:45,493 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:05:45,494 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:05:45,494 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:05:45,495 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-misc-5.wvr.c [2025-01-10 01:05:46,740 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6d05a89e6/58f3e084ecf947228d6fa72d4fff5ace/FLAGf4495a578 [2025-01-10 01:05:47,110 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:05:47,111 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-5.wvr.c [2025-01-10 01:05:47,117 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6d05a89e6/58f3e084ecf947228d6fa72d4fff5ace/FLAGf4495a578 [2025-01-10 01:05:47,367 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6d05a89e6/58f3e084ecf947228d6fa72d4fff5ace [2025-01-10 01:05:47,369 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:05:47,370 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:05:47,375 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:05:47,375 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:05:47,382 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:05:47,383 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:05:47" (1/1) ... [2025-01-10 01:05:47,384 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@259c1d06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:47, skipping insertion in model container [2025-01-10 01:05:47,384 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:05:47" (1/1) ... [2025-01-10 01:05:47,399 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:05:47,561 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:05:47,574 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:05:47,594 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:05:47,612 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:05:47,613 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:47 WrapperNode [2025-01-10 01:05:47,614 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:05:47,614 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:05:47,615 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:05:47,615 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:05:47,619 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:47" (1/1) ... [2025-01-10 01:05:47,627 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:47" (1/1) ... [2025-01-10 01:05:47,649 INFO L138 Inliner]: procedures = 21, calls = 31, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 131 [2025-01-10 01:05:47,653 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:05:47,653 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:05:47,654 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:05:47,654 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:05:47,661 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:47" (1/1) ... [2025-01-10 01:05:47,662 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:47" (1/1) ... [2025-01-10 01:05:47,666 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:47" (1/1) ... [2025-01-10 01:05:47,686 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-10 01:05:47,688 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:47" (1/1) ... [2025-01-10 01:05:47,688 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:47" (1/1) ... [2025-01-10 01:05:47,691 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:47" (1/1) ... [2025-01-10 01:05:47,696 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:47" (1/1) ... [2025-01-10 01:05:47,698 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:47" (1/1) ... [2025-01-10 01:05:47,701 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:47" (1/1) ... [2025-01-10 01:05:47,702 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:47" (1/1) ... [2025-01-10 01:05:47,703 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:05:47,706 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:05:47,706 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:05:47,707 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:05:47,707 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:47" (1/1) ... [2025-01-10 01:05:47,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:05:47,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:05:47,735 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 01:05:47,742 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 01:05:47,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:05:47,762 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 01:05:47,762 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 01:05:47,763 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 01:05:47,763 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 01:05:47,763 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-10 01:05:47,763 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-10 01:05:47,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:05:47,763 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 01:05:47,763 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 01:05:47,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:05:47,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:05:47,764 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 01:05:47,838 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:05:47,839 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:05:48,063 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:05:48,064 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:05:48,189 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:05:48,189 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:05:48,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:05:48 BoogieIcfgContainer [2025-01-10 01:05:48,189 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:05:48,191 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:05:48,191 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:05:48,194 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:05:48,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:05:47" (1/3) ... [2025-01-10 01:05:48,195 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59baf006 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:05:48, skipping insertion in model container [2025-01-10 01:05:48,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:47" (2/3) ... [2025-01-10 01:05:48,195 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59baf006 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:05:48, skipping insertion in model container [2025-01-10 01:05:48,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:05:48" (3/3) ... [2025-01-10 01:05:48,196 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-5.wvr.c [2025-01-10 01:05:48,214 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:05:48,215 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-misc-5.wvr.c that has 4 procedures, 36 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-01-10 01:05:48,215 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:05:48,275 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-10 01:05:48,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 39 transitions, 99 flow [2025-01-10 01:05:48,330 INFO L124 PetriNetUnfolderBase]: 4/36 cut-off events. [2025-01-10 01:05:48,331 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 01:05:48,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 36 events. 4/36 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 67 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 30. Up to 2 conditions per place. [2025-01-10 01:05:48,335 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 39 transitions, 99 flow [2025-01-10 01:05:48,341 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 35 transitions, 88 flow [2025-01-10 01:05:48,346 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:05:48,357 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;@12b335de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:05:48,358 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-01-10 01:05:48,372 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:05:48,372 INFO L124 PetriNetUnfolderBase]: 4/32 cut-off events. [2025-01-10 01:05:48,372 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 01:05:48,372 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:48,372 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] [2025-01-10 01:05:48,373 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-10 01:05:48,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:48,377 INFO L85 PathProgramCache]: Analyzing trace with hash 2014330515, now seen corresponding path program 1 times [2025-01-10 01:05:48,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:48,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335700514] [2025-01-10 01:05:48,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:48,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:48,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 01:05:48,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:05:48,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:48,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:48,920 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 01:05:48,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:48,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335700514] [2025-01-10 01:05:48,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335700514] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:05:48,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:05:48,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:05:48,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585832204] [2025-01-10 01:05:48,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:05:48,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:05:48,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:48,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:05:48,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:05:48,988 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2025-01-10 01:05:48,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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 01:05:48,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:48,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2025-01-10 01:05:48,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:49,637 INFO L124 PetriNetUnfolderBase]: 2009/2876 cut-off events. [2025-01-10 01:05:49,637 INFO L125 PetriNetUnfolderBase]: For 219/219 co-relation queries the response was YES. [2025-01-10 01:05:49,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5916 conditions, 2876 events. 2009/2876 cut-off events. For 219/219 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 13609 event pairs, 73 based on Foata normal form. 1/2342 useless extension candidates. Maximal degree in co-relation 5564. Up to 990 conditions per place. [2025-01-10 01:05:49,693 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 73 selfloop transitions, 8 changer transitions 6/94 dead transitions. [2025-01-10 01:05:49,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 94 transitions, 404 flow [2025-01-10 01:05:49,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:05:49,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:05:49,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 156 transitions. [2025-01-10 01:05:49,718 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-01-10 01:05:49,723 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 88 flow. Second operand 6 states and 156 transitions. [2025-01-10 01:05:49,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 94 transitions, 404 flow [2025-01-10 01:05:49,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 94 transitions, 376 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-10 01:05:49,751 INFO L231 Difference]: Finished difference. Result has 41 places, 39 transitions, 122 flow [2025-01-10 01:05:49,754 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=122, PETRI_PLACES=41, PETRI_TRANSITIONS=39} [2025-01-10 01:05:49,766 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 0 predicate places. [2025-01-10 01:05:49,766 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 39 transitions, 122 flow [2025-01-10 01:05:49,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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 01:05:49,766 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:49,766 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, 1, 1] [2025-01-10 01:05:49,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:05:49,767 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-10 01:05:49,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:49,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1039421515, now seen corresponding path program 1 times [2025-01-10 01:05:49,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:49,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946368459] [2025-01-10 01:05:49,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:49,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:49,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 01:05:49,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 01:05:49,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:49,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:49,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:05:49,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:49,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946368459] [2025-01-10 01:05:49,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946368459] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:05:49,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:05:49,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:05:49,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858911170] [2025-01-10 01:05:49,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:05:49,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:05:49,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:49,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:05:49,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:05:49,904 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2025-01-10 01:05:49,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 39 transitions, 122 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 01:05:49,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:49,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2025-01-10 01:05:49,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:50,079 INFO L124 PetriNetUnfolderBase]: 1276/1987 cut-off events. [2025-01-10 01:05:50,080 INFO L125 PetriNetUnfolderBase]: For 512/538 co-relation queries the response was YES. [2025-01-10 01:05:50,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4382 conditions, 1987 events. 1276/1987 cut-off events. For 512/538 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 9893 event pairs, 441 based on Foata normal form. 71/1643 useless extension candidates. Maximal degree in co-relation 3116. Up to 1014 conditions per place. [2025-01-10 01:05:50,091 INFO L140 encePairwiseOnDemand]: 36/39 looper letters, 42 selfloop transitions, 2 changer transitions 1/58 dead transitions. [2025-01-10 01:05:50,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 58 transitions, 266 flow [2025-01-10 01:05:50,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:05:50,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:05:50,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2025-01-10 01:05:50,092 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.717948717948718 [2025-01-10 01:05:50,092 INFO L175 Difference]: Start difference. First operand has 41 places, 39 transitions, 122 flow. Second operand 3 states and 84 transitions. [2025-01-10 01:05:50,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 58 transitions, 266 flow [2025-01-10 01:05:50,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 58 transitions, 266 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 01:05:50,095 INFO L231 Difference]: Finished difference. Result has 44 places, 40 transitions, 136 flow [2025-01-10 01:05:50,095 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=44, PETRI_TRANSITIONS=40} [2025-01-10 01:05:50,095 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 3 predicate places. [2025-01-10 01:05:50,095 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 40 transitions, 136 flow [2025-01-10 01:05:50,095 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 01:05:50,095 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:50,096 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, 1, 1] [2025-01-10 01:05:50,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:05:50,096 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-10 01:05:50,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:50,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1531365648, now seen corresponding path program 1 times [2025-01-10 01:05:50,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:50,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722984601] [2025-01-10 01:05:50,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:50,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:50,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 01:05:50,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 01:05:50,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:50,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:50,189 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 01:05:50,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:50,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722984601] [2025-01-10 01:05:50,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722984601] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:05:50,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:05:50,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:05:50,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24681807] [2025-01-10 01:05:50,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:05:50,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:05:50,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:50,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:05:50,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:05:50,190 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2025-01-10 01:05:50,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 40 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 01:05:50,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:50,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2025-01-10 01:05:50,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:50,424 INFO L124 PetriNetUnfolderBase]: 1740/2758 cut-off events. [2025-01-10 01:05:50,424 INFO L125 PetriNetUnfolderBase]: For 1061/1108 co-relation queries the response was YES. [2025-01-10 01:05:50,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6417 conditions, 2758 events. 1740/2758 cut-off events. For 1061/1108 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 14304 event pairs, 622 based on Foata normal form. 100/2347 useless extension candidates. Maximal degree in co-relation 4816. Up to 1675 conditions per place. [2025-01-10 01:05:50,435 INFO L140 encePairwiseOnDemand]: 36/39 looper letters, 46 selfloop transitions, 2 changer transitions 1/62 dead transitions. [2025-01-10 01:05:50,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 62 transitions, 302 flow [2025-01-10 01:05:50,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:05:50,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:05:50,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2025-01-10 01:05:50,436 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7350427350427351 [2025-01-10 01:05:50,436 INFO L175 Difference]: Start difference. First operand has 44 places, 40 transitions, 136 flow. Second operand 3 states and 86 transitions. [2025-01-10 01:05:50,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 62 transitions, 302 flow [2025-01-10 01:05:50,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 62 transitions, 299 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:05:50,438 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 150 flow [2025-01-10 01:05:50,438 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=150, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2025-01-10 01:05:50,441 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 5 predicate places. [2025-01-10 01:05:50,442 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 150 flow [2025-01-10 01:05:50,442 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 01:05:50,442 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:50,442 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-01-10 01:05:50,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:05:50,442 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-10 01:05:50,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:50,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1511969591, now seen corresponding path program 1 times [2025-01-10 01:05:50,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:50,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898114366] [2025-01-10 01:05:50,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:50,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:50,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 01:05:50,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 01:05:50,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:50,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:50,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:05:50,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:50,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898114366] [2025-01-10 01:05:50,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898114366] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:05:50,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:05:50,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:05:50,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572253371] [2025-01-10 01:05:50,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:05:50,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:05:50,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:50,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:05:50,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:05:50,585 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2025-01-10 01:05:50,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 150 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 01:05:50,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:50,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2025-01-10 01:05:50,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:50,837 INFO L124 PetriNetUnfolderBase]: 2215/3270 cut-off events. [2025-01-10 01:05:50,837 INFO L125 PetriNetUnfolderBase]: For 1575/1615 co-relation queries the response was YES. [2025-01-10 01:05:50,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8240 conditions, 3270 events. 2215/3270 cut-off events. For 1575/1615 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 15439 event pairs, 132 based on Foata normal form. 40/2840 useless extension candidates. Maximal degree in co-relation 7393. Up to 1697 conditions per place. [2025-01-10 01:05:50,852 INFO L140 encePairwiseOnDemand]: 35/39 looper letters, 55 selfloop transitions, 5 changer transitions 0/69 dead transitions. [2025-01-10 01:05:50,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 69 transitions, 364 flow [2025-01-10 01:05:50,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:05:50,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:05:50,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2025-01-10 01:05:50,854 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6089743589743589 [2025-01-10 01:05:50,854 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 150 flow. Second operand 4 states and 95 transitions. [2025-01-10 01:05:50,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 69 transitions, 364 flow [2025-01-10 01:05:50,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 69 transitions, 361 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:05:50,860 INFO L231 Difference]: Finished difference. Result has 50 places, 43 transitions, 175 flow [2025-01-10 01:05:50,860 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=175, PETRI_PLACES=50, PETRI_TRANSITIONS=43} [2025-01-10 01:05:50,861 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 9 predicate places. [2025-01-10 01:05:50,861 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 175 flow [2025-01-10 01:05:50,861 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 01:05:50,861 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:50,861 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-01-10 01:05:50,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:05:50,861 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-10 01:05:50,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:50,862 INFO L85 PathProgramCache]: Analyzing trace with hash -575874563, now seen corresponding path program 1 times [2025-01-10 01:05:50,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:50,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193739612] [2025-01-10 01:05:50,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:50,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:50,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 01:05:50,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 01:05:50,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:50,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:51,010 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:05:51,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:51,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193739612] [2025-01-10 01:05:51,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193739612] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:05:51,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844685110] [2025-01-10 01:05:51,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:51,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:05:51,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:05:51,013 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:05:51,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 01:05:51,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 01:05:51,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 01:05:51,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:51,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:51,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 01:05:51,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:05:51,242 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:05:51,242 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:05:51,412 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:05:51,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844685110] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:05:51,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:05:51,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4, 5] total 12 [2025-01-10 01:05:51,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457109458] [2025-01-10 01:05:51,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:05:51,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:05:51,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:51,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:05:51,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:05:51,422 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-01-10 01:05:51,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 175 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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 01:05:51,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:51,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-01-10 01:05:51,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:51,856 INFO L124 PetriNetUnfolderBase]: 3611/5385 cut-off events. [2025-01-10 01:05:51,857 INFO L125 PetriNetUnfolderBase]: For 3038/3038 co-relation queries the response was YES. [2025-01-10 01:05:51,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13894 conditions, 5385 events. 3611/5385 cut-off events. For 3038/3038 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 26296 event pairs, 599 based on Foata normal form. 64/4934 useless extension candidates. Maximal degree in co-relation 12233. Up to 3559 conditions per place. [2025-01-10 01:05:51,876 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 78 selfloop transitions, 19 changer transitions 0/102 dead transitions. [2025-01-10 01:05:51,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 102 transitions, 577 flow [2025-01-10 01:05:51,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:05:51,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:05:51,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 137 transitions. [2025-01-10 01:05:51,878 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5854700854700855 [2025-01-10 01:05:51,878 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 175 flow. Second operand 6 states and 137 transitions. [2025-01-10 01:05:51,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 102 transitions, 577 flow [2025-01-10 01:05:51,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 102 transitions, 570 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:05:51,882 INFO L231 Difference]: Finished difference. Result has 59 places, 58 transitions, 326 flow [2025-01-10 01:05:51,883 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=326, PETRI_PLACES=59, PETRI_TRANSITIONS=58} [2025-01-10 01:05:51,883 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 18 predicate places. [2025-01-10 01:05:51,883 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 58 transitions, 326 flow [2025-01-10 01:05:51,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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 01:05:51,883 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:51,883 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-01-10 01:05:51,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 01:05:52,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:05:52,084 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-10 01:05:52,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:52,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1037965213, now seen corresponding path program 2 times [2025-01-10 01:05:52,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:52,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417041693] [2025-01-10 01:05:52,085 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:05:52,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:52,091 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 1 equivalence classes. [2025-01-10 01:05:52,096 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 01:05:52,096 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:05:52,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:52,195 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 01:05:52,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:52,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417041693] [2025-01-10 01:05:52,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417041693] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:05:52,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:05:52,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:05:52,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709629751] [2025-01-10 01:05:52,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:05:52,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:05:52,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:52,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:05:52,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:05:52,202 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2025-01-10 01:05:52,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 58 transitions, 326 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 01:05:52,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:52,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2025-01-10 01:05:52,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:52,824 INFO L124 PetriNetUnfolderBase]: 3785/5693 cut-off events. [2025-01-10 01:05:52,824 INFO L125 PetriNetUnfolderBase]: For 7206/7320 co-relation queries the response was YES. [2025-01-10 01:05:52,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17269 conditions, 5693 events. 3785/5693 cut-off events. For 7206/7320 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 28974 event pairs, 509 based on Foata normal form. 118/5142 useless extension candidates. Maximal degree in co-relation 13885. Up to 2016 conditions per place. [2025-01-10 01:05:52,865 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 81 selfloop transitions, 10 changer transitions 0/102 dead transitions. [2025-01-10 01:05:52,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 102 transitions, 692 flow [2025-01-10 01:05:52,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:05:52,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:05:52,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 119 transitions. [2025-01-10 01:05:52,868 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6102564102564103 [2025-01-10 01:05:52,868 INFO L175 Difference]: Start difference. First operand has 59 places, 58 transitions, 326 flow. Second operand 5 states and 119 transitions. [2025-01-10 01:05:52,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 102 transitions, 692 flow [2025-01-10 01:05:52,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 102 transitions, 690 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-01-10 01:05:52,879 INFO L231 Difference]: Finished difference. Result has 64 places, 59 transitions, 360 flow [2025-01-10 01:05:52,879 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=360, PETRI_PLACES=64, PETRI_TRANSITIONS=59} [2025-01-10 01:05:52,881 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 23 predicate places. [2025-01-10 01:05:52,881 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 59 transitions, 360 flow [2025-01-10 01:05:52,881 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 01:05:52,881 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:52,881 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-01-10 01:05:52,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:05:52,881 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-10 01:05:52,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:52,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1531342677, now seen corresponding path program 3 times [2025-01-10 01:05:52,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:52,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948999833] [2025-01-10 01:05:52,882 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:05:52,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:52,890 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 1 equivalence classes. [2025-01-10 01:05:52,898 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 01:05:52,898 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 01:05:52,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:53,113 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 01:05:53,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:53,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948999833] [2025-01-10 01:05:53,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948999833] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:05:53,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:05:53,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 01:05:53,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926011392] [2025-01-10 01:05:53,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:05:53,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:05:53,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:53,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:05:53,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:05:53,132 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2025-01-10 01:05:53,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 59 transitions, 360 flow. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 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 01:05:53,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:53,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2025-01-10 01:05:53,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:54,483 INFO L124 PetriNetUnfolderBase]: 10678/15898 cut-off events. [2025-01-10 01:05:54,484 INFO L125 PetriNetUnfolderBase]: For 25394/25612 co-relation queries the response was YES. [2025-01-10 01:05:54,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49274 conditions, 15898 events. 10678/15898 cut-off events. For 25394/25612 co-relation queries the response was YES. Maximal size of possible extension queue 725. Compared 96196 event pairs, 1429 based on Foata normal form. 336/14451 useless extension candidates. Maximal degree in co-relation 40160. Up to 4640 conditions per place. [2025-01-10 01:05:54,569 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 124 selfloop transitions, 28 changer transitions 53/216 dead transitions. [2025-01-10 01:05:54,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 216 transitions, 1605 flow [2025-01-10 01:05:54,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:05:54,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:05:54,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 237 transitions. [2025-01-10 01:05:54,570 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6752136752136753 [2025-01-10 01:05:54,571 INFO L175 Difference]: Start difference. First operand has 64 places, 59 transitions, 360 flow. Second operand 9 states and 237 transitions. [2025-01-10 01:05:54,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 216 transitions, 1605 flow [2025-01-10 01:05:54,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 216 transitions, 1568 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:05:54,611 INFO L231 Difference]: Finished difference. Result has 75 places, 74 transitions, 587 flow [2025-01-10 01:05:54,611 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=587, PETRI_PLACES=75, PETRI_TRANSITIONS=74} [2025-01-10 01:05:54,612 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 34 predicate places. [2025-01-10 01:05:54,612 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 74 transitions, 587 flow [2025-01-10 01:05:54,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 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 01:05:54,612 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:54,612 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-01-10 01:05:54,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 01:05:54,613 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-10 01:05:54,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:54,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1705217846, now seen corresponding path program 4 times [2025-01-10 01:05:54,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:54,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639045324] [2025-01-10 01:05:54,613 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:05:54,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:54,622 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-01-10 01:05:54,627 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:05:54,628 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:05:54,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:54,688 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:05:54,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:54,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639045324] [2025-01-10 01:05:54,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639045324] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:05:54,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:05:54,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:05:54,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737080132] [2025-01-10 01:05:54,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:05:54,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:05:54,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:54,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:05:54,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:05:54,690 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2025-01-10 01:05:54,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 74 transitions, 587 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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 01:05:54,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:54,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2025-01-10 01:05:54,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:55,600 INFO L124 PetriNetUnfolderBase]: 7602/11955 cut-off events. [2025-01-10 01:05:55,600 INFO L125 PetriNetUnfolderBase]: For 31375/32038 co-relation queries the response was YES. [2025-01-10 01:05:55,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40567 conditions, 11955 events. 7602/11955 cut-off events. For 31375/32038 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 74362 event pairs, 2201 based on Foata normal form. 506/10809 useless extension candidates. Maximal degree in co-relation 37762. Up to 4368 conditions per place. [2025-01-10 01:05:55,665 INFO L140 encePairwiseOnDemand]: 36/39 looper letters, 108 selfloop transitions, 15 changer transitions 0/149 dead transitions. [2025-01-10 01:05:55,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 149 transitions, 1308 flow [2025-01-10 01:05:55,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:05:55,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:05:55,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 121 transitions. [2025-01-10 01:05:55,666 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7756410256410257 [2025-01-10 01:05:55,666 INFO L175 Difference]: Start difference. First operand has 75 places, 74 transitions, 587 flow. Second operand 4 states and 121 transitions. [2025-01-10 01:05:55,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 149 transitions, 1308 flow [2025-01-10 01:05:55,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 149 transitions, 1249 flow, removed 13 selfloop flow, removed 4 redundant places. [2025-01-10 01:05:55,706 INFO L231 Difference]: Finished difference. Result has 76 places, 85 transitions, 734 flow [2025-01-10 01:05:55,707 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=734, PETRI_PLACES=76, PETRI_TRANSITIONS=85} [2025-01-10 01:05:55,709 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 35 predicate places. [2025-01-10 01:05:55,709 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 85 transitions, 734 flow [2025-01-10 01:05:55,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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 01:05:55,710 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:55,710 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-01-10 01:05:55,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 01:05:55,710 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-10 01:05:55,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:55,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1533118785, now seen corresponding path program 2 times [2025-01-10 01:05:55,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:55,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882190578] [2025-01-10 01:05:55,711 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:05:55,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:55,722 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-01-10 01:05:55,847 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 33 statements. [2025-01-10 01:05:55,850 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:05:55,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:55,950 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:05:55,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:55,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882190578] [2025-01-10 01:05:55,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882190578] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:05:55,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:05:55,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:05:55,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072337763] [2025-01-10 01:05:55,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:05:55,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:05:55,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:55,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:05:55,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:05:55,963 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2025-01-10 01:05:55,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 85 transitions, 734 flow. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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 01:05:55,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:55,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2025-01-10 01:05:55,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:57,242 INFO L124 PetriNetUnfolderBase]: 11409/17079 cut-off events. [2025-01-10 01:05:57,242 INFO L125 PetriNetUnfolderBase]: For 52959/53351 co-relation queries the response was YES. [2025-01-10 01:05:57,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61014 conditions, 17079 events. 11409/17079 cut-off events. For 52959/53351 co-relation queries the response was YES. Maximal size of possible extension queue 573. Compared 102635 event pairs, 1954 based on Foata normal form. 500/15527 useless extension candidates. Maximal degree in co-relation 55710. Up to 7168 conditions per place. [2025-01-10 01:05:57,344 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 119 selfloop transitions, 11 changer transitions 0/144 dead transitions. [2025-01-10 01:05:57,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 144 transitions, 1404 flow [2025-01-10 01:05:57,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:05:57,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:05:57,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 120 transitions. [2025-01-10 01:05:57,346 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6153846153846154 [2025-01-10 01:05:57,346 INFO L175 Difference]: Start difference. First operand has 76 places, 85 transitions, 734 flow. Second operand 5 states and 120 transitions. [2025-01-10 01:05:57,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 144 transitions, 1404 flow [2025-01-10 01:05:57,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 144 transitions, 1363 flow, removed 19 selfloop flow, removed 1 redundant places. [2025-01-10 01:05:57,386 INFO L231 Difference]: Finished difference. Result has 80 places, 87 transitions, 757 flow [2025-01-10 01:05:57,386 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=709, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=757, PETRI_PLACES=80, PETRI_TRANSITIONS=87} [2025-01-10 01:05:57,387 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 39 predicate places. [2025-01-10 01:05:57,387 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 87 transitions, 757 flow [2025-01-10 01:05:57,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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 01:05:57,388 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:57,388 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-01-10 01:05:57,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 01:05:57,388 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-10 01:05:57,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:57,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1301854315, now seen corresponding path program 3 times [2025-01-10 01:05:57,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:57,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739499745] [2025-01-10 01:05:57,389 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:05:57,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:57,395 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 3 equivalence classes. [2025-01-10 01:05:57,407 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:05:57,408 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-10 01:05:57,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:57,458 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:05:57,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:57,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739499745] [2025-01-10 01:05:57,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739499745] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:05:57,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124576239] [2025-01-10 01:05:57,459 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:05:57,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:05:57,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:05:57,464 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:05:57,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 01:05:57,501 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 3 equivalence classes. [2025-01-10 01:05:57,516 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:05:57,517 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-10 01:05:57,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:57,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 01:05:57,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:05:57,546 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:05:57,547 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:05:57,571 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:05:57,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124576239] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:05:57,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:05:57,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 3] total 4 [2025-01-10 01:05:57,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724112580] [2025-01-10 01:05:57,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:05:57,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:05:57,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:57,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:05:57,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:05:57,572 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2025-01-10 01:05:57,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 87 transitions, 757 flow. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 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 01:05:57,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:57,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2025-01-10 01:05:57,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:06:00,007 INFO L124 PetriNetUnfolderBase]: 20349/31679 cut-off events. [2025-01-10 01:06:00,007 INFO L125 PetriNetUnfolderBase]: For 97551/98691 co-relation queries the response was YES. [2025-01-10 01:06:00,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112152 conditions, 31679 events. 20349/31679 cut-off events. For 97551/98691 co-relation queries the response was YES. Maximal size of possible extension queue 1148. Compared 224880 event pairs, 7154 based on Foata normal form. 945/28102 useless extension candidates. Maximal degree in co-relation 104092. Up to 10604 conditions per place. [2025-01-10 01:06:00,263 INFO L140 encePairwiseOnDemand]: 36/39 looper letters, 130 selfloop transitions, 11 changer transitions 0/169 dead transitions. [2025-01-10 01:06:00,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 169 transitions, 1687 flow [2025-01-10 01:06:00,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:06:00,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:06:00,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2025-01-10 01:06:00,269 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.75 [2025-01-10 01:06:00,269 INFO L175 Difference]: Start difference. First operand has 80 places, 87 transitions, 757 flow. Second operand 4 states and 117 transitions. [2025-01-10 01:06:00,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 169 transitions, 1687 flow [2025-01-10 01:06:00,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 169 transitions, 1671 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:06:00,357 INFO L231 Difference]: Finished difference. Result has 82 places, 95 transitions, 868 flow [2025-01-10 01:06:00,358 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=741, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=868, PETRI_PLACES=82, PETRI_TRANSITIONS=95} [2025-01-10 01:06:00,358 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 41 predicate places. [2025-01-10 01:06:00,358 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 95 transitions, 868 flow [2025-01-10 01:06:00,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 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 01:06:00,358 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:06:00,358 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2025-01-10 01:06:00,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 01:06:00,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:06:00,563 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-10 01:06:00,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:06:00,563 INFO L85 PathProgramCache]: Analyzing trace with hash 139630973, now seen corresponding path program 5 times [2025-01-10 01:06:00,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:06:00,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812504249] [2025-01-10 01:06:00,564 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:06:00,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:06:00,574 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 3 equivalence classes. [2025-01-10 01:06:00,586 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 01:06:00,586 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-01-10 01:06:00,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:00,744 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:06:00,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:06:00,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812504249] [2025-01-10 01:06:00,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812504249] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:06:00,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070867992] [2025-01-10 01:06:00,744 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:06:00,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:06:00,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:06:00,746 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:06:00,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 01:06:00,784 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 3 equivalence classes. [2025-01-10 01:06:00,799 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 01:06:00,800 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-01-10 01:06:00,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:00,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 01:06:00,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:06:00,968 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:06:00,968 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:06:01,286 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:06:01,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070867992] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:06:01,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:06:01,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 11] total 20 [2025-01-10 01:06:01,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036020037] [2025-01-10 01:06:01,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:06:01,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-10 01:06:01,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:06:01,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-10 01:06:01,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2025-01-10 01:06:01,298 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-01-10 01:06:01,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 95 transitions, 868 flow. Second operand has 21 states, 21 states have (on average 12.428571428571429) internal successors, (261), 21 states have internal predecessors, (261), 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 01:06:01,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:06:01,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-01-10 01:06:01,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:06:13,789 INFO L124 PetriNetUnfolderBase]: 104237/153623 cut-off events. [2025-01-10 01:06:13,790 INFO L125 PetriNetUnfolderBase]: For 563824/563824 co-relation queries the response was YES. [2025-01-10 01:06:14,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 572916 conditions, 153623 events. 104237/153623 cut-off events. For 563824/563824 co-relation queries the response was YES. Maximal size of possible extension queue 3879. Compared 1132474 event pairs, 9289 based on Foata normal form. 2520/140576 useless extension candidates. Maximal degree in co-relation 345977. Up to 27923 conditions per place. [2025-01-10 01:06:15,091 INFO L140 encePairwiseOnDemand]: 25/39 looper letters, 653 selfloop transitions, 418 changer transitions 174/1250 dead transitions. [2025-01-10 01:06:15,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 1250 transitions, 11764 flow [2025-01-10 01:06:15,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-01-10 01:06:15,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2025-01-10 01:06:15,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 1344 transitions. [2025-01-10 01:06:15,102 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5384615384615384 [2025-01-10 01:06:15,102 INFO L175 Difference]: Start difference. First operand has 82 places, 95 transitions, 868 flow. Second operand 64 states and 1344 transitions. [2025-01-10 01:06:15,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 1250 transitions, 11764 flow [2025-01-10 01:06:15,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 1250 transitions, 11604 flow, removed 80 selfloop flow, removed 0 redundant places. [2025-01-10 01:06:15,577 INFO L231 Difference]: Finished difference. Result has 181 places, 599 transitions, 7764 flow [2025-01-10 01:06:15,578 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=856, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=64, PETRI_FLOW=7764, PETRI_PLACES=181, PETRI_TRANSITIONS=599} [2025-01-10 01:06:15,578 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 140 predicate places. [2025-01-10 01:06:15,578 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 599 transitions, 7764 flow [2025-01-10 01:06:15,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 12.428571428571429) internal successors, (261), 21 states have internal predecessors, (261), 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 01:06:15,580 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:06:15,580 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 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] [2025-01-10 01:06:15,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 01:06:15,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:06:15,784 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-10 01:06:15,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:06:15,785 INFO L85 PathProgramCache]: Analyzing trace with hash -771044324, now seen corresponding path program 6 times [2025-01-10 01:06:15,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:06:15,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722845155] [2025-01-10 01:06:15,785 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:06:15,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:06:15,795 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 41 statements into 4 equivalence classes. [2025-01-10 01:06:15,806 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 41 of 41 statements. [2025-01-10 01:06:15,806 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-01-10 01:06:15,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:15,871 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:06:15,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:06:15,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722845155] [2025-01-10 01:06:15,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722845155] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:06:15,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299244374] [2025-01-10 01:06:15,872 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:06:15,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:06:15,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:06:15,874 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:06:15,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 01:06:15,909 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 41 statements into 4 equivalence classes. [2025-01-10 01:06:15,929 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 41 of 41 statements. [2025-01-10 01:06:15,930 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-01-10 01:06:15,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:15,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:06:15,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:06:15,963 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:06:15,963 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:06:15,998 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:06:15,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299244374] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:06:15,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:06:15,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 5 [2025-01-10 01:06:15,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844846049] [2025-01-10 01:06:15,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:06:15,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:06:15,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:06:15,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:06:15,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:06:15,999 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2025-01-10 01:06:16,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 599 transitions, 7764 flow. Second operand has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 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 01:06:16,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:06:16,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2025-01-10 01:06:16,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand