./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/chl-nzb-file-symm.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/chl-nzb-file-symm.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 48ddce9ee02b3ea4431cf137593b71facb450c3e223dbff4f116c3c0ac1377b5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 13:02:30,771 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 13:02:30,828 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:02:30,833 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 13:02:30,834 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 13:02:30,848 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 13:02:30,849 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 13:02:30,849 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 13:02:30,849 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 13:02:30,849 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 13:02:30,849 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 13:02:30,849 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 13:02:30,850 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 13:02:30,850 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 13:02:30,850 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 13:02:30,850 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 13:02:30,850 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 13:02:30,850 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 13:02:30,850 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 13:02:30,850 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 13:02:30,850 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 13:02:30,850 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 13:02:30,850 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 13:02:30,851 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 13:02:30,851 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 13:02:30,851 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 13:02:30,851 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 13:02:30,851 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 13:02:30,851 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 13:02:30,851 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 13:02:30,851 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 13:02:30,851 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 13:02:30,851 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 13:02:30,851 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:02:30,851 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 13:02:30,852 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 13:02:30,852 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 13:02:30,852 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 13:02:30,852 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 13:02:30,852 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 13:02:30,852 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 13:02:30,852 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 13:02:30,852 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 -> 48ddce9ee02b3ea4431cf137593b71facb450c3e223dbff4f116c3c0ac1377b5 [2025-02-06 13:02:31,196 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 13:02:31,206 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 13:02:31,208 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 13:02:31,208 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 13:02:31,210 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 13:02:31,211 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-nzb-file-symm.wvr.c [2025-02-06 13:02:32,341 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f88a5a86c/2a2843b65ae849848c826ce78658958b/FLAGc19ef8fdd [2025-02-06 13:02:32,617 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 13:02:32,618 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-nzb-file-symm.wvr.c [2025-02-06 13:02:32,627 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f88a5a86c/2a2843b65ae849848c826ce78658958b/FLAGc19ef8fdd [2025-02-06 13:02:32,643 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f88a5a86c/2a2843b65ae849848c826ce78658958b [2025-02-06 13:02:32,645 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 13:02:32,646 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 13:02:32,647 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 13:02:32,647 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 13:02:32,650 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 13:02:32,651 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:02:32" (1/1) ... [2025-02-06 13:02:32,651 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48dace18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:02:32, skipping insertion in model container [2025-02-06 13:02:32,651 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:02:32" (1/1) ... [2025-02-06 13:02:32,667 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 13:02:32,810 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 13:02:32,812 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:02:32,817 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 13:02:32,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:02:32,851 INFO L204 MainTranslator]: Completed translation [2025-02-06 13:02:32,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:02:32 WrapperNode [2025-02-06 13:02:32,851 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 13:02:32,852 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 13:02:32,852 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 13:02:32,853 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 13:02:32,857 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:02:32" (1/1) ... [2025-02-06 13:02:32,868 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:02:32" (1/1) ... [2025-02-06 13:02:32,892 INFO L138 Inliner]: procedures = 24, calls = 46, calls flagged for inlining = 22, calls inlined = 30, statements flattened = 401 [2025-02-06 13:02:32,893 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 13:02:32,894 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 13:02:32,894 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 13:02:32,894 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 13:02:32,901 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:02:32" (1/1) ... [2025-02-06 13:02:32,901 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:02:32" (1/1) ... [2025-02-06 13:02:32,904 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:02:32" (1/1) ... [2025-02-06 13:02:32,926 INFO L175 MemorySlicer]: Split 20 memory accesses to 2 slices as follows [2, 18]. 90 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-02-06 13:02:32,926 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:02:32" (1/1) ... [2025-02-06 13:02:32,926 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:02:32" (1/1) ... [2025-02-06 13:02:32,934 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:02:32" (1/1) ... [2025-02-06 13:02:32,935 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:02:32" (1/1) ... [2025-02-06 13:02:32,937 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:02:32" (1/1) ... [2025-02-06 13:02:32,938 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:02:32" (1/1) ... [2025-02-06 13:02:32,942 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 13:02:32,943 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 13:02:32,943 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 13:02:32,943 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 13:02:32,947 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:02:32" (1/1) ... [2025-02-06 13:02:32,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:02:32,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:02:32,972 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:02:32,976 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:02:32,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 13:02:32,991 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 13:02:32,991 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 13:02:32,991 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 13:02:32,991 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 13:02:32,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 13:02:32,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 13:02:32,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 13:02:32,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 13:02:32,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 13:02:32,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 13:02:32,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 13:02:32,991 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 13:02:32,991 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 13:02:32,992 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:02:33,076 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 13:02:33,078 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 13:02:33,607 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 13:02:33,607 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 13:02:33,870 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 13:02:33,870 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 13:02:33,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:02:33 BoogieIcfgContainer [2025-02-06 13:02:33,871 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 13:02:33,872 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 13:02:33,872 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 13:02:33,875 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 13:02:33,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:02:32" (1/3) ... [2025-02-06 13:02:33,876 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bd27ed0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:02:33, skipping insertion in model container [2025-02-06 13:02:33,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:02:32" (2/3) ... [2025-02-06 13:02:33,876 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bd27ed0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:02:33, skipping insertion in model container [2025-02-06 13:02:33,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:02:33" (3/3) ... [2025-02-06 13:02:33,880 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-nzb-file-symm.wvr.c [2025-02-06 13:02:33,890 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 13:02:33,891 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-nzb-file-symm.wvr.c that has 3 procedures, 107 locations, 1 initial locations, 4 loop locations, and 38 error locations. [2025-02-06 13:02:33,891 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 13:02:33,976 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 13:02:33,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 126 transitions, 266 flow [2025-02-06 13:02:34,029 INFO L124 PetriNetUnfolderBase]: 20/124 cut-off events. [2025-02-06 13:02:34,030 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 13:02:34,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 124 events. 20/124 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 393 event pairs, 0 based on Foata normal form. 0/66 useless extension candidates. Maximal degree in co-relation 107. Up to 2 conditions per place. [2025-02-06 13:02:34,034 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 126 transitions, 266 flow [2025-02-06 13:02:34,041 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 123 transitions, 258 flow [2025-02-06 13:02:34,046 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 13:02:34,056 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;@1e2ef9e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 13:02:34,056 INFO L334 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2025-02-06 13:02:34,060 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 13:02:34,060 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-02-06 13:02:34,060 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 13:02:34,061 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:02:34,061 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 13:02:34,061 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-02-06 13:02:34,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:02:34,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1169888, now seen corresponding path program 1 times [2025-02-06 13:02:34,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:02:34,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942844572] [2025-02-06 13:02:34,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:02:34,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:02:34,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 13:02:34,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 13:02:34,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:02:34,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:02:34,219 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:02:34,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:02:34,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942844572] [2025-02-06 13:02:34,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942844572] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:02:34,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:02:34,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 13:02:34,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226785774] [2025-02-06 13:02:34,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:02:34,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:02:34,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:02:34,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:02:34,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:02:34,272 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 126 [2025-02-06 13:02:34,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 123 transitions, 258 flow. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 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:02:34,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:02:34,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 126 [2025-02-06 13:02:34,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:02:34,652 INFO L124 PetriNetUnfolderBase]: 1446/3461 cut-off events. [2025-02-06 13:02:34,652 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2025-02-06 13:02:34,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5601 conditions, 3461 events. 1446/3461 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 25166 event pairs, 790 based on Foata normal form. 1/2625 useless extension candidates. Maximal degree in co-relation 5456. Up to 2083 conditions per place. [2025-02-06 13:02:34,668 INFO L140 encePairwiseOnDemand]: 119/126 looper letters, 56 selfloop transitions, 2 changer transitions 0/117 dead transitions. [2025-02-06 13:02:34,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 117 transitions, 362 flow [2025-02-06 13:02:34,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:02:34,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:02:34,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 249 transitions. [2025-02-06 13:02:34,676 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6587301587301587 [2025-02-06 13:02:34,677 INFO L175 Difference]: Start difference. First operand has 110 places, 123 transitions, 258 flow. Second operand 3 states and 249 transitions. [2025-02-06 13:02:34,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 117 transitions, 362 flow [2025-02-06 13:02:34,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 117 transitions, 354 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 13:02:34,682 INFO L231 Difference]: Finished difference. Result has 104 places, 117 transitions, 242 flow [2025-02-06 13:02:34,684 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=242, PETRI_PLACES=104, PETRI_TRANSITIONS=117} [2025-02-06 13:02:34,686 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, -6 predicate places. [2025-02-06 13:02:34,686 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 117 transitions, 242 flow [2025-02-06 13:02:34,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 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:02:34,686 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:02:34,686 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 13:02:34,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 13:02:34,687 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-02-06 13:02:34,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:02:34,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1169889, now seen corresponding path program 1 times [2025-02-06 13:02:34,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:02:34,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188839051] [2025-02-06 13:02:34,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:02:34,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:02:34,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 13:02:34,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 13:02:34,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:02:34,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:02:34,913 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:02:34,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:02:34,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188839051] [2025-02-06 13:02:34,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188839051] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:02:34,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:02:34,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:02:34,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577848542] [2025-02-06 13:02:34,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:02:34,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:02:34,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:02:34,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:02:34,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:02:34,967 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 126 [2025-02-06 13:02:34,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 117 transitions, 242 flow. Second operand has 4 states, 4 states have (on average 62.75) internal successors, (251), 4 states have internal predecessors, (251), 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:02:34,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:02:34,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 126 [2025-02-06 13:02:34,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:02:35,328 INFO L124 PetriNetUnfolderBase]: 1448/3467 cut-off events. [2025-02-06 13:02:35,329 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-02-06 13:02:35,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5585 conditions, 3467 events. 1448/3467 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 25234 event pairs, 790 based on Foata normal form. 0/2628 useless extension candidates. Maximal degree in co-relation 5549. Up to 2092 conditions per place. [2025-02-06 13:02:35,348 INFO L140 encePairwiseOnDemand]: 119/126 looper letters, 61 selfloop transitions, 5 changer transitions 0/123 dead transitions. [2025-02-06 13:02:35,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 123 transitions, 388 flow [2025-02-06 13:02:35,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:02:35,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:02:35,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 254 transitions. [2025-02-06 13:02:35,352 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.671957671957672 [2025-02-06 13:02:35,353 INFO L175 Difference]: Start difference. First operand has 104 places, 117 transitions, 242 flow. Second operand 3 states and 254 transitions. [2025-02-06 13:02:35,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 123 transitions, 388 flow [2025-02-06 13:02:35,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 123 transitions, 382 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:02:35,355 INFO L231 Difference]: Finished difference. Result has 106 places, 121 transitions, 278 flow [2025-02-06 13:02:35,355 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=278, PETRI_PLACES=106, PETRI_TRANSITIONS=121} [2025-02-06 13:02:35,356 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, -4 predicate places. [2025-02-06 13:02:35,356 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 121 transitions, 278 flow [2025-02-06 13:02:35,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.75) internal successors, (251), 4 states have internal predecessors, (251), 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:02:35,356 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:02:35,356 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-02-06 13:02:35,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 13:02:35,357 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-02-06 13:02:35,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:02:35,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1124298277, now seen corresponding path program 1 times [2025-02-06 13:02:35,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:02:35,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978016744] [2025-02-06 13:02:35,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:02:35,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:02:35,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 13:02:35,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 13:02:35,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:02:35,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:02:35,663 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:02:35,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:02:35,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978016744] [2025-02-06 13:02:35,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978016744] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:02:35,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348539256] [2025-02-06 13:02:35,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:02:35,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:02:35,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:02:35,667 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:02:35,668 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:02:35,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 13:02:35,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 13:02:35,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:02:35,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:02:35,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 13:02:35,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:02:35,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 13:02:35,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:02:35,842 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:02:35,894 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:02:35,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348539256] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:02:35,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:02:35,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 2] total 7 [2025-02-06 13:02:35,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559173120] [2025-02-06 13:02:35,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:02:35,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 13:02:35,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:02:35,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 13:02:35,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-02-06 13:02:36,090 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 126 [2025-02-06 13:02:36,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 121 transitions, 278 flow. Second operand has 9 states, 9 states have (on average 63.666666666666664) internal successors, (573), 9 states have internal predecessors, (573), 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:02:36,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:02:36,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 126 [2025-02-06 13:02:36,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:02:36,529 INFO L124 PetriNetUnfolderBase]: 1450/3481 cut-off events. [2025-02-06 13:02:36,530 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-02-06 13:02:36,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5636 conditions, 3481 events. 1450/3481 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 25245 event pairs, 790 based on Foata normal form. 4/2648 useless extension candidates. Maximal degree in co-relation 5581. Up to 2093 conditions per place. [2025-02-06 13:02:36,541 INFO L140 encePairwiseOnDemand]: 119/126 looper letters, 66 selfloop transitions, 14 changer transitions 0/137 dead transitions. [2025-02-06 13:02:36,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 137 transitions, 488 flow [2025-02-06 13:02:36,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:02:36,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 13:02:36,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 462 transitions. [2025-02-06 13:02:36,542 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2025-02-06 13:02:36,542 INFO L175 Difference]: Start difference. First operand has 106 places, 121 transitions, 278 flow. Second operand 6 states and 462 transitions. [2025-02-06 13:02:36,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 137 transitions, 488 flow [2025-02-06 13:02:36,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 137 transitions, 476 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:02:36,545 INFO L231 Difference]: Finished difference. Result has 112 places, 129 transitions, 362 flow [2025-02-06 13:02:36,545 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=362, PETRI_PLACES=112, PETRI_TRANSITIONS=129} [2025-02-06 13:02:36,545 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 2 predicate places. [2025-02-06 13:02:36,546 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 129 transitions, 362 flow [2025-02-06 13:02:36,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 63.666666666666664) internal successors, (573), 9 states have internal predecessors, (573), 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:02:36,546 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:02:36,546 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1] [2025-02-06 13:02:36,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 13:02:36,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:02:36,749 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-02-06 13:02:36,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:02:36,750 INFO L85 PathProgramCache]: Analyzing trace with hash -851368719, now seen corresponding path program 2 times [2025-02-06 13:02:36,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:02:36,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930404339] [2025-02-06 13:02:36,750 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:02:36,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:02:36,758 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-02-06 13:02:36,773 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 13:02:36,774 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:02:36,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:02:37,029 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:02:37,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:02:37,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930404339] [2025-02-06 13:02:37,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930404339] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:02:37,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079478368] [2025-02-06 13:02:37,029 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:02:37,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:02:37,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:02:37,031 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:02:37,033 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:02:37,087 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-02-06 13:02:37,116 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 13:02:37,116 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:02:37,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:02:37,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 13:02:37,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:02:37,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 13:02:37,221 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:02:37,221 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:02:37,322 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:02:37,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079478368] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:02:37,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:02:37,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2025-02-06 13:02:37,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672009144] [2025-02-06 13:02:37,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:02:37,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 13:02:37,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:02:37,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 13:02:37,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2025-02-06 13:02:38,020 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 126 [2025-02-06 13:02:38,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 129 transitions, 362 flow. Second operand has 18 states, 18 states have (on average 63.833333333333336) internal successors, (1149), 18 states have internal predecessors, (1149), 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:02:38,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:02:38,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 126 [2025-02-06 13:02:38,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:02:38,581 INFO L124 PetriNetUnfolderBase]: 1452/3485 cut-off events. [2025-02-06 13:02:38,582 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2025-02-06 13:02:38,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5674 conditions, 3485 events. 1452/3485 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 25280 event pairs, 790 based on Foata normal form. 4/2654 useless extension candidates. Maximal degree in co-relation 5593. Up to 2086 conditions per place. [2025-02-06 13:02:38,592 INFO L140 encePairwiseOnDemand]: 117/126 looper letters, 61 selfloop transitions, 23 changer transitions 0/141 dead transitions. [2025-02-06 13:02:38,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 141 transitions, 554 flow [2025-02-06 13:02:38,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 13:02:38,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 13:02:38,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 646 transitions. [2025-02-06 13:02:38,595 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5696649029982364 [2025-02-06 13:02:38,595 INFO L175 Difference]: Start difference. First operand has 112 places, 129 transitions, 362 flow. Second operand 9 states and 646 transitions. [2025-02-06 13:02:38,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 141 transitions, 554 flow [2025-02-06 13:02:38,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 141 transitions, 496 flow, removed 14 selfloop flow, removed 5 redundant places. [2025-02-06 13:02:38,599 INFO L231 Difference]: Finished difference. Result has 114 places, 133 transitions, 370 flow [2025-02-06 13:02:38,599 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=370, PETRI_PLACES=114, PETRI_TRANSITIONS=133} [2025-02-06 13:02:38,600 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 4 predicate places. [2025-02-06 13:02:38,600 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 133 transitions, 370 flow [2025-02-06 13:02:38,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 63.833333333333336) internal successors, (1149), 18 states have internal predecessors, (1149), 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:02:38,601 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:02:38,601 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:02:38,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 13:02:38,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:02:38,802 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-02-06 13:02:38,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:02:38,803 INFO L85 PathProgramCache]: Analyzing trace with hash 551373356, now seen corresponding path program 1 times [2025-02-06 13:02:38,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:02:38,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276749282] [2025-02-06 13:02:38,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:02:38,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:02:38,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 13:02:38,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 13:02:38,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:02:38,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:02:38,891 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 13:02:38,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:02:38,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276749282] [2025-02-06 13:02:38,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276749282] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:02:38,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528502430] [2025-02-06 13:02:38,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:02:38,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:02:38,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:02:38,895 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:02:38,899 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:02:38,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 13:02:38,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 13:02:38,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:02:38,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:02:38,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 13:02:38,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:02:39,039 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 13:02:39,039 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:02:39,057 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 13:02:39,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528502430] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:02:39,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:02:39,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-02-06 13:02:39,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566281064] [2025-02-06 13:02:39,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:02:39,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 13:02:39,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:02:39,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 13:02:39,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=46, Unknown=0, NotChecked=0, Total=90 [2025-02-06 13:02:39,073 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 126 [2025-02-06 13:02:39,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 133 transitions, 370 flow. Second operand has 10 states, 10 states have (on average 66.6) internal successors, (666), 10 states have internal predecessors, (666), 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:02:39,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:02:39,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 126 [2025-02-06 13:02:39,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:02:39,358 INFO L124 PetriNetUnfolderBase]: 1446/3479 cut-off events. [2025-02-06 13:02:39,358 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-02-06 13:02:39,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5654 conditions, 3479 events. 1446/3479 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 25177 event pairs, 790 based on Foata normal form. 6/2650 useless extension candidates. Maximal degree in co-relation 5549. Up to 2087 conditions per place. [2025-02-06 13:02:39,369 INFO L140 encePairwiseOnDemand]: 119/126 looper letters, 62 selfloop transitions, 16 changer transitions 0/135 dead transitions. [2025-02-06 13:02:39,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 135 transitions, 522 flow [2025-02-06 13:02:39,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 13:02:39,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 13:02:39,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 530 transitions. [2025-02-06 13:02:39,370 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6009070294784581 [2025-02-06 13:02:39,370 INFO L175 Difference]: Start difference. First operand has 114 places, 133 transitions, 370 flow. Second operand 7 states and 530 transitions. [2025-02-06 13:02:39,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 135 transitions, 522 flow [2025-02-06 13:02:39,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 135 transitions, 490 flow, removed 5 selfloop flow, removed 6 redundant places. [2025-02-06 13:02:39,372 INFO L231 Difference]: Finished difference. Result has 114 places, 127 transitions, 334 flow [2025-02-06 13:02:39,372 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=334, PETRI_PLACES=114, PETRI_TRANSITIONS=127} [2025-02-06 13:02:39,373 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 4 predicate places. [2025-02-06 13:02:39,373 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 127 transitions, 334 flow [2025-02-06 13:02:39,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 66.6) internal successors, (666), 10 states have internal predecessors, (666), 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:02:39,373 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:02:39,373 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:02:39,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 13:02:39,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:02:39,574 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-02-06 13:02:39,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:02:39,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1439896439, now seen corresponding path program 2 times [2025-02-06 13:02:39,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:02:39,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758979652] [2025-02-06 13:02:39,575 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:02:39,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:02:39,583 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-02-06 13:02:39,599 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 29 statements. [2025-02-06 13:02:39,599 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 13:02:39,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:02:39,670 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-06 13:02:39,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:02:39,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758979652] [2025-02-06 13:02:39,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758979652] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:02:39,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:02:39,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:02:39,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502740808] [2025-02-06 13:02:39,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:02:39,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:02:39,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:02:39,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:02:39,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:02:39,712 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 126 [2025-02-06 13:02:39,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 127 transitions, 334 flow. Second operand has 4 states, 4 states have (on average 57.25) internal successors, (229), 4 states have internal predecessors, (229), 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:02:39,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:02:39,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 126 [2025-02-06 13:02:39,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:02:39,969 INFO L124 PetriNetUnfolderBase]: 1446/3291 cut-off events. [2025-02-06 13:02:39,970 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-02-06 13:02:39,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5465 conditions, 3291 events. 1446/3291 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 22580 event pairs, 790 based on Foata normal form. 0/2643 useless extension candidates. Maximal degree in co-relation 5364. Up to 2082 conditions per place. [2025-02-06 13:02:39,978 INFO L140 encePairwiseOnDemand]: 115/126 looper letters, 67 selfloop transitions, 3 changer transitions 0/119 dead transitions. [2025-02-06 13:02:39,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 119 transitions, 458 flow [2025-02-06 13:02:39,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:02:39,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 13:02:39,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 336 transitions. [2025-02-06 13:02:39,980 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-02-06 13:02:39,980 INFO L175 Difference]: Start difference. First operand has 114 places, 127 transitions, 334 flow. Second operand 5 states and 336 transitions. [2025-02-06 13:02:39,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 119 transitions, 458 flow [2025-02-06 13:02:39,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 119 transitions, 426 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-06 13:02:39,981 INFO L231 Difference]: Finished difference. Result has 104 places, 119 transitions, 292 flow [2025-02-06 13:02:39,982 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=292, PETRI_PLACES=104, PETRI_TRANSITIONS=119} [2025-02-06 13:02:39,982 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, -6 predicate places. [2025-02-06 13:02:39,982 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 119 transitions, 292 flow [2025-02-06 13:02:39,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.25) internal successors, (229), 4 states have internal predecessors, (229), 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:02:39,982 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:02:39,982 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:02:39,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 13:02:39,983 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-02-06 13:02:39,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:02:39,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1439896440, now seen corresponding path program 1 times [2025-02-06 13:02:39,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:02:39,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587885377] [2025-02-06 13:02:39,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:02:39,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:02:39,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 13:02:40,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 13:02:40,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:02:40,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:02:40,401 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-06 13:02:40,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:02:40,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587885377] [2025-02-06 13:02:40,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587885377] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:02:40,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720673336] [2025-02-06 13:02:40,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:02:40,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:02:40,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:02:40,405 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:02:40,407 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:02:40,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 13:02:40,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 13:02:40,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:02:40,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:02:40,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-02-06 13:02:40,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:02:40,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 13:02:40,635 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-06 13:02:40,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-02-06 13:02:40,881 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:02:40,881 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:02:41,184 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-06 13:02:41,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720673336] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 13:02:41,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 13:02:41,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [6, 12] total 26 [2025-02-06 13:02:41,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64856290] [2025-02-06 13:02:41,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:02:41,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 13:02:41,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:02:41,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 13:02:41,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=570, Unknown=0, NotChecked=0, Total=756 [2025-02-06 13:02:41,492 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 126 [2025-02-06 13:02:41,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 119 transitions, 292 flow. Second operand has 10 states, 10 states have (on average 62.1) internal successors, (621), 10 states have internal predecessors, (621), 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:02:41,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:02:41,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 126 [2025-02-06 13:02:41,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:02:41,888 INFO L124 PetriNetUnfolderBase]: 2117/4066 cut-off events. [2025-02-06 13:02:41,888 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-06 13:02:41,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7288 conditions, 4066 events. 2117/4066 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 25131 event pairs, 598 based on Foata normal form. 0/3381 useless extension candidates. Maximal degree in co-relation 7197. Up to 2114 conditions per place. [2025-02-06 13:02:41,898 INFO L140 encePairwiseOnDemand]: 116/126 looper letters, 99 selfloop transitions, 6 changer transitions 0/150 dead transitions. [2025-02-06 13:02:41,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 150 transitions, 567 flow [2025-02-06 13:02:41,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:02:41,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 13:02:41,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 457 transitions. [2025-02-06 13:02:41,900 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6044973544973545 [2025-02-06 13:02:41,900 INFO L175 Difference]: Start difference. First operand has 104 places, 119 transitions, 292 flow. Second operand 6 states and 457 transitions. [2025-02-06 13:02:41,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 150 transitions, 567 flow [2025-02-06 13:02:41,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 150 transitions, 562 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 13:02:41,903 INFO L231 Difference]: Finished difference. Result has 105 places, 117 transitions, 306 flow [2025-02-06 13:02:41,904 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=306, PETRI_PLACES=105, PETRI_TRANSITIONS=117} [2025-02-06 13:02:41,904 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, -5 predicate places. [2025-02-06 13:02:41,904 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 117 transitions, 306 flow [2025-02-06 13:02:41,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 62.1) internal successors, (621), 10 states have internal predecessors, (621), 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:02:41,905 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:02:41,905 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:02:41,912 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:02:42,106 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,SelfDestructingSolverStorable6 [2025-02-06 13:02:42,106 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-02-06 13:02:42,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:02:42,107 INFO L85 PathProgramCache]: Analyzing trace with hash 614949009, now seen corresponding path program 1 times [2025-02-06 13:02:42,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:02:42,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448794330] [2025-02-06 13:02:42,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:02:42,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:02:42,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 13:02:42,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 13:02:42,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:02:42,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:02:42,352 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-02-06 13:02:42,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:02:42,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448794330] [2025-02-06 13:02:42,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448794330] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:02:42,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191923152] [2025-02-06 13:02:42,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:02:42,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:02:42,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:02:42,354 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:02:42,356 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:02:42,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 13:02:42,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 13:02:42,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:02:42,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:02:42,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 13:02:42,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:02:42,561 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-06 13:02:42,562 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:02:42,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2025-02-06 13:02:42,725 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-06 13:02:42,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191923152] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:02:42,726 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:02:42,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 21 [2025-02-06 13:02:42,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292122399] [2025-02-06 13:02:42,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:02:42,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-06 13:02:42,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:02:42,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-06 13:02:42,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2025-02-06 13:02:43,601 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 126 [2025-02-06 13:02:43,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 117 transitions, 306 flow. Second operand has 22 states, 22 states have (on average 62.59090909090909) internal successors, (1377), 22 states have internal predecessors, (1377), 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:02:43,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:02:43,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 126 [2025-02-06 13:02:43,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:02:44,679 INFO L124 PetriNetUnfolderBase]: 4185/8570 cut-off events. [2025-02-06 13:02:44,680 INFO L125 PetriNetUnfolderBase]: For 964/1022 co-relation queries the response was YES. [2025-02-06 13:02:44,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15518 conditions, 8570 events. 4185/8570 cut-off events. For 964/1022 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 59650 event pairs, 768 based on Foata normal form. 0/7428 useless extension candidates. Maximal degree in co-relation 15424. Up to 2462 conditions per place. [2025-02-06 13:02:44,703 INFO L140 encePairwiseOnDemand]: 114/126 looper letters, 144 selfloop transitions, 15 changer transitions 0/201 dead transitions. [2025-02-06 13:02:44,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 201 transitions, 840 flow [2025-02-06 13:02:44,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 13:02:44,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 13:02:44,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 760 transitions. [2025-02-06 13:02:44,706 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6031746031746031 [2025-02-06 13:02:44,706 INFO L175 Difference]: Start difference. First operand has 105 places, 117 transitions, 306 flow. Second operand 10 states and 760 transitions. [2025-02-06 13:02:44,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 201 transitions, 840 flow [2025-02-06 13:02:44,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 201 transitions, 826 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 13:02:44,714 INFO L231 Difference]: Finished difference. Result has 110 places, 116 transitions, 341 flow [2025-02-06 13:02:44,714 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=341, PETRI_PLACES=110, PETRI_TRANSITIONS=116} [2025-02-06 13:02:44,715 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 0 predicate places. [2025-02-06 13:02:44,716 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 116 transitions, 341 flow [2025-02-06 13:02:44,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 62.59090909090909) internal successors, (1377), 22 states have internal predecessors, (1377), 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:02:44,716 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:02:44,717 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:02:44,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 13:02:44,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:02:44,921 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-02-06 13:02:44,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:02:44,922 INFO L85 PathProgramCache]: Analyzing trace with hash 614949008, now seen corresponding path program 1 times [2025-02-06 13:02:44,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:02:44,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542202469] [2025-02-06 13:02:44,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:02:44,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:02:44,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 13:02:44,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 13:02:44,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:02:44,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:02:44,988 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-02-06 13:02:44,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:02:44,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542202469] [2025-02-06 13:02:44,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542202469] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:02:44,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:02:44,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:02:44,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446330740] [2025-02-06 13:02:44,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:02:44,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:02:44,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:02:44,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:02:44,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:02:45,049 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 126 [2025-02-06 13:02:45,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 116 transitions, 341 flow. Second operand has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 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:02:45,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:02:45,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 126 [2025-02-06 13:02:45,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:02:45,665 INFO L124 PetriNetUnfolderBase]: 4097/7958 cut-off events. [2025-02-06 13:02:45,666 INFO L125 PetriNetUnfolderBase]: For 1265/1319 co-relation queries the response was YES. [2025-02-06 13:02:45,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15296 conditions, 7958 events. 4097/7958 cut-off events. For 1265/1319 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 51731 event pairs, 2625 based on Foata normal form. 158/7118 useless extension candidates. Maximal degree in co-relation 15190. Up to 6062 conditions per place. [2025-02-06 13:02:45,689 INFO L140 encePairwiseOnDemand]: 116/126 looper letters, 71 selfloop transitions, 2 changer transitions 0/108 dead transitions. [2025-02-06 13:02:45,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 108 transitions, 471 flow [2025-02-06 13:02:45,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:02:45,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:02:45,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 282 transitions. [2025-02-06 13:02:45,691 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5595238095238095 [2025-02-06 13:02:45,691 INFO L175 Difference]: Start difference. First operand has 110 places, 116 transitions, 341 flow. Second operand 4 states and 282 transitions. [2025-02-06 13:02:45,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 108 transitions, 471 flow [2025-02-06 13:02:45,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 108 transitions, 450 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-06 13:02:45,694 INFO L231 Difference]: Finished difference. Result has 99 places, 108 transitions, 308 flow [2025-02-06 13:02:45,695 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=308, PETRI_PLACES=99, PETRI_TRANSITIONS=108} [2025-02-06 13:02:45,695 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, -11 predicate places. [2025-02-06 13:02:45,695 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 108 transitions, 308 flow [2025-02-06 13:02:45,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 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:02:45,695 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:02:45,696 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:02:45,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 13:02:45,696 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-02-06 13:02:45,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:02:45,696 INFO L85 PathProgramCache]: Analyzing trace with hash 761047900, now seen corresponding path program 1 times [2025-02-06 13:02:45,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:02:45,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396948329] [2025-02-06 13:02:45,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:02:45,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:02:45,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 13:02:45,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 13:02:45,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:02:45,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:02:45,961 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-02-06 13:02:45,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:02:45,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396948329] [2025-02-06 13:02:45,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396948329] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:02:45,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150957499] [2025-02-06 13:02:45,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:02:45,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:02:45,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:02:45,968 INFO L229 MonitoredProcess]: Starting monitored process 7 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:02:45,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 13:02:46,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 13:02:46,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 13:02:46,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:02:46,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:02:46,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 13:02:46,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:02:46,215 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-06 13:02:46,215 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:02:46,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2025-02-06 13:02:46,390 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-06 13:02:46,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150957499] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:02:46,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:02:46,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 21 [2025-02-06 13:02:46,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135714428] [2025-02-06 13:02:46,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:02:46,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-06 13:02:46,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:02:46,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-06 13:02:46,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2025-02-06 13:02:47,261 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 126 [2025-02-06 13:02:47,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 108 transitions, 308 flow. Second operand has 22 states, 22 states have (on average 62.45454545454545) internal successors, (1374), 22 states have internal predecessors, (1374), 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:02:47,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:02:47,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 126 [2025-02-06 13:02:47,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:02:49,049 INFO L124 PetriNetUnfolderBase]: 9460/17539 cut-off events. [2025-02-06 13:02:49,050 INFO L125 PetriNetUnfolderBase]: For 2449/2527 co-relation queries the response was YES. [2025-02-06 13:02:49,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33992 conditions, 17539 events. 9460/17539 cut-off events. For 2449/2527 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 120719 event pairs, 2682 based on Foata normal form. 0/14921 useless extension candidates. Maximal degree in co-relation 33894. Up to 5035 conditions per place. [2025-02-06 13:02:49,111 INFO L140 encePairwiseOnDemand]: 111/126 looper letters, 164 selfloop transitions, 18 changer transitions 0/213 dead transitions. [2025-02-06 13:02:49,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 213 transitions, 949 flow [2025-02-06 13:02:49,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 13:02:49,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 13:02:49,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 780 transitions. [2025-02-06 13:02:49,114 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2025-02-06 13:02:49,114 INFO L175 Difference]: Start difference. First operand has 99 places, 108 transitions, 308 flow. Second operand 10 states and 780 transitions. [2025-02-06 13:02:49,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 213 transitions, 949 flow [2025-02-06 13:02:49,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 213 transitions, 946 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:02:49,120 INFO L231 Difference]: Finished difference. Result has 109 places, 114 transitions, 400 flow [2025-02-06 13:02:49,120 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=400, PETRI_PLACES=109, PETRI_TRANSITIONS=114} [2025-02-06 13:02:49,121 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, -1 predicate places. [2025-02-06 13:02:49,121 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 114 transitions, 400 flow [2025-02-06 13:02:49,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 62.45454545454545) internal successors, (1374), 22 states have internal predecessors, (1374), 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:02:49,121 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:02:49,121 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:02:49,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 13:02:49,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-06 13:02:49,326 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-02-06 13:02:49,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:02:49,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1739449195, now seen corresponding path program 1 times [2025-02-06 13:02:49,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:02:49,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410511436] [2025-02-06 13:02:49,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:02:49,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:02:49,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 13:02:49,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 13:02:49,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:02:49,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:02:49,641 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-02-06 13:02:49,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:02:49,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410511436] [2025-02-06 13:02:49,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410511436] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:02:49,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882378963] [2025-02-06 13:02:49,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:02:49,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:02:49,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:02:49,643 INFO L229 MonitoredProcess]: Starting monitored process 8 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:02:49,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 13:02:49,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 13:02:49,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 13:02:49,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:02:49,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:02:49,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-02-06 13:02:49,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:02:49,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 13:02:49,862 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-06 13:02:49,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-02-06 13:02:50,130 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:02:50,130 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:02:50,403 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-06 13:02:50,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [882378963] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 13:02:50,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 13:02:50,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5, 13] total 26 [2025-02-06 13:02:50,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980181236] [2025-02-06 13:02:50,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:02:50,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 13:02:50,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:02:50,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 13:02:50,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=574, Unknown=0, NotChecked=0, Total=756 [2025-02-06 13:02:50,718 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 126 [2025-02-06 13:02:50,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 114 transitions, 400 flow. Second operand has 10 states, 10 states have (on average 62.4) internal successors, (624), 10 states have internal predecessors, (624), 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:02:50,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:02:50,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 126 [2025-02-06 13:02:50,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:02:52,203 INFO L124 PetriNetUnfolderBase]: 11605/21037 cut-off events. [2025-02-06 13:02:52,203 INFO L125 PetriNetUnfolderBase]: For 7674/8118 co-relation queries the response was YES. [2025-02-06 13:02:52,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43501 conditions, 21037 events. 11605/21037 cut-off events. For 7674/8118 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 147966 event pairs, 4204 based on Foata normal form. 0/17967 useless extension candidates. Maximal degree in co-relation 43390. Up to 8492 conditions per place. [2025-02-06 13:02:52,310 INFO L140 encePairwiseOnDemand]: 113/126 looper letters, 125 selfloop transitions, 10 changer transitions 0/166 dead transitions. [2025-02-06 13:02:52,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 166 transitions, 837 flow [2025-02-06 13:02:52,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:02:52,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 13:02:52,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 471 transitions. [2025-02-06 13:02:52,312 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.623015873015873 [2025-02-06 13:02:52,312 INFO L175 Difference]: Start difference. First operand has 109 places, 114 transitions, 400 flow. Second operand 6 states and 471 transitions. [2025-02-06 13:02:52,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 166 transitions, 837 flow [2025-02-06 13:02:52,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 166 transitions, 816 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-06 13:02:52,321 INFO L231 Difference]: Finished difference. Result has 110 places, 119 transitions, 446 flow [2025-02-06 13:02:52,321 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=446, PETRI_PLACES=110, PETRI_TRANSITIONS=119} [2025-02-06 13:02:52,322 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 0 predicate places. [2025-02-06 13:02:52,322 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 119 transitions, 446 flow [2025-02-06 13:02:52,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 62.4) internal successors, (624), 10 states have internal predecessors, (624), 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:02:52,322 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:02:52,322 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:02:52,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-06 13:02:52,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:02:52,527 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-02-06 13:02:52,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:02:52,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1580452108, now seen corresponding path program 1 times [2025-02-06 13:02:52,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:02:52,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670656661] [2025-02-06 13:02:52,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:02:52,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:02:52,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-06 13:02:52,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 13:02:52,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:02:52,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:02:53,144 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-06 13:02:53,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:02:53,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670656661] [2025-02-06 13:02:53,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670656661] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:02:53,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:02:53,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:02:53,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953864191] [2025-02-06 13:02:53,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:02:53,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:02:53,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:02:53,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:02:53,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:02:53,146 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 126 [2025-02-06 13:02:53,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 119 transitions, 446 flow. Second operand has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 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:02:53,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:02:53,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 126 [2025-02-06 13:02:53,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:02:54,996 INFO L124 PetriNetUnfolderBase]: 11054/21060 cut-off events. [2025-02-06 13:02:54,997 INFO L125 PetriNetUnfolderBase]: For 12358/12726 co-relation queries the response was YES. [2025-02-06 13:02:55,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46220 conditions, 21060 events. 11054/21060 cut-off events. For 12358/12726 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 154230 event pairs, 6653 based on Foata normal form. 6/18392 useless extension candidates. Maximal degree in co-relation 46114. Up to 15403 conditions per place. [2025-02-06 13:02:55,135 INFO L140 encePairwiseOnDemand]: 122/126 looper letters, 114 selfloop transitions, 1 changer transitions 9/159 dead transitions. [2025-02-06 13:02:55,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 159 transitions, 831 flow [2025-02-06 13:02:55,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:02:55,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:02:55,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 349 transitions. [2025-02-06 13:02:55,136 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6924603174603174 [2025-02-06 13:02:55,136 INFO L175 Difference]: Start difference. First operand has 110 places, 119 transitions, 446 flow. Second operand 4 states and 349 transitions. [2025-02-06 13:02:55,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 159 transitions, 831 flow [2025-02-06 13:02:55,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 159 transitions, 826 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 13:02:55,154 INFO L231 Difference]: Finished difference. Result has 112 places, 119 transitions, 450 flow [2025-02-06 13:02:55,155 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=450, PETRI_PLACES=112, PETRI_TRANSITIONS=119} [2025-02-06 13:02:55,155 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 2 predicate places. [2025-02-06 13:02:55,155 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 119 transitions, 450 flow [2025-02-06 13:02:55,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 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:02:55,156 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:02:55,156 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:02:55,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 13:02:55,156 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-02-06 13:02:55,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:02:55,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1921187488, now seen corresponding path program 2 times [2025-02-06 13:02:55,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:02:55,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208875853] [2025-02-06 13:02:55,157 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:02:55,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:02:55,168 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-02-06 13:02:55,176 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 37 statements. [2025-02-06 13:02:55,176 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 13:02:55,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:02:55,567 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-06 13:02:55,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:02:55,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208875853] [2025-02-06 13:02:55,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208875853] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:02:55,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:02:55,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:02:55,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980040732] [2025-02-06 13:02:55,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:02:55,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:02:55,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:02:55,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:02:55,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:02:55,569 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 126 [2025-02-06 13:02:55,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 119 transitions, 450 flow. Second operand has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 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:02:55,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:02:55,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 126 [2025-02-06 13:02:55,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:02:57,083 INFO L124 PetriNetUnfolderBase]: 11313/21657 cut-off events. [2025-02-06 13:02:57,083 INFO L125 PetriNetUnfolderBase]: For 13314/13682 co-relation queries the response was YES. [2025-02-06 13:02:57,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47695 conditions, 21657 events. 11313/21657 cut-off events. For 13314/13682 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 159612 event pairs, 6969 based on Foata normal form. 5/18913 useless extension candidates. Maximal degree in co-relation 47619. Up to 15958 conditions per place. [2025-02-06 13:02:57,217 INFO L140 encePairwiseOnDemand]: 122/126 looper letters, 114 selfloop transitions, 1 changer transitions 7/157 dead transitions. [2025-02-06 13:02:57,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 157 transitions, 827 flow [2025-02-06 13:02:57,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:02:57,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:02:57,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 347 transitions. [2025-02-06 13:02:57,218 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6884920634920635 [2025-02-06 13:02:57,219 INFO L175 Difference]: Start difference. First operand has 112 places, 119 transitions, 450 flow. Second operand 4 states and 347 transitions. [2025-02-06 13:02:57,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 157 transitions, 827 flow [2025-02-06 13:02:57,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 157 transitions, 821 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-02-06 13:02:57,234 INFO L231 Difference]: Finished difference. Result has 114 places, 119 transitions, 456 flow [2025-02-06 13:02:57,234 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=447, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=456, PETRI_PLACES=114, PETRI_TRANSITIONS=119} [2025-02-06 13:02:57,235 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 4 predicate places. [2025-02-06 13:02:57,235 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 119 transitions, 456 flow [2025-02-06 13:02:57,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 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:02:57,236 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:02:57,236 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:02:57,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 13:02:57,236 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-02-06 13:02:57,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:02:57,237 INFO L85 PathProgramCache]: Analyzing trace with hash -259270709, now seen corresponding path program 1 times [2025-02-06 13:02:57,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:02:57,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025010335] [2025-02-06 13:02:57,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:02:57,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:02:57,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-06 13:02:57,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 13:02:57,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:02:57,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:02:57,301 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-06 13:02:57,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:02:57,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025010335] [2025-02-06 13:02:57,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025010335] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:02:57,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:02:57,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:02:57,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406752811] [2025-02-06 13:02:57,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:02:57,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:02:57,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:02:57,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:02:57,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:02:57,303 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 126 [2025-02-06 13:02:57,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 119 transitions, 456 flow. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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:02:57,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:02:57,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 126 [2025-02-06 13:02:57,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:02:58,562 INFO L124 PetriNetUnfolderBase]: 10579/20281 cut-off events. [2025-02-06 13:02:58,562 INFO L125 PetriNetUnfolderBase]: For 13650/14014 co-relation queries the response was YES. [2025-02-06 13:02:58,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44748 conditions, 20281 events. 10579/20281 cut-off events. For 13650/14014 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 148322 event pairs, 4067 based on Foata normal form. 161/17812 useless extension candidates. Maximal degree in co-relation 44695. Up to 15331 conditions per place. [2025-02-06 13:02:58,720 INFO L140 encePairwiseOnDemand]: 122/126 looper letters, 87 selfloop transitions, 2 changer transitions 5/129 dead transitions. [2025-02-06 13:02:58,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 129 transitions, 685 flow [2025-02-06 13:02:58,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:02:58,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:02:58,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions. [2025-02-06 13:02:58,721 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6931216931216931 [2025-02-06 13:02:58,721 INFO L175 Difference]: Start difference. First operand has 114 places, 119 transitions, 456 flow. Second operand 3 states and 262 transitions. [2025-02-06 13:02:58,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 129 transitions, 685 flow [2025-02-06 13:02:58,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 129 transitions, 682 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-06 13:02:58,737 INFO L231 Difference]: Finished difference. Result has 114 places, 119 transitions, 474 flow [2025-02-06 13:02:58,738 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=474, PETRI_PLACES=114, PETRI_TRANSITIONS=119} [2025-02-06 13:02:58,738 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 4 predicate places. [2025-02-06 13:02:58,739 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 119 transitions, 474 flow [2025-02-06 13:02:58,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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:02:58,739 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:02:58,739 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 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:02:58,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 13:02:58,739 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-02-06 13:02:58,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:02:58,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1380170616, now seen corresponding path program 1 times [2025-02-06 13:02:58,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:02:58,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396227736] [2025-02-06 13:02:58,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:02:58,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:02:58,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 13:02:58,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 13:02:58,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:02:58,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:02:58,832 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-06 13:02:58,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:02:58,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396227736] [2025-02-06 13:02:58,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396227736] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:02:58,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:02:58,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:02:58,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81070921] [2025-02-06 13:02:58,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:02:58,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:02:58,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:02:58,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:02:58,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:02:58,845 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 126 [2025-02-06 13:02:58,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 119 transitions, 474 flow. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 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:02:58,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:02:58,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 126 [2025-02-06 13:02:58,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:03:00,178 INFO L124 PetriNetUnfolderBase]: 10248/19431 cut-off events. [2025-02-06 13:03:00,179 INFO L125 PetriNetUnfolderBase]: For 13603/13951 co-relation queries the response was YES. [2025-02-06 13:03:00,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43486 conditions, 19431 events. 10248/19431 cut-off events. For 13603/13951 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 141000 event pairs, 5947 based on Foata normal form. 86/17038 useless extension candidates. Maximal degree in co-relation 43380. Up to 12655 conditions per place. [2025-02-06 13:03:00,283 INFO L140 encePairwiseOnDemand]: 123/126 looper letters, 120 selfloop transitions, 3 changer transitions 0/158 dead transitions. [2025-02-06 13:03:00,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 158 transitions, 867 flow [2025-02-06 13:03:00,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:03:00,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:03:00,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 282 transitions. [2025-02-06 13:03:00,284 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.746031746031746 [2025-02-06 13:03:00,284 INFO L175 Difference]: Start difference. First operand has 114 places, 119 transitions, 474 flow. Second operand 3 states and 282 transitions. [2025-02-06 13:03:00,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 158 transitions, 867 flow [2025-02-06 13:03:00,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 158 transitions, 857 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-02-06 13:03:00,305 INFO L231 Difference]: Finished difference. Result has 113 places, 120 transitions, 481 flow [2025-02-06 13:03:00,305 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=481, PETRI_PLACES=113, PETRI_TRANSITIONS=120} [2025-02-06 13:03:00,305 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 3 predicate places. [2025-02-06 13:03:00,305 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 120 transitions, 481 flow [2025-02-06 13:03:00,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 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:03:00,306 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:03:00,306 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 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:03:00,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 13:03:00,306 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-02-06 13:03:00,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:03:00,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1524945477, now seen corresponding path program 1 times [2025-02-06 13:03:00,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:03:00,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113028275] [2025-02-06 13:03:00,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:03:00,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:03:00,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-06 13:03:00,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-06 13:03:00,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:03:00,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:03:00,599 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-02-06 13:03:00,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:03:00,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113028275] [2025-02-06 13:03:00,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113028275] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:03:00,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843830544] [2025-02-06 13:03:00,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:03:00,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:03:00,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:03:00,603 INFO L229 MonitoredProcess]: Starting monitored process 9 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:03:00,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 13:03:00,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-06 13:03:00,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-06 13:03:00,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:03:00,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:03:00,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 13:03:00,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:03:00,759 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-06 13:03:00,759 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:03:00,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843830544] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:03:00,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 13:03:00,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 13 [2025-02-06 13:03:00,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503260483] [2025-02-06 13:03:00,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:03:00,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 13:03:00,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:03:00,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 13:03:00,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-02-06 13:03:00,765 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 126 [2025-02-06 13:03:00,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 120 transitions, 481 flow. Second operand has 6 states, 6 states have (on average 65.0) internal successors, (390), 6 states have internal predecessors, (390), 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:03:00,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:03:00,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 126 [2025-02-06 13:03:00,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:03:03,263 INFO L124 PetriNetUnfolderBase]: 17013/30638 cut-off events. [2025-02-06 13:03:03,263 INFO L125 PetriNetUnfolderBase]: For 21180/21970 co-relation queries the response was YES. [2025-02-06 13:03:03,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70288 conditions, 30638 events. 17013/30638 cut-off events. For 21180/21970 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 229472 event pairs, 7099 based on Foata normal form. 0/27399 useless extension candidates. Maximal degree in co-relation 70182. Up to 15603 conditions per place. [2025-02-06 13:03:03,415 INFO L140 encePairwiseOnDemand]: 118/126 looper letters, 253 selfloop transitions, 7 changer transitions 0/292 dead transitions. [2025-02-06 13:03:03,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 292 transitions, 1689 flow [2025-02-06 13:03:03,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 13:03:03,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 13:03:03,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 622 transitions. [2025-02-06 13:03:03,419 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7052154195011338 [2025-02-06 13:03:03,419 INFO L175 Difference]: Start difference. First operand has 113 places, 120 transitions, 481 flow. Second operand 7 states and 622 transitions. [2025-02-06 13:03:03,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 292 transitions, 1689 flow [2025-02-06 13:03:03,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 292 transitions, 1686 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 13:03:03,441 INFO L231 Difference]: Finished difference. Result has 122 places, 123 transitions, 515 flow [2025-02-06 13:03:03,441 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=515, PETRI_PLACES=122, PETRI_TRANSITIONS=123} [2025-02-06 13:03:03,443 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 12 predicate places. [2025-02-06 13:03:03,443 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 123 transitions, 515 flow [2025-02-06 13:03:03,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 65.0) internal successors, (390), 6 states have internal predecessors, (390), 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:03:03,443 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:03:03,443 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 2, 2, 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:03:03,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-06 13:03:03,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-06 13:03:03,644 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-02-06 13:03:03,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:03:03,644 INFO L85 PathProgramCache]: Analyzing trace with hash -2128143458, now seen corresponding path program 1 times [2025-02-06 13:03:03,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:03:03,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797250800] [2025-02-06 13:03:03,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:03:03,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:03:03,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-06 13:03:03,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 13:03:03,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:03:03,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:03:03,747 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-06 13:03:03,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:03:03,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797250800] [2025-02-06 13:03:03,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797250800] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:03:03,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:03:03,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 13:03:03,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9546662] [2025-02-06 13:03:03,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:03:03,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:03:03,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:03:03,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:03:03,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:03:03,753 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 126 [2025-02-06 13:03:03,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 123 transitions, 515 flow. Second operand has 5 states, 5 states have (on average 65.0) internal successors, (325), 5 states have internal predecessors, (325), 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:03:03,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:03:03,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 126 [2025-02-06 13:03:03,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:03:06,720 INFO L124 PetriNetUnfolderBase]: 18116/31825 cut-off events. [2025-02-06 13:03:06,720 INFO L125 PetriNetUnfolderBase]: For 24969/25810 co-relation queries the response was YES. [2025-02-06 13:03:06,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79154 conditions, 31825 events. 18116/31825 cut-off events. For 24969/25810 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 231391 event pairs, 7383 based on Foata normal form. 0/29311 useless extension candidates. Maximal degree in co-relation 79044. Up to 14771 conditions per place. [2025-02-06 13:03:06,881 INFO L140 encePairwiseOnDemand]: 117/126 looper letters, 209 selfloop transitions, 12 changer transitions 0/252 dead transitions. [2025-02-06 13:03:06,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 252 transitions, 1469 flow [2025-02-06 13:03:06,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:03:06,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 13:03:06,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 524 transitions. [2025-02-06 13:03:06,883 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6931216931216931 [2025-02-06 13:03:06,884 INFO L175 Difference]: Start difference. First operand has 122 places, 123 transitions, 515 flow. Second operand 6 states and 524 transitions. [2025-02-06 13:03:06,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 252 transitions, 1469 flow [2025-02-06 13:03:06,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 252 transitions, 1462 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:03:06,950 INFO L231 Difference]: Finished difference. Result has 127 places, 126 transitions, 555 flow [2025-02-06 13:03:06,950 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=555, PETRI_PLACES=127, PETRI_TRANSITIONS=126} [2025-02-06 13:03:06,951 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 17 predicate places. [2025-02-06 13:03:06,951 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 126 transitions, 555 flow [2025-02-06 13:03:06,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 65.0) internal successors, (325), 5 states have internal predecessors, (325), 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:03:06,951 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:03:06,951 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 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:03:06,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 13:03:06,951 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-02-06 13:03:06,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:03:06,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1950744669, now seen corresponding path program 1 times [2025-02-06 13:03:06,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:03:06,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812909509] [2025-02-06 13:03:06,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:03:06,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:03:06,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-06 13:03:06,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 13:03:06,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:03:06,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:03:07,086 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-06 13:03:07,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:03:07,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812909509] [2025-02-06 13:03:07,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812909509] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:03:07,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:03:07,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 13:03:07,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996709155] [2025-02-06 13:03:07,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:03:07,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 13:03:07,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:03:07,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 13:03:07,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 13:03:07,091 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 126 [2025-02-06 13:03:07,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 126 transitions, 555 flow. Second operand has 6 states, 6 states have (on average 64.33333333333333) internal successors, (386), 6 states have internal predecessors, (386), 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:03:07,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:03:07,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 126 [2025-02-06 13:03:07,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:03:10,591 INFO L124 PetriNetUnfolderBase]: 20866/35627 cut-off events. [2025-02-06 13:03:10,591 INFO L125 PetriNetUnfolderBase]: For 30393/31513 co-relation queries the response was YES. [2025-02-06 13:03:10,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92309 conditions, 35627 events. 20866/35627 cut-off events. For 30393/31513 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 258508 event pairs, 7930 based on Foata normal form. 288/34132 useless extension candidates. Maximal degree in co-relation 92198. Up to 16686 conditions per place. [2025-02-06 13:03:10,789 INFO L140 encePairwiseOnDemand]: 119/126 looper letters, 218 selfloop transitions, 10 changer transitions 0/259 dead transitions. [2025-02-06 13:03:10,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 259 transitions, 1541 flow [2025-02-06 13:03:10,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:03:10,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 13:03:10,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 528 transitions. [2025-02-06 13:03:10,791 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6984126984126984 [2025-02-06 13:03:10,791 INFO L175 Difference]: Start difference. First operand has 127 places, 126 transitions, 555 flow. Second operand 6 states and 528 transitions. [2025-02-06 13:03:10,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 259 transitions, 1541 flow [2025-02-06 13:03:10,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 259 transitions, 1525 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-02-06 13:03:10,838 INFO L231 Difference]: Finished difference. Result has 131 places, 127 transitions, 590 flow [2025-02-06 13:03:10,838 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=527, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=590, PETRI_PLACES=131, PETRI_TRANSITIONS=127} [2025-02-06 13:03:10,838 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 21 predicate places. [2025-02-06 13:03:10,839 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 127 transitions, 590 flow [2025-02-06 13:03:10,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 64.33333333333333) internal successors, (386), 6 states have internal predecessors, (386), 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:03:10,839 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:03:10,839 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 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] [2025-02-06 13:03:10,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 13:03:10,839 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-02-06 13:03:10,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:03:10,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1948611136, now seen corresponding path program 1 times [2025-02-06 13:03:10,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:03:10,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805571340] [2025-02-06 13:03:10,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:03:10,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:03:10,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 13:03:10,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 13:03:10,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:03:10,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:03:10,913 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-06 13:03:10,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:03:10,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805571340] [2025-02-06 13:03:10,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805571340] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:03:10,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:03:10,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 13:03:10,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117467670] [2025-02-06 13:03:10,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:03:10,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:03:10,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:03:10,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:03:10,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:03:10,918 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 126 [2025-02-06 13:03:10,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 127 transitions, 590 flow. Second operand has 5 states, 5 states have (on average 65.4) internal successors, (327), 5 states have internal predecessors, (327), 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:03:10,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:03:10,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 126 [2025-02-06 13:03:10,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:03:14,555 INFO L124 PetriNetUnfolderBase]: 20571/35423 cut-off events. [2025-02-06 13:03:14,556 INFO L125 PetriNetUnfolderBase]: For 35918/36995 co-relation queries the response was YES. [2025-02-06 13:03:14,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94864 conditions, 35423 events. 20571/35423 cut-off events. For 35918/36995 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 257551 event pairs, 10082 based on Foata normal form. 305/33816 useless extension candidates. Maximal degree in co-relation 94751. Up to 19134 conditions per place. [2025-02-06 13:03:14,894 INFO L140 encePairwiseOnDemand]: 117/126 looper letters, 177 selfloop transitions, 14 changer transitions 0/222 dead transitions. [2025-02-06 13:03:14,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 222 transitions, 1351 flow [2025-02-06 13:03:14,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:03:14,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 13:03:14,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 438 transitions. [2025-02-06 13:03:14,896 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6952380952380952 [2025-02-06 13:03:14,896 INFO L175 Difference]: Start difference. First operand has 131 places, 127 transitions, 590 flow. Second operand 5 states and 438 transitions. [2025-02-06 13:03:14,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 222 transitions, 1351 flow [2025-02-06 13:03:14,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 222 transitions, 1342 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:03:14,992 INFO L231 Difference]: Finished difference. Result has 134 places, 127 transitions, 613 flow [2025-02-06 13:03:14,993 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=581, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=613, PETRI_PLACES=134, PETRI_TRANSITIONS=127} [2025-02-06 13:03:14,993 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 24 predicate places. [2025-02-06 13:03:14,993 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 127 transitions, 613 flow [2025-02-06 13:03:14,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 65.4) internal successors, (327), 5 states have internal predecessors, (327), 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:03:14,993 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:03:14,993 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:03:14,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 13:03:14,994 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-02-06 13:03:14,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:03:14,994 INFO L85 PathProgramCache]: Analyzing trace with hash -221721959, now seen corresponding path program 1 times [2025-02-06 13:03:14,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:03:14,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659921317] [2025-02-06 13:03:14,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:03:14,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:03:15,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 13:03:15,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 13:03:15,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:03:15,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:03:15,227 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-02-06 13:03:15,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:03:15,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659921317] [2025-02-06 13:03:15,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659921317] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:03:15,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494455260] [2025-02-06 13:03:15,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:03:15,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:03:15,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:03:15,230 INFO L229 MonitoredProcess]: Starting monitored process 10 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:03:15,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 13:03:15,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 13:03:15,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 13:03:15,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:03:15,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:03:15,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 13:03:15,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:03:15,412 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-06 13:03:15,412 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:03:15,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494455260] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:03:15,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 13:03:15,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 12 [2025-02-06 13:03:15,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317793228] [2025-02-06 13:03:15,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:03:15,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 13:03:15,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:03:15,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 13:03:15,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-06 13:03:15,419 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 126 [2025-02-06 13:03:15,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 127 transitions, 613 flow. Second operand has 6 states, 6 states have (on average 65.5) internal successors, (393), 6 states have internal predecessors, (393), 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:03:15,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:03:15,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 126 [2025-02-06 13:03:15,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:03:20,150 INFO L124 PetriNetUnfolderBase]: 26465/49248 cut-off events. [2025-02-06 13:03:20,152 INFO L125 PetriNetUnfolderBase]: For 74182/75826 co-relation queries the response was YES. [2025-02-06 13:03:20,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131469 conditions, 49248 events. 26465/49248 cut-off events. For 74182/75826 co-relation queries the response was YES. Maximal size of possible extension queue 598. Compared 409178 event pairs, 13237 based on Foata normal form. 482/46345 useless extension candidates. Maximal degree in co-relation 131355. Up to 26269 conditions per place. [2025-02-06 13:03:20,454 INFO L140 encePairwiseOnDemand]: 118/126 looper letters, 295 selfloop transitions, 6 changer transitions 0/333 dead transitions. [2025-02-06 13:03:20,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 333 transitions, 2491 flow [2025-02-06 13:03:20,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 13:03:20,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 13:03:20,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 616 transitions. [2025-02-06 13:03:20,455 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6984126984126984 [2025-02-06 13:03:20,455 INFO L175 Difference]: Start difference. First operand has 134 places, 127 transitions, 613 flow. Second operand 7 states and 616 transitions. [2025-02-06 13:03:20,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 333 transitions, 2491 flow [2025-02-06 13:03:20,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 333 transitions, 2393 flow, removed 24 selfloop flow, removed 3 redundant places. [2025-02-06 13:03:20,556 INFO L231 Difference]: Finished difference. Result has 141 places, 130 transitions, 630 flow [2025-02-06 13:03:20,557 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=595, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=630, PETRI_PLACES=141, PETRI_TRANSITIONS=130} [2025-02-06 13:03:20,557 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 31 predicate places. [2025-02-06 13:03:20,557 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 130 transitions, 630 flow [2025-02-06 13:03:20,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 65.5) internal successors, (393), 6 states have internal predecessors, (393), 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:03:20,557 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:03:20,558 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 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:03:20,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-06 13:03:20,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:03:20,758 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-02-06 13:03:20,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:03:20,759 INFO L85 PathProgramCache]: Analyzing trace with hash 249218047, now seen corresponding path program 1 times [2025-02-06 13:03:20,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:03:20,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40841023] [2025-02-06 13:03:20,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:03:20,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:03:20,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 13:03:20,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 13:03:20,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:03:20,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:03:21,062 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-02-06 13:03:21,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:03:21,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40841023] [2025-02-06 13:03:21,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40841023] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:03:21,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867949199] [2025-02-06 13:03:21,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:03:21,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:03:21,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:03:21,065 INFO L229 MonitoredProcess]: Starting monitored process 11 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:03:21,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-06 13:03:21,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 13:03:21,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 13:03:21,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:03:21,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:03:21,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-02-06 13:03:21,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:03:21,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 13:03:21,298 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-06 13:03:21,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-02-06 13:03:21,657 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:03:21,657 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:03:21,970 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 25 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-06 13:03:21,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867949199] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:03:21,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:03:21,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 14, 9] total 30 [2025-02-06 13:03:21,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327055020] [2025-02-06 13:03:21,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:03:21,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-06 13:03:21,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:03:21,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-06 13:03:21,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=768, Unknown=0, NotChecked=0, Total=992 [2025-02-06 13:03:23,608 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 126 [2025-02-06 13:03:23,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 130 transitions, 630 flow. Second operand has 32 states, 32 states have (on average 59.375) internal successors, (1900), 32 states have internal predecessors, (1900), 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:03:23,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:03:23,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 126 [2025-02-06 13:03:23,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand