./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 c00e63dc 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-?-c00e63d-m [2025-02-06 13:04:51,057 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 13:04:51,115 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 13:04:51,119 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 13:04:51,120 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 13:04:51,141 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 13:04:51,141 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 13:04:51,142 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 13:04:51,142 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 13:04:51,142 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 13:04:51,142 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 13:04:51,143 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 13:04:51,143 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 13:04:51,143 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 13:04:51,143 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 13:04:51,143 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 13:04:51,143 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 13:04:51,144 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 13:04:51,144 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 13:04:51,144 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 13:04:51,144 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 13:04:51,144 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 13:04:51,144 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 13:04:51,144 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 13:04:51,144 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 13:04:51,144 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 13:04:51,144 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 13:04:51,144 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 13:04:51,144 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 13:04:51,144 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 13:04:51,144 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 13:04:51,144 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 13:04:51,144 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 13:04:51,144 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:04:51,144 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 13:04:51,144 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 13:04:51,144 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 13:04:51,144 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 13:04:51,144 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 13:04:51,144 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 13:04:51,145 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 13:04:51,145 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 13:04:51,145 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-02-06 13:04:51,363 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 13:04:51,371 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 13:04:51,374 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 13:04:51,375 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 13:04:51,375 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 13:04:51,377 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-02-06 13:04:52,549 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/726e248d6/f10dad3010bf46b2992a1f8930098156/FLAGb81652b17 [2025-02-06 13:04:52,821 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 13:04:52,821 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-5.wvr.c [2025-02-06 13:04:52,827 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/726e248d6/f10dad3010bf46b2992a1f8930098156/FLAGb81652b17 [2025-02-06 13:04:53,110 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/726e248d6/f10dad3010bf46b2992a1f8930098156 [2025-02-06 13:04:53,113 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 13:04:53,114 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 13:04:53,115 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 13:04:53,115 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 13:04:53,118 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 13:04:53,122 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:04:53" (1/1) ... [2025-02-06 13:04:53,123 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@209b7958 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:04:53, skipping insertion in model container [2025-02-06 13:04:53,123 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:04:53" (1/1) ... [2025-02-06 13:04:53,135 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 13:04:53,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:04:53,269 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 13:04:53,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:04:53,298 INFO L204 MainTranslator]: Completed translation [2025-02-06 13:04:53,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:04:53 WrapperNode [2025-02-06 13:04:53,299 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 13:04:53,300 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 13:04:53,300 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 13:04:53,301 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 13:04:53,305 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:04:53" (1/1) ... [2025-02-06 13:04:53,310 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:04:53" (1/1) ... [2025-02-06 13:04:53,331 INFO L138 Inliner]: procedures = 21, calls = 31, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 131 [2025-02-06 13:04:53,331 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 13:04:53,332 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 13:04:53,332 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 13:04:53,332 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 13:04:53,338 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:04:53" (1/1) ... [2025-02-06 13:04:53,339 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:04:53" (1/1) ... [2025-02-06 13:04:53,341 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:04:53" (1/1) ... [2025-02-06 13:04:53,354 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-02-06 13:04:53,355 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:04:53" (1/1) ... [2025-02-06 13:04:53,355 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:04:53" (1/1) ... [2025-02-06 13:04:53,361 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:04:53" (1/1) ... [2025-02-06 13:04:53,366 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:04:53" (1/1) ... [2025-02-06 13:04:53,367 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:04:53" (1/1) ... [2025-02-06 13:04:53,367 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:04:53" (1/1) ... [2025-02-06 13:04:53,368 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 13:04:53,369 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 13:04:53,369 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 13:04:53,369 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 13:04:53,374 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:04:53" (1/1) ... [2025-02-06 13:04:53,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:04:53,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:04:53,407 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-02-06 13:04:53,411 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-02-06 13:04:53,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 13:04:53,429 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 13:04:53,429 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 13:04:53,429 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 13:04:53,430 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 13:04:53,430 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-06 13:04:53,430 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-06 13:04:53,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 13:04:53,430 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 13:04:53,430 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 13:04:53,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 13:04:53,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 13:04:53,431 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 13:04:53,504 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 13:04:53,505 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 13:04:53,677 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 13:04:53,677 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 13:04:53,807 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 13:04:53,808 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 13:04:53,808 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:04:53 BoogieIcfgContainer [2025-02-06 13:04:53,808 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 13:04:53,810 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 13:04:53,810 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 13:04:53,815 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 13:04:53,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:04:53" (1/3) ... [2025-02-06 13:04:53,816 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27d19623 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:04:53, skipping insertion in model container [2025-02-06 13:04:53,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:04:53" (2/3) ... [2025-02-06 13:04:53,816 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27d19623 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:04:53, skipping insertion in model container [2025-02-06 13:04:53,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:04:53" (3/3) ... [2025-02-06 13:04:53,817 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-5.wvr.c [2025-02-06 13:04:53,827 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 13:04:53,828 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-02-06 13:04:53,828 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 13:04:53,875 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-06 13:04:53,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 39 transitions, 99 flow [2025-02-06 13:04:53,924 INFO L124 PetriNetUnfolderBase]: 4/36 cut-off events. [2025-02-06 13:04:53,926 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 13:04:53,928 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 5. Compared 60 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-02-06 13:04:53,928 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 39 transitions, 99 flow [2025-02-06 13:04:53,930 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 35 transitions, 88 flow [2025-02-06 13:04:53,937 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 13:04:53,945 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;@404355bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 13:04:53,946 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-02-06 13:04:53,954 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 13:04:53,954 INFO L124 PetriNetUnfolderBase]: 4/32 cut-off events. [2025-02-06 13:04:53,954 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 13:04:53,955 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:04:53,955 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-02-06 13:04:53,955 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 13:04:53,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:04:53,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1962703194, now seen corresponding path program 1 times [2025-02-06 13:04:53,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:04:53,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996689405] [2025-02-06 13:04:53,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:04:53,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:04:54,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 13:04:54,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 13:04:54,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:04:54,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:04:54,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:04:54,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:04:54,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996689405] [2025-02-06 13:04:54,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996689405] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:04:54,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:04:54,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:04:54,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165830078] [2025-02-06 13:04:54,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:04:54,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:04:54,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:04:54,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:04:54,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:04:54,481 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-02-06 13:04:54,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-02-06 13:04:54,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:04:54,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-02-06 13:04:54,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:04:54,977 INFO L124 PetriNetUnfolderBase]: 2110/3012 cut-off events. [2025-02-06 13:04:54,978 INFO L125 PetriNetUnfolderBase]: For 108/108 co-relation queries the response was YES. [2025-02-06 13:04:54,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6230 conditions, 3012 events. 2110/3012 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 13999 event pairs, 78 based on Foata normal form. 1/2588 useless extension candidates. Maximal degree in co-relation 6118. Up to 1069 conditions per place. [2025-02-06 13:04:54,998 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 80 selfloop transitions, 8 changer transitions 6/99 dead transitions. [2025-02-06 13:04:54,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 99 transitions, 419 flow [2025-02-06 13:04:54,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:04:55,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 13:04:55,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2025-02-06 13:04:55,010 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6452991452991453 [2025-02-06 13:04:55,012 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 88 flow. Second operand 6 states and 151 transitions. [2025-02-06 13:04:55,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 99 transitions, 419 flow [2025-02-06 13:04:55,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 99 transitions, 397 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-06 13:04:55,023 INFO L231 Difference]: Finished difference. Result has 41 places, 39 transitions, 122 flow [2025-02-06 13:04:55,025 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-02-06 13:04:55,028 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 0 predicate places. [2025-02-06 13:04:55,028 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 39 transitions, 122 flow [2025-02-06 13:04:55,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-02-06 13:04:55,030 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:04:55,030 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-02-06 13:04:55,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 13:04:55,030 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 13:04:55,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:04:55,031 INFO L85 PathProgramCache]: Analyzing trace with hash 14872553, now seen corresponding path program 1 times [2025-02-06 13:04:55,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:04:55,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693252583] [2025-02-06 13:04:55,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:04:55,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:04:55,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 13:04:55,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 13:04:55,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:04:55,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:04:55,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:04:55,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:04:55,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693252583] [2025-02-06 13:04:55,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693252583] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:04:55,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:04:55,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:04:55,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736172310] [2025-02-06 13:04:55,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:04:55,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:04:55,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:04:55,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:04:55,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:04:55,129 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-02-06 13:04:55,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 39 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-02-06 13:04:55,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:04:55,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-02-06 13:04:55,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:04:55,348 INFO L124 PetriNetUnfolderBase]: 1991/2923 cut-off events. [2025-02-06 13:04:55,348 INFO L125 PetriNetUnfolderBase]: For 816/816 co-relation queries the response was YES. [2025-02-06 13:04:55,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6829 conditions, 2923 events. 1991/2923 cut-off events. For 816/816 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 13197 event pairs, 680 based on Foata normal form. 78/2568 useless extension candidates. Maximal degree in co-relation 5833. Up to 1656 conditions per place. [2025-02-06 13:04:55,362 INFO L140 encePairwiseOnDemand]: 36/39 looper letters, 55 selfloop transitions, 2 changer transitions 1/63 dead transitions. [2025-02-06 13:04:55,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 63 transitions, 306 flow [2025-02-06 13:04:55,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:04:55,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:04:55,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2025-02-06 13:04:55,364 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6752136752136753 [2025-02-06 13:04:55,364 INFO L175 Difference]: Start difference. First operand has 41 places, 39 transitions, 122 flow. Second operand 3 states and 79 transitions. [2025-02-06 13:04:55,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 63 transitions, 306 flow [2025-02-06 13:04:55,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 63 transitions, 306 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 13:04:55,367 INFO L231 Difference]: Finished difference. Result has 44 places, 40 transitions, 136 flow [2025-02-06 13:04:55,368 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-02-06 13:04:55,369 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 3 predicate places. [2025-02-06 13:04:55,369 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 40 transitions, 136 flow [2025-02-06 13:04:55,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-02-06 13:04:55,369 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:04:55,369 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-02-06 13:04:55,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 13:04:55,370 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 13:04:55,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:04:55,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1308636144, now seen corresponding path program 1 times [2025-02-06 13:04:55,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:04:55,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536476849] [2025-02-06 13:04:55,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:04:55,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:04:55,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 13:04:55,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 13:04:55,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:04:55,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:04:55,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:04:55,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:04:55,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536476849] [2025-02-06 13:04:55,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536476849] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:04:55,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:04:55,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:04:55,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568990883] [2025-02-06 13:04:55,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:04:55,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:04:55,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:04:55,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:04:55,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:04:55,471 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-02-06 13:04:55,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 40 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-02-06 13:04:55,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:04:55,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-02-06 13:04:55,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:04:55,745 INFO L124 PetriNetUnfolderBase]: 2882/4249 cut-off events. [2025-02-06 13:04:55,745 INFO L125 PetriNetUnfolderBase]: For 1578/1578 co-relation queries the response was YES. [2025-02-06 13:04:55,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10309 conditions, 4249 events. 2882/4249 cut-off events. For 1578/1578 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 19917 event pairs, 1041 based on Foata normal form. 86/3650 useless extension candidates. Maximal degree in co-relation 9155. Up to 2663 conditions per place. [2025-02-06 13:04:55,762 INFO L140 encePairwiseOnDemand]: 36/39 looper letters, 55 selfloop transitions, 2 changer transitions 1/63 dead transitions. [2025-02-06 13:04:55,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 63 transitions, 328 flow [2025-02-06 13:04:55,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:04:55,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:04:55,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2025-02-06 13:04:55,764 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6581196581196581 [2025-02-06 13:04:55,764 INFO L175 Difference]: Start difference. First operand has 44 places, 40 transitions, 136 flow. Second operand 3 states and 77 transitions. [2025-02-06 13:04:55,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 63 transitions, 328 flow [2025-02-06 13:04:55,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 63 transitions, 325 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 13:04:55,769 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 150 flow [2025-02-06 13:04:55,769 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-02-06 13:04:55,770 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 5 predicate places. [2025-02-06 13:04:55,770 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 150 flow [2025-02-06 13:04:55,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-02-06 13:04:55,770 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:04:55,770 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-02-06 13:04:55,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 13:04:55,771 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 13:04:55,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:04:55,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1314696354, now seen corresponding path program 1 times [2025-02-06 13:04:55,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:04:55,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611971851] [2025-02-06 13:04:55,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:04:55,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:04:55,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 13:04:55,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 13:04:55,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:04:55,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:04:55,933 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:04:55,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:04:55,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611971851] [2025-02-06 13:04:55,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611971851] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:04:55,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:04:55,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:04:55,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399662113] [2025-02-06 13:04:55,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:04:55,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:04:55,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:04:55,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:04:55,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:04:55,935 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-02-06 13:04:55,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 150 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-02-06 13:04:55,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:04:55,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-02-06 13:04:55,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:04:56,157 INFO L124 PetriNetUnfolderBase]: 2591/3813 cut-off events. [2025-02-06 13:04:56,158 INFO L125 PetriNetUnfolderBase]: For 1784/1784 co-relation queries the response was YES. [2025-02-06 13:04:56,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9601 conditions, 3813 events. 2591/3813 cut-off events. For 1784/1784 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 16839 event pairs, 175 based on Foata normal form. 0/3296 useless extension candidates. Maximal degree in co-relation 8425. Up to 1972 conditions per place. [2025-02-06 13:04:56,172 INFO L140 encePairwiseOnDemand]: 35/39 looper letters, 60 selfloop transitions, 5 changer transitions 0/70 dead transitions. [2025-02-06 13:04:56,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 70 transitions, 379 flow [2025-02-06 13:04:56,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:04:56,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:04:56,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2025-02-06 13:04:56,173 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-02-06 13:04:56,173 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 150 flow. Second operand 4 states and 91 transitions. [2025-02-06 13:04:56,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 70 transitions, 379 flow [2025-02-06 13:04:56,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 70 transitions, 376 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 13:04:56,178 INFO L231 Difference]: Finished difference. Result has 50 places, 43 transitions, 175 flow [2025-02-06 13:04:56,178 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-02-06 13:04:56,178 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 9 predicate places. [2025-02-06 13:04:56,178 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 175 flow [2025-02-06 13:04:56,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-02-06 13:04:56,178 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:04:56,178 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-02-06 13:04:56,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 13:04:56,179 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 13:04:56,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:04:56,179 INFO L85 PathProgramCache]: Analyzing trace with hash -301175742, now seen corresponding path program 2 times [2025-02-06 13:04:56,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:04:56,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990835598] [2025-02-06 13:04:56,179 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:04:56,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:04:56,188 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-02-06 13:04:56,197 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 29 statements. [2025-02-06 13:04:56,198 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 13:04:56,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:04:56,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:04:56,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:04:56,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990835598] [2025-02-06 13:04:56,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990835598] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:04:56,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:04:56,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:04:56,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394854780] [2025-02-06 13:04:56,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:04:56,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:04:56,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:04:56,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:04:56,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:04:56,323 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-02-06 13:04:56,323 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-02-06 13:04:56,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:04:56,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-02-06 13:04:56,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:04:56,659 INFO L124 PetriNetUnfolderBase]: 3347/4901 cut-off events. [2025-02-06 13:04:56,659 INFO L125 PetriNetUnfolderBase]: For 2738/2738 co-relation queries the response was YES. [2025-02-06 13:04:56,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12630 conditions, 4901 events. 3347/4901 cut-off events. For 2738/2738 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 23491 event pairs, 277 based on Foata normal form. 72/4408 useless extension candidates. Maximal degree in co-relation 11496. Up to 2034 conditions per place. [2025-02-06 13:04:56,683 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 77 selfloop transitions, 7 changer transitions 0/89 dead transitions. [2025-02-06 13:04:56,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 89 transitions, 491 flow [2025-02-06 13:04:56,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:04:56,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 13:04:56,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 118 transitions. [2025-02-06 13:04:56,685 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6051282051282051 [2025-02-06 13:04:56,685 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 175 flow. Second operand 5 states and 118 transitions. [2025-02-06 13:04:56,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 89 transitions, 491 flow [2025-02-06 13:04:56,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 89 transitions, 487 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 13:04:56,694 INFO L231 Difference]: Finished difference. Result has 54 places, 44 transitions, 194 flow [2025-02-06 13:04:56,694 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=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=194, PETRI_PLACES=54, PETRI_TRANSITIONS=44} [2025-02-06 13:04:56,695 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 13 predicate places. [2025-02-06 13:04:56,695 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 44 transitions, 194 flow [2025-02-06 13:04:56,696 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-02-06 13:04:56,696 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:04:56,696 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-02-06 13:04:56,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 13:04:56,696 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 13:04:56,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:04:56,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1679504912, now seen corresponding path program 3 times [2025-02-06 13:04:56,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:04:56,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193486765] [2025-02-06 13:04:56,699 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 13:04:56,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:04:56,704 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 2 equivalence classes. [2025-02-06 13:04:56,713 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 25 of 29 statements. [2025-02-06 13:04:56,713 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 13:04:56,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:04:56,812 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 13:04:56,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:04:56,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193486765] [2025-02-06 13:04:56,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193486765] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:04:56,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:04:56,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:04:56,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731791573] [2025-02-06 13:04:56,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:04:56,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:04:56,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:04:56,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:04:56,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:04:56,814 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-02-06 13:04:56,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 44 transitions, 194 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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-02-06 13:04:56,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:04:56,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-02-06 13:04:56,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:04:57,209 INFO L124 PetriNetUnfolderBase]: 4741/6923 cut-off events. [2025-02-06 13:04:57,209 INFO L125 PetriNetUnfolderBase]: For 5005/5005 co-relation queries the response was YES. [2025-02-06 13:04:57,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17984 conditions, 6923 events. 4741/6923 cut-off events. For 5005/5005 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 34232 event pairs, 965 based on Foata normal form. 134/6244 useless extension candidates. Maximal degree in co-relation 13975. Up to 2689 conditions per place. [2025-02-06 13:04:57,240 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 80 selfloop transitions, 6 changer transitions 0/91 dead transitions. [2025-02-06 13:04:57,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 91 transitions, 535 flow [2025-02-06 13:04:57,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:04:57,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 13:04:57,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2025-02-06 13:04:57,241 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-02-06 13:04:57,241 INFO L175 Difference]: Start difference. First operand has 54 places, 44 transitions, 194 flow. Second operand 5 states and 117 transitions. [2025-02-06 13:04:57,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 91 transitions, 535 flow [2025-02-06 13:04:57,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 91 transitions, 521 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 13:04:57,253 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 204 flow [2025-02-06 13:04:57,253 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=204, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2025-02-06 13:04:57,254 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 15 predicate places. [2025-02-06 13:04:57,254 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 204 flow [2025-02-06 13:04:57,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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-02-06 13:04:57,254 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:04:57,254 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-02-06 13:04:57,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 13:04:57,255 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 13:04:57,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:04:57,255 INFO L85 PathProgramCache]: Analyzing trace with hash 953740928, now seen corresponding path program 4 times [2025-02-06 13:04:57,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:04:57,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404886210] [2025-02-06 13:04:57,255 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 13:04:57,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:04:57,261 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-02-06 13:04:57,271 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 13:04:57,272 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 13:04:57,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:04:57,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:04:57,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:04:57,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404886210] [2025-02-06 13:04:57,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404886210] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:04:57,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:04:57,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 13:04:57,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709061913] [2025-02-06 13:04:57,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:04:57,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 13:04:57,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:04:57,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 13:04:57,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 13:04:57,454 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-02-06 13:04:57,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 204 flow. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 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-02-06 13:04:57,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:04:57,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-02-06 13:04:57,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:04:58,568 INFO L124 PetriNetUnfolderBase]: 13807/19945 cut-off events. [2025-02-06 13:04:58,569 INFO L125 PetriNetUnfolderBase]: For 16000/16000 co-relation queries the response was YES. [2025-02-06 13:04:58,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52633 conditions, 19945 events. 13807/19945 cut-off events. For 16000/16000 co-relation queries the response was YES. Maximal size of possible extension queue 823. Compared 118497 event pairs, 2485 based on Foata normal form. 368/17966 useless extension candidates. Maximal degree in co-relation 42996. Up to 6016 conditions per place. [2025-02-06 13:04:58,632 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 122 selfloop transitions, 25 changer transitions 33/185 dead transitions. [2025-02-06 13:04:58,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 185 transitions, 1119 flow [2025-02-06 13:04:58,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 13:04:58,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 13:04:58,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 228 transitions. [2025-02-06 13:04:58,634 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6495726495726496 [2025-02-06 13:04:58,634 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 204 flow. Second operand 9 states and 228 transitions. [2025-02-06 13:04:58,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 185 transitions, 1119 flow [2025-02-06 13:04:58,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 185 transitions, 1089 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 13:04:58,643 INFO L231 Difference]: Finished difference. Result has 67 places, 60 transitions, 409 flow [2025-02-06 13:04:58,643 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=409, PETRI_PLACES=67, PETRI_TRANSITIONS=60} [2025-02-06 13:04:58,643 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 26 predicate places. [2025-02-06 13:04:58,644 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 60 transitions, 409 flow [2025-02-06 13:04:58,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 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-02-06 13:04:58,644 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:04:58,644 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-02-06 13:04:58,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 13:04:58,644 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 13:04:58,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:04:58,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1457264907, now seen corresponding path program 5 times [2025-02-06 13:04:58,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:04:58,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581812176] [2025-02-06 13:04:58,644 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 13:04:58,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:04:58,654 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 3 equivalence classes. [2025-02-06 13:04:58,663 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 13:04:58,663 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-02-06 13:04:58,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:04:58,746 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:04:58,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:04:58,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581812176] [2025-02-06 13:04:58,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581812176] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:04:58,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249056712] [2025-02-06 13:04:58,747 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 13:04:58,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:04:58,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:04:58,750 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-02-06 13:04:58,752 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-02-06 13:04:58,795 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 3 equivalence classes. [2025-02-06 13:04:58,816 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 13:04:58,816 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-02-06 13:04:58,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:04:58,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 13:04:58,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:04:58,895 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:04:58,895 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:04:58,939 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:04:58,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249056712] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:04:58,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:04:58,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 3] total 4 [2025-02-06 13:04:58,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057193254] [2025-02-06 13:04:58,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:04:58,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:04:58,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:04:58,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:04:58,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:04:58,942 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-02-06 13:04:58,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 60 transitions, 409 flow. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 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-02-06 13:04:58,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:04:58,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-02-06 13:04:58,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:04:59,785 INFO L124 PetriNetUnfolderBase]: 10395/15254 cut-off events. [2025-02-06 13:04:59,785 INFO L125 PetriNetUnfolderBase]: For 33868/33868 co-relation queries the response was YES. [2025-02-06 13:04:59,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48187 conditions, 15254 events. 10395/15254 cut-off events. For 33868/33868 co-relation queries the response was YES. Maximal size of possible extension queue 437. Compared 85230 event pairs, 4523 based on Foata normal form. 170/13601 useless extension candidates. Maximal degree in co-relation 44463. Up to 5986 conditions per place. [2025-02-06 13:04:59,861 INFO L140 encePairwiseOnDemand]: 36/39 looper letters, 111 selfloop transitions, 11 changer transitions 1/128 dead transitions. [2025-02-06 13:04:59,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 128 transitions, 1063 flow [2025-02-06 13:04:59,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:04:59,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:04:59,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2025-02-06 13:04:59,862 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7307692307692307 [2025-02-06 13:04:59,862 INFO L175 Difference]: Start difference. First operand has 67 places, 60 transitions, 409 flow. Second operand 4 states and 114 transitions. [2025-02-06 13:04:59,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 128 transitions, 1063 flow [2025-02-06 13:04:59,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 128 transitions, 1002 flow, removed 12 selfloop flow, removed 5 redundant places. [2025-02-06 13:04:59,886 INFO L231 Difference]: Finished difference. Result has 67 places, 68 transitions, 503 flow [2025-02-06 13:04:59,887 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=503, PETRI_PLACES=67, PETRI_TRANSITIONS=68} [2025-02-06 13:04:59,887 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 26 predicate places. [2025-02-06 13:04:59,887 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 68 transitions, 503 flow [2025-02-06 13:04:59,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 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-02-06 13:04:59,888 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:04:59,888 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-02-06 13:04:59,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 13:05:00,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:05:00,093 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 13:05:00,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:05:00,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1146223652, now seen corresponding path program 1 times [2025-02-06 13:05:00,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:05:00,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489858182] [2025-02-06 13:05:00,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:05:00,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:05:00,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 13:05:00,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 13:05:00,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:05:00,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:05:00,257 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:05:00,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:05:00,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489858182] [2025-02-06 13:05:00,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489858182] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:05:00,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467540528] [2025-02-06 13:05:00,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:05:00,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:05:00,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:05:00,260 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-02-06 13:05:00,261 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-02-06 13:05:00,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 13:05:00,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 13:05:00,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:05:00,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:05:00,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 13:05:00,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:05:00,346 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:05:00,347 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:05:00,372 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:05:00,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467540528] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:05:00,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:05:00,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 3] total 4 [2025-02-06 13:05:00,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851154531] [2025-02-06 13:05:00,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:05:00,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:05:00,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:05:00,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:05:00,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:05:00,373 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-02-06 13:05:00,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 68 transitions, 503 flow. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 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-02-06 13:05:00,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:05:00,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-02-06 13:05:00,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:05:02,018 INFO L124 PetriNetUnfolderBase]: 21510/31535 cut-off events. [2025-02-06 13:05:02,018 INFO L125 PetriNetUnfolderBase]: For 83002/83002 co-relation queries the response was YES. [2025-02-06 13:05:02,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101117 conditions, 31535 events. 21510/31535 cut-off events. For 83002/83002 co-relation queries the response was YES. Maximal size of possible extension queue 856. Compared 194445 event pairs, 9155 based on Foata normal form. 456/28248 useless extension candidates. Maximal degree in co-relation 90803. Up to 11750 conditions per place. [2025-02-06 13:05:02,198 INFO L140 encePairwiseOnDemand]: 36/39 looper letters, 129 selfloop transitions, 15 changer transitions 1/150 dead transitions. [2025-02-06 13:05:02,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 150 transitions, 1414 flow [2025-02-06 13:05:02,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:05:02,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:05:02,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2025-02-06 13:05:02,199 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7051282051282052 [2025-02-06 13:05:02,199 INFO L175 Difference]: Start difference. First operand has 67 places, 68 transitions, 503 flow. Second operand 4 states and 110 transitions. [2025-02-06 13:05:02,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 150 transitions, 1414 flow [2025-02-06 13:05:02,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 150 transitions, 1382 flow, removed 16 selfloop flow, removed 0 redundant places. [2025-02-06 13:05:02,283 INFO L231 Difference]: Finished difference. Result has 72 places, 79 transitions, 681 flow [2025-02-06 13:05:02,283 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=681, PETRI_PLACES=72, PETRI_TRANSITIONS=79} [2025-02-06 13:05:02,284 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 31 predicate places. [2025-02-06 13:05:02,284 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 79 transitions, 681 flow [2025-02-06 13:05:02,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 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-02-06 13:05:02,284 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:05:02,284 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-02-06 13:05:02,294 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-02-06 13:05:02,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:05:02,484 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 13:05:02,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:05:02,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1088606630, now seen corresponding path program 6 times [2025-02-06 13:05:02,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:05:02,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924536402] [2025-02-06 13:05:02,485 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 13:05:02,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:05:02,492 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 37 statements into 4 equivalence classes. [2025-02-06 13:05:02,519 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 13:05:02,519 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-02-06 13:05:02,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:05:02,711 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 13:05:02,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:05:02,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924536402] [2025-02-06 13:05:02,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924536402] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:05:02,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986996896] [2025-02-06 13:05:02,712 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 13:05:02,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:05:02,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:05:02,716 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-02-06 13:05:02,718 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-02-06 13:05:02,758 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 37 statements into 4 equivalence classes. [2025-02-06 13:05:02,777 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 13:05:02,777 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-02-06 13:05:02,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:05:02,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-06 13:05:02,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:05:02,957 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:05:02,957 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:05:03,128 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:05:03,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986996896] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:05:03,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:05:03,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 9] total 19 [2025-02-06 13:05:03,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308539972] [2025-02-06 13:05:03,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:05:03,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-06 13:05:03,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:05:03,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-06 13:05:03,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2025-02-06 13:05:03,130 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-02-06 13:05:03,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 79 transitions, 681 flow. Second operand has 20 states, 20 states have (on average 12.6) internal successors, (252), 20 states have internal predecessors, (252), 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-02-06 13:05:03,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:05:03,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-02-06 13:05:03,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:05:09,751 INFO L124 PetriNetUnfolderBase]: 67694/97674 cut-off events. [2025-02-06 13:05:09,751 INFO L125 PetriNetUnfolderBase]: For 328558/328558 co-relation queries the response was YES. [2025-02-06 13:05:09,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 324159 conditions, 97674 events. 67694/97674 cut-off events. For 328558/328558 co-relation queries the response was YES. Maximal size of possible extension queue 2617. Compared 669306 event pairs, 5674 based on Foata normal form. 2576/88101 useless extension candidates. Maximal degree in co-relation 215023. Up to 19243 conditions per place. [2025-02-06 13:05:10,180 INFO L140 encePairwiseOnDemand]: 23/39 looper letters, 548 selfloop transitions, 314 changer transitions 61/928 dead transitions. [2025-02-06 13:05:10,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 928 transitions, 8256 flow [2025-02-06 13:05:10,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2025-02-06 13:05:10,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2025-02-06 13:05:10,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 1147 transitions. [2025-02-06 13:05:10,183 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5446343779677113 [2025-02-06 13:05:10,183 INFO L175 Difference]: Start difference. First operand has 72 places, 79 transitions, 681 flow. Second operand 54 states and 1147 transitions. [2025-02-06 13:05:10,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 928 transitions, 8256 flow [2025-02-06 13:05:10,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 928 transitions, 8016 flow, removed 120 selfloop flow, removed 0 redundant places. [2025-02-06 13:05:10,373 INFO L231 Difference]: Finished difference. Result has 168 places, 384 transitions, 5314 flow [2025-02-06 13:05:10,374 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=661, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=54, PETRI_FLOW=5314, PETRI_PLACES=168, PETRI_TRANSITIONS=384} [2025-02-06 13:05:10,374 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 127 predicate places. [2025-02-06 13:05:10,374 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 384 transitions, 5314 flow [2025-02-06 13:05:10,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 12.6) internal successors, (252), 20 states have internal predecessors, (252), 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-02-06 13:05:10,374 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:05:10,374 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-02-06 13:05:10,380 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-02-06 13:05:10,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:05:10,575 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 13:05:10,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:05:10,575 INFO L85 PathProgramCache]: Analyzing trace with hash 397708403, now seen corresponding path program 7 times [2025-02-06 13:05:10,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:05:10,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85126153] [2025-02-06 13:05:10,576 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 13:05:10,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:05:10,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-06 13:05:10,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-06 13:05:10,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:05:10,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:05:10,646 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 13:05:10,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:05:10,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85126153] [2025-02-06 13:05:10,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85126153] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:05:10,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334599606] [2025-02-06 13:05:10,648 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 13:05:10,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:05:10,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:05:10,650 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-02-06 13:05:10,651 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-02-06 13:05:10,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-06 13:05:10,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-06 13:05:10,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:05:10,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:05:10,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 13:05:10,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:05:10,737 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 13:05:10,738 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:05:10,775 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 13:05:10,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334599606] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:05:10,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:05:10,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 5 [2025-02-06 13:05:10,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328310997] [2025-02-06 13:05:10,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:05:10,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 13:05:10,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:05:10,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 13:05:10,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 13:05:10,777 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-02-06 13:05:10,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 384 transitions, 5314 flow. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 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-02-06 13:05:10,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:05:10,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-02-06 13:05:10,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:05:25,447 INFO L124 PetriNetUnfolderBase]: 77312/113391 cut-off events. [2025-02-06 13:05:25,447 INFO L125 PetriNetUnfolderBase]: For 2119890/2119890 co-relation queries the response was YES. [2025-02-06 13:05:26,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 723163 conditions, 113391 events. 77312/113391 cut-off events. For 2119890/2119890 co-relation queries the response was YES. Maximal size of possible extension queue 2154. Compared 788225 event pairs, 25333 based on Foata normal form. 814/100870 useless extension candidates. Maximal degree in co-relation 714740. Up to 31530 conditions per place. [2025-02-06 13:05:27,077 INFO L140 encePairwiseOnDemand]: 36/39 looper letters, 843 selfloop transitions, 153 changer transitions 8/1009 dead transitions. [2025-02-06 13:05:27,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 1009 transitions, 15711 flow [2025-02-06 13:05:27,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:05:27,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 13:05:27,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 148 transitions. [2025-02-06 13:05:27,078 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7589743589743589 [2025-02-06 13:05:27,078 INFO L175 Difference]: Start difference. First operand has 168 places, 384 transitions, 5314 flow. Second operand 5 states and 148 transitions. [2025-02-06 13:05:27,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 1009 transitions, 15711 flow [2025-02-06 13:05:37,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 1009 transitions, 13606 flow, removed 985 selfloop flow, removed 5 redundant places. [2025-02-06 13:05:37,018 INFO L231 Difference]: Finished difference. Result has 170 places, 471 transitions, 6507 flow [2025-02-06 13:05:37,018 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=4554, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6507, PETRI_PLACES=170, PETRI_TRANSITIONS=471} [2025-02-06 13:05:37,018 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 129 predicate places. [2025-02-06 13:05:37,018 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 471 transitions, 6507 flow [2025-02-06 13:05:37,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 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-02-06 13:05:37,019 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:05:37,019 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-02-06 13:05:37,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 13:05:37,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-06 13:05:37,219 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 13:05:37,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:05:37,220 INFO L85 PathProgramCache]: Analyzing trace with hash 301852592, now seen corresponding path program 2 times [2025-02-06 13:05:37,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:05:37,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193107507] [2025-02-06 13:05:37,220 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:05:37,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:05:37,224 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-02-06 13:05:37,237 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-02-06 13:05:37,237 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:05:37,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:05:37,301 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 13:05:37,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:05:37,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193107507] [2025-02-06 13:05:37,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193107507] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:05:37,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252332926] [2025-02-06 13:05:37,302 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:05:37,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:05:37,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:05:37,304 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:05:37,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 13:05:37,344 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-02-06 13:05:37,363 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-02-06 13:05:37,363 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:05:37,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:05:37,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 13:05:37,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:05:37,534 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 13:05:37,534 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:05:37,574 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 13:05:37,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252332926] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:05:37,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:05:37,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 5 [2025-02-06 13:05:37,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344531658] [2025-02-06 13:05:37,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:05:37,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 13:05:37,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:05:37,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 13:05:37,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 13:05:37,575 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-02-06 13:05:37,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 471 transitions, 6507 flow. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 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-02-06 13:05:37,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:05:37,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-02-06 13:05:37,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand