./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/test-context1.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/test-context1.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 d63a80d2bfe8ff8bb62e6b5083cee589f2cb0f37dc67867654ab7601d82af23e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 13:12:33,013 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 13:12:33,062 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:12:33,067 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 13:12:33,067 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 13:12:33,083 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 13:12:33,084 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 13:12:33,084 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 13:12:33,084 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 13:12:33,084 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 13:12:33,084 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 13:12:33,084 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 13:12:33,085 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 13:12:33,085 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 13:12:33,085 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 13:12:33,085 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 13:12:33,085 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 13:12:33,085 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 13:12:33,085 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 13:12:33,085 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 13:12:33,085 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 13:12:33,085 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 13:12:33,085 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 13:12:33,085 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 13:12:33,085 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 13:12:33,085 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 13:12:33,085 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 13:12:33,085 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 13:12:33,085 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 13:12:33,085 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 13:12:33,086 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 13:12:33,086 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 13:12:33,086 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 13:12:33,086 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:12:33,086 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 13:12:33,086 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 13:12:33,086 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 13:12:33,086 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 13:12:33,086 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 13:12:33,086 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 13:12:33,086 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 13:12:33,086 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 13:12:33,086 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 -> d63a80d2bfe8ff8bb62e6b5083cee589f2cb0f37dc67867654ab7601d82af23e [2025-02-06 13:12:33,318 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 13:12:33,324 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 13:12:33,326 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 13:12:33,327 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 13:12:33,327 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 13:12:33,328 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/test-context1.wvr.c [2025-02-06 13:12:34,580 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5af1175cf/fb92e7abf1df4328b12a1e419dc888f1/FLAG560103688 [2025-02-06 13:12:34,808 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 13:12:34,809 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/test-context1.wvr.c [2025-02-06 13:12:34,816 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5af1175cf/fb92e7abf1df4328b12a1e419dc888f1/FLAG560103688 [2025-02-06 13:12:34,825 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5af1175cf/fb92e7abf1df4328b12a1e419dc888f1 [2025-02-06 13:12:34,827 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 13:12:34,827 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 13:12:34,828 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 13:12:34,828 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 13:12:34,831 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 13:12:34,831 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:12:34" (1/1) ... [2025-02-06 13:12:34,832 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20e64d41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:12:34, skipping insertion in model container [2025-02-06 13:12:34,832 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:12:34" (1/1) ... [2025-02-06 13:12:34,841 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 13:12:34,943 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:12:34,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:12:34,950 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 13:12:34,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:12:34,989 INFO L204 MainTranslator]: Completed translation [2025-02-06 13:12:34,993 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:12:34 WrapperNode [2025-02-06 13:12:34,993 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 13:12:34,994 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 13:12:34,997 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 13:12:34,997 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 13:12:35,001 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:12:34" (1/1) ... [2025-02-06 13:12:35,015 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:12:34" (1/1) ... [2025-02-06 13:12:35,038 INFO L138 Inliner]: procedures = 23, calls = 25, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 124 [2025-02-06 13:12:35,039 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 13:12:35,039 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 13:12:35,039 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 13:12:35,040 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 13:12:35,045 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:12:34" (1/1) ... [2025-02-06 13:12:35,045 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:12:34" (1/1) ... [2025-02-06 13:12:35,047 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:12:34" (1/1) ... [2025-02-06 13:12:35,054 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-02-06 13:12:35,055 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:12:34" (1/1) ... [2025-02-06 13:12:35,055 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:12:34" (1/1) ... [2025-02-06 13:12:35,059 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:12:34" (1/1) ... [2025-02-06 13:12:35,059 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:12:34" (1/1) ... [2025-02-06 13:12:35,060 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:12:34" (1/1) ... [2025-02-06 13:12:35,061 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:12:34" (1/1) ... [2025-02-06 13:12:35,062 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 13:12:35,063 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 13:12:35,063 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 13:12:35,063 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 13:12:35,064 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:12:34" (1/1) ... [2025-02-06 13:12:35,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:12:35,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:12:35,085 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:12:35,087 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:12:35,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 13:12:35,106 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 13:12:35,106 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 13:12:35,106 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 13:12:35,106 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 13:12:35,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 13:12:35,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 13:12:35,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 13:12:35,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 13:12:35,106 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 13:12:35,106 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 13:12:35,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 13:12:35,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 13:12:35,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 13:12:35,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 13:12:35,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 13:12:35,108 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:12:35,191 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 13:12:35,192 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 13:12:35,365 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 13:12:35,366 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 13:12:35,547 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 13:12:35,548 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 13:12:35,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:12:35 BoogieIcfgContainer [2025-02-06 13:12:35,548 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 13:12:35,550 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 13:12:35,550 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 13:12:35,553 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 13:12:35,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:12:34" (1/3) ... [2025-02-06 13:12:35,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ab4ee13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:12:35, skipping insertion in model container [2025-02-06 13:12:35,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:12:34" (2/3) ... [2025-02-06 13:12:35,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ab4ee13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:12:35, skipping insertion in model container [2025-02-06 13:12:35,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:12:35" (3/3) ... [2025-02-06 13:12:35,555 INFO L128 eAbstractionObserver]: Analyzing ICFG test-context1.wvr.c [2025-02-06 13:12:35,568 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 13:12:35,570 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-context1.wvr.c that has 3 procedures, 33 locations, 1 initial locations, 3 loop locations, and 8 error locations. [2025-02-06 13:12:35,570 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 13:12:35,626 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 13:12:35,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 37 transitions, 88 flow [2025-02-06 13:12:35,677 INFO L124 PetriNetUnfolderBase]: 5/35 cut-off events. [2025-02-06 13:12:35,678 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 13:12:35,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 35 events. 5/35 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 50 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2025-02-06 13:12:35,681 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 37 transitions, 88 flow [2025-02-06 13:12:35,683 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 34 transitions, 80 flow [2025-02-06 13:12:35,688 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 13:12:35,697 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;@5c646f4f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 13:12:35,697 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-02-06 13:12:35,700 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 13:12:35,700 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-02-06 13:12:35,700 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 13:12:35,700 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:12:35,701 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 13:12:35,701 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-02-06 13:12:35,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:12:35,705 INFO L85 PathProgramCache]: Analyzing trace with hash 357522, now seen corresponding path program 1 times [2025-02-06 13:12:35,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:12:35,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081547948] [2025-02-06 13:12:35,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:12:35,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:12:35,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 13:12:35,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 13:12:35,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:12:35,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:12:35,869 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:12:35,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:12:35,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081547948] [2025-02-06 13:12:35,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081547948] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:12:35,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:12:35,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 13:12:35,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442089447] [2025-02-06 13:12:35,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:12:35,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:12:35,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:12:35,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:12:35,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:12:35,899 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-02-06 13:12:35,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 34 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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:12:35,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:12:35,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-02-06 13:12:35,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:12:35,990 INFO L124 PetriNetUnfolderBase]: 212/371 cut-off events. [2025-02-06 13:12:35,991 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-02-06 13:12:35,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 768 conditions, 371 events. 212/371 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1442 event pairs, 176 based on Foata normal form. 1/263 useless extension candidates. Maximal degree in co-relation 705. Up to 364 conditions per place. [2025-02-06 13:12:35,995 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 23 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2025-02-06 13:12:35,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 29 transitions, 120 flow [2025-02-06 13:12:35,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:12:35,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:12:36,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2025-02-06 13:12:36,003 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45045045045045046 [2025-02-06 13:12:36,004 INFO L175 Difference]: Start difference. First operand has 36 places, 34 transitions, 80 flow. Second operand 3 states and 50 transitions. [2025-02-06 13:12:36,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 29 transitions, 120 flow [2025-02-06 13:12:36,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 29 transitions, 112 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 13:12:36,008 INFO L231 Difference]: Finished difference. Result has 31 places, 29 transitions, 66 flow [2025-02-06 13:12:36,010 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=31, PETRI_TRANSITIONS=29} [2025-02-06 13:12:36,012 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, -5 predicate places. [2025-02-06 13:12:36,012 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 29 transitions, 66 flow [2025-02-06 13:12:36,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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:12:36,013 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:12:36,013 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 13:12:36,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 13:12:36,013 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-02-06 13:12:36,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:12:36,014 INFO L85 PathProgramCache]: Analyzing trace with hash 357523, now seen corresponding path program 1 times [2025-02-06 13:12:36,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:12:36,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527744294] [2025-02-06 13:12:36,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:12:36,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:12:36,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 13:12:36,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 13:12:36,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:12:36,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:12:36,227 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:12:36,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:12:36,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527744294] [2025-02-06 13:12:36,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527744294] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:12:36,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:12:36,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:12:36,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137045295] [2025-02-06 13:12:36,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:12:36,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:12:36,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:12:36,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:12:36,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:12:36,235 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-02-06 13:12:36,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 29 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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:12:36,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:12:36,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-02-06 13:12:36,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:12:36,351 INFO L124 PetriNetUnfolderBase]: 213/374 cut-off events. [2025-02-06 13:12:36,352 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-06 13:12:36,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 759 conditions, 374 events. 213/374 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1466 event pairs, 176 based on Foata normal form. 0/265 useless extension candidates. Maximal degree in co-relation 737. Up to 369 conditions per place. [2025-02-06 13:12:36,354 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 25 selfloop transitions, 4 changer transitions 0/32 dead transitions. [2025-02-06 13:12:36,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 32 transitions, 132 flow [2025-02-06 13:12:36,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:12:36,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:12:36,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2025-02-06 13:12:36,355 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3918918918918919 [2025-02-06 13:12:36,355 INFO L175 Difference]: Start difference. First operand has 31 places, 29 transitions, 66 flow. Second operand 4 states and 58 transitions. [2025-02-06 13:12:36,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 32 transitions, 132 flow [2025-02-06 13:12:36,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 32 transitions, 126 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:12:36,357 INFO L231 Difference]: Finished difference. Result has 34 places, 32 transitions, 89 flow [2025-02-06 13:12:36,357 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=89, PETRI_PLACES=34, PETRI_TRANSITIONS=32} [2025-02-06 13:12:36,357 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2025-02-06 13:12:36,358 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 32 transitions, 89 flow [2025-02-06 13:12:36,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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:12:36,358 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:12:36,358 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-02-06 13:12:36,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 13:12:36,358 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-02-06 13:12:36,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:12:36,358 INFO L85 PathProgramCache]: Analyzing trace with hash 343591166, now seen corresponding path program 1 times [2025-02-06 13:12:36,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:12:36,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036753940] [2025-02-06 13:12:36,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:12:36,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:12:36,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 13:12:36,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 13:12:36,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:12:36,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:12:36,546 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:12:36,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:12:36,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036753940] [2025-02-06 13:12:36,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036753940] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:12:36,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401600192] [2025-02-06 13:12:36,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:12:36,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:12:36,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:12:36,549 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:12:36,551 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:12:36,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 13:12:36,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 13:12:36,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:12:36,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:12:36,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 13:12:36,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:12:36,669 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 10 treesize of output 9 [2025-02-06 13:12:36,843 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:12:36,844 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:12:36,952 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:12:36,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401600192] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:12:36,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:12:36,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-02-06 13:12:36,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501256021] [2025-02-06 13:12:36,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:12:36,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 13:12:36,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:12:36,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 13:12:36,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-06 13:12:36,973 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-02-06 13:12:36,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 32 transitions, 89 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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:12:36,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:12:36,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-02-06 13:12:36,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:12:37,159 INFO L124 PetriNetUnfolderBase]: 214/376 cut-off events. [2025-02-06 13:12:37,159 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-06 13:12:37,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 775 conditions, 376 events. 214/376 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1471 event pairs, 176 based on Foata normal form. 0/266 useless extension candidates. Maximal degree in co-relation 744. Up to 366 conditions per place. [2025-02-06 13:12:37,161 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 21 selfloop transitions, 10 changer transitions 0/34 dead transitions. [2025-02-06 13:12:37,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 34 transitions, 159 flow [2025-02-06 13:12:37,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 13:12:37,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 13:12:37,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2025-02-06 13:12:37,162 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.30067567567567566 [2025-02-06 13:12:37,162 INFO L175 Difference]: Start difference. First operand has 34 places, 32 transitions, 89 flow. Second operand 8 states and 89 transitions. [2025-02-06 13:12:37,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 34 transitions, 159 flow [2025-02-06 13:12:37,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 34 transitions, 156 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 13:12:37,163 INFO L231 Difference]: Finished difference. Result has 39 places, 34 transitions, 114 flow [2025-02-06 13:12:37,164 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=114, PETRI_PLACES=39, PETRI_TRANSITIONS=34} [2025-02-06 13:12:37,164 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2025-02-06 13:12:37,164 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 34 transitions, 114 flow [2025-02-06 13:12:37,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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:12:37,165 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:12:37,165 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:12:37,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 13:12:37,369 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:12:37,369 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-02-06 13:12:37,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:12:37,370 INFO L85 PathProgramCache]: Analyzing trace with hash -442468755, now seen corresponding path program 1 times [2025-02-06 13:12:37,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:12:37,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083472993] [2025-02-06 13:12:37,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:12:37,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:12:37,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 13:12:37,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 13:12:37,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:12:37,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:12:37,422 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:12:37,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:12:37,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083472993] [2025-02-06 13:12:37,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083472993] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:12:37,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:12:37,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:12:37,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371734636] [2025-02-06 13:12:37,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:12:37,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:12:37,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:12:37,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:12:37,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:12:37,428 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-02-06 13:12:37,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 34 transitions, 114 flow. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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:12:37,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:12:37,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-02-06 13:12:37,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:12:37,483 INFO L124 PetriNetUnfolderBase]: 166/295 cut-off events. [2025-02-06 13:12:37,483 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-06 13:12:37,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 620 conditions, 295 events. 166/295 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1078 event pairs, 132 based on Foata normal form. 0/228 useless extension candidates. Maximal degree in co-relation 582. Up to 284 conditions per place. [2025-02-06 13:12:37,485 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 25 selfloop transitions, 4 changer transitions 0/32 dead transitions. [2025-02-06 13:12:37,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 32 transitions, 168 flow [2025-02-06 13:12:37,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:12:37,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:12:37,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2025-02-06 13:12:37,486 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3581081081081081 [2025-02-06 13:12:37,486 INFO L175 Difference]: Start difference. First operand has 39 places, 34 transitions, 114 flow. Second operand 4 states and 53 transitions. [2025-02-06 13:12:37,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 32 transitions, 168 flow [2025-02-06 13:12:37,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 32 transitions, 126 flow, removed 6 selfloop flow, removed 7 redundant places. [2025-02-06 13:12:37,487 INFO L231 Difference]: Finished difference. Result has 33 places, 32 transitions, 76 flow [2025-02-06 13:12:37,488 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=76, PETRI_PLACES=33, PETRI_TRANSITIONS=32} [2025-02-06 13:12:37,488 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2025-02-06 13:12:37,488 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 32 transitions, 76 flow [2025-02-06 13:12:37,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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:12:37,488 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:12:37,488 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:12:37,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 13:12:37,489 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-02-06 13:12:37,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:12:37,491 INFO L85 PathProgramCache]: Analyzing trace with hash -442468754, now seen corresponding path program 1 times [2025-02-06 13:12:37,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:12:37,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507122244] [2025-02-06 13:12:37,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:12:37,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:12:37,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 13:12:37,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 13:12:37,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:12:37,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:12:37,572 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:12:37,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:12:37,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507122244] [2025-02-06 13:12:37,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507122244] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:12:37,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:12:37,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:12:37,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654882093] [2025-02-06 13:12:37,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:12:37,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:12:37,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:12:37,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:12:37,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:12:37,576 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-02-06 13:12:37,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 32 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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:12:37,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:12:37,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-02-06 13:12:37,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:12:37,677 INFO L124 PetriNetUnfolderBase]: 233/434 cut-off events. [2025-02-06 13:12:37,677 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-02-06 13:12:37,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 881 conditions, 434 events. 233/434 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1803 event pairs, 200 based on Foata normal form. 23/369 useless extension candidates. Maximal degree in co-relation 574. Up to 289 conditions per place. [2025-02-06 13:12:37,679 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 39 selfloop transitions, 3 changer transitions 2/47 dead transitions. [2025-02-06 13:12:37,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 47 transitions, 198 flow [2025-02-06 13:12:37,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:12:37,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:12:37,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2025-02-06 13:12:37,680 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5202702702702703 [2025-02-06 13:12:37,680 INFO L175 Difference]: Start difference. First operand has 33 places, 32 transitions, 76 flow. Second operand 4 states and 77 transitions. [2025-02-06 13:12:37,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 47 transitions, 198 flow [2025-02-06 13:12:37,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 47 transitions, 193 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:12:37,681 INFO L231 Difference]: Finished difference. Result has 35 places, 32 transitions, 86 flow [2025-02-06 13:12:37,681 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=86, PETRI_PLACES=35, PETRI_TRANSITIONS=32} [2025-02-06 13:12:37,682 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, -1 predicate places. [2025-02-06 13:12:37,682 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 32 transitions, 86 flow [2025-02-06 13:12:37,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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:12:37,682 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:12:37,682 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:12:37,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 13:12:37,682 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-02-06 13:12:37,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:12:37,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1563401561, now seen corresponding path program 1 times [2025-02-06 13:12:37,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:12:37,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316538027] [2025-02-06 13:12:37,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:12:37,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:12:37,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 13:12:37,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 13:12:37,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:12:37,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:12:37,866 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:12:37,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:12:37,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316538027] [2025-02-06 13:12:37,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316538027] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:12:37,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41552648] [2025-02-06 13:12:37,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:12:37,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:12:37,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:12:37,869 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:12:37,874 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:12:37,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 13:12:37,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 13:12:37,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:12:37,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:12:37,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 13:12:37,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:12:38,028 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:12:38,028 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:12:38,111 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 35 treesize of output 31 [2025-02-06 13:12:38,138 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:12:38,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41552648] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:12:38,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:12:38,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-02-06 13:12:38,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509892141] [2025-02-06 13:12:38,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:12:38,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 13:12:38,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:12:38,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 13:12:38,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-02-06 13:12:38,173 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-02-06 13:12:38,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 32 transitions, 86 flow. Second operand has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 11 states have internal predecessors, (112), 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:12:38,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:12:38,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-02-06 13:12:38,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:12:38,404 INFO L124 PetriNetUnfolderBase]: 290/546 cut-off events. [2025-02-06 13:12:38,404 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-02-06 13:12:38,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1179 conditions, 546 events. 290/546 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2321 event pairs, 248 based on Foata normal form. 11/444 useless extension candidates. Maximal degree in co-relation 883. Up to 392 conditions per place. [2025-02-06 13:12:38,408 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 39 selfloop transitions, 6 changer transitions 0/48 dead transitions. [2025-02-06 13:12:38,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 48 transitions, 214 flow [2025-02-06 13:12:38,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:12:38,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 13:12:38,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2025-02-06 13:12:38,409 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4594594594594595 [2025-02-06 13:12:38,409 INFO L175 Difference]: Start difference. First operand has 35 places, 32 transitions, 86 flow. Second operand 5 states and 85 transitions. [2025-02-06 13:12:38,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 48 transitions, 214 flow [2025-02-06 13:12:38,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 48 transitions, 209 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:12:38,410 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 108 flow [2025-02-06 13:12:38,410 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=108, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2025-02-06 13:12:38,411 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 2 predicate places. [2025-02-06 13:12:38,411 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 108 flow [2025-02-06 13:12:38,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 11 states have internal predecessors, (112), 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:12:38,411 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:12:38,411 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:12:38,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 13:12:38,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:12:38,612 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-02-06 13:12:38,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:12:38,612 INFO L85 PathProgramCache]: Analyzing trace with hash 670919363, now seen corresponding path program 1 times [2025-02-06 13:12:38,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:12:38,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129795812] [2025-02-06 13:12:38,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:12:38,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:12:38,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 13:12:38,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 13:12:38,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:12:38,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:12:38,735 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:12:38,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:12:38,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129795812] [2025-02-06 13:12:38,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129795812] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:12:38,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505500052] [2025-02-06 13:12:38,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:12:38,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:12:38,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:12:38,740 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:12:38,741 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:12:38,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 13:12:38,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 13:12:38,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:12:38,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:12:38,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 13:12:38,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:12:38,898 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:12:38,898 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:12:38,994 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:12:38,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505500052] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:12:38,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:12:38,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-02-06 13:12:38,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811632141] [2025-02-06 13:12:38,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:12:38,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 13:12:38,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:12:38,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 13:12:38,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-02-06 13:12:39,009 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-02-06 13:12:39,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 108 flow. Second operand has 14 states, 14 states have (on average 10.357142857142858) internal successors, (145), 14 states have internal predecessors, (145), 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:12:39,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:12:39,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-02-06 13:12:39,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:12:39,243 INFO L124 PetriNetUnfolderBase]: 547/1012 cut-off events. [2025-02-06 13:12:39,243 INFO L125 PetriNetUnfolderBase]: For 188/188 co-relation queries the response was YES. [2025-02-06 13:12:39,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2328 conditions, 1012 events. 547/1012 cut-off events. For 188/188 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 4979 event pairs, 341 based on Foata normal form. 24/837 useless extension candidates. Maximal degree in co-relation 1051. Up to 401 conditions per place. [2025-02-06 13:12:39,247 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 79 selfloop transitions, 10 changer transitions 2/94 dead transitions. [2025-02-06 13:12:39,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 94 transitions, 446 flow [2025-02-06 13:12:39,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 13:12:39,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 13:12:39,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 166 transitions. [2025-02-06 13:12:39,249 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4984984984984985 [2025-02-06 13:12:39,249 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 108 flow. Second operand 9 states and 166 transitions. [2025-02-06 13:12:39,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 94 transitions, 446 flow [2025-02-06 13:12:39,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 94 transitions, 432 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-02-06 13:12:39,250 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 154 flow [2025-02-06 13:12:39,250 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=154, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2025-02-06 13:12:39,251 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 10 predicate places. [2025-02-06 13:12:39,251 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 154 flow [2025-02-06 13:12:39,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 10.357142857142858) internal successors, (145), 14 states have internal predecessors, (145), 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:12:39,251 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:12:39,251 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-06 13:12:39,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 13:12:39,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:12:39,456 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-02-06 13:12:39,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:12:39,456 INFO L85 PathProgramCache]: Analyzing trace with hash 2063130296, now seen corresponding path program 2 times [2025-02-06 13:12:39,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:12:39,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475408966] [2025-02-06 13:12:39,456 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:12:39,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:12:39,462 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-02-06 13:12:39,468 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 14 statements. [2025-02-06 13:12:39,469 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 13:12:39,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:12:39,601 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-06 13:12:39,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:12:39,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475408966] [2025-02-06 13:12:39,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475408966] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:12:39,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:12:39,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:12:39,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222108536] [2025-02-06 13:12:39,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:12:39,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:12:39,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:12:39,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:12:39,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:12:39,608 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-02-06 13:12:39,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 154 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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:12:39,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:12:39,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-02-06 13:12:39,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:12:39,695 INFO L124 PetriNetUnfolderBase]: 483/910 cut-off events. [2025-02-06 13:12:39,695 INFO L125 PetriNetUnfolderBase]: For 553/553 co-relation queries the response was YES. [2025-02-06 13:12:39,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2080 conditions, 910 events. 483/910 cut-off events. For 553/553 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4514 event pairs, 446 based on Foata normal form. 33/793 useless extension candidates. Maximal degree in co-relation 1634. Up to 888 conditions per place. [2025-02-06 13:12:39,699 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 26 selfloop transitions, 4 changer transitions 0/33 dead transitions. [2025-02-06 13:12:39,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 33 transitions, 186 flow [2025-02-06 13:12:39,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:12:39,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:12:39,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2025-02-06 13:12:39,700 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3716216216216216 [2025-02-06 13:12:39,700 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 154 flow. Second operand 4 states and 55 transitions. [2025-02-06 13:12:39,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 33 transitions, 186 flow [2025-02-06 13:12:39,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 33 transitions, 170 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-02-06 13:12:39,702 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 118 flow [2025-02-06 13:12:39,702 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2025-02-06 13:12:39,703 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 7 predicate places. [2025-02-06 13:12:39,703 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 118 flow [2025-02-06 13:12:39,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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:12:39,703 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:12:39,703 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:12:39,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 13:12:39,703 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-02-06 13:12:39,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:12:39,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1918652826, now seen corresponding path program 1 times [2025-02-06 13:12:39,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:12:39,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112656905] [2025-02-06 13:12:39,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:12:39,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:12:39,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 13:12:39,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 13:12:39,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:12:39,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:12:39,733 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:12:39,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:12:39,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112656905] [2025-02-06 13:12:39,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112656905] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:12:39,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:12:39,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:12:39,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410507026] [2025-02-06 13:12:39,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:12:39,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:12:39,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:12:39,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:12:39,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:12:39,734 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-02-06 13:12:39,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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:12:39,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:12:39,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-02-06 13:12:39,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:12:39,837 INFO L124 PetriNetUnfolderBase]: 547/1011 cut-off events. [2025-02-06 13:12:39,837 INFO L125 PetriNetUnfolderBase]: For 420/420 co-relation queries the response was YES. [2025-02-06 13:12:39,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2328 conditions, 1011 events. 547/1011 cut-off events. For 420/420 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4891 event pairs, 362 based on Foata normal form. 5/847 useless extension candidates. Maximal degree in co-relation 1856. Up to 714 conditions per place. [2025-02-06 13:12:39,841 INFO L140 encePairwiseOnDemand]: 34/37 looper letters, 36 selfloop transitions, 3 changer transitions 4/46 dead transitions. [2025-02-06 13:12:39,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 46 transitions, 246 flow [2025-02-06 13:12:39,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:12:39,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:12:39,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2025-02-06 13:12:39,842 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5315315315315315 [2025-02-06 13:12:39,842 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 118 flow. Second operand 3 states and 59 transitions. [2025-02-06 13:12:39,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 46 transitions, 246 flow [2025-02-06 13:12:39,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 46 transitions, 241 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:12:39,845 INFO L231 Difference]: Finished difference. Result has 44 places, 33 transitions, 127 flow [2025-02-06 13:12:39,845 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=127, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2025-02-06 13:12:39,845 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 8 predicate places. [2025-02-06 13:12:39,845 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 127 flow [2025-02-06 13:12:39,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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:12:39,845 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:12:39,845 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:12:39,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 13:12:39,845 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-02-06 13:12:39,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:12:39,846 INFO L85 PathProgramCache]: Analyzing trace with hash 888066586, now seen corresponding path program 1 times [2025-02-06 13:12:39,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:12:39,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703654325] [2025-02-06 13:12:39,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:12:39,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:12:39,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 13:12:39,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 13:12:39,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:12:39,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:12:40,058 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 13:12:40,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:12:40,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703654325] [2025-02-06 13:12:40,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703654325] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:12:40,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:12:40,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 13:12:40,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188069449] [2025-02-06 13:12:40,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:12:40,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 13:12:40,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:12:40,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 13:12:40,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 13:12:40,063 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-02-06 13:12:40,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 127 flow. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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:12:40,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:12:40,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-02-06 13:12:40,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:12:40,207 INFO L124 PetriNetUnfolderBase]: 629/1135 cut-off events. [2025-02-06 13:12:40,208 INFO L125 PetriNetUnfolderBase]: For 777/777 co-relation queries the response was YES. [2025-02-06 13:12:40,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2766 conditions, 1135 events. 629/1135 cut-off events. For 777/777 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5206 event pairs, 136 based on Foata normal form. 2/953 useless extension candidates. Maximal degree in co-relation 1903. Up to 302 conditions per place. [2025-02-06 13:12:40,211 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 48 selfloop transitions, 8 changer transitions 12/71 dead transitions. [2025-02-06 13:12:40,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 71 transitions, 370 flow [2025-02-06 13:12:40,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:12:40,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 13:12:40,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2025-02-06 13:12:40,212 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4954954954954955 [2025-02-06 13:12:40,212 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 127 flow. Second operand 6 states and 110 transitions. [2025-02-06 13:12:40,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 71 transitions, 370 flow [2025-02-06 13:12:40,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 71 transitions, 355 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-02-06 13:12:40,215 INFO L231 Difference]: Finished difference. Result has 46 places, 34 transitions, 149 flow [2025-02-06 13:12:40,215 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=149, PETRI_PLACES=46, PETRI_TRANSITIONS=34} [2025-02-06 13:12:40,215 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 10 predicate places. [2025-02-06 13:12:40,216 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 34 transitions, 149 flow [2025-02-06 13:12:40,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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:12:40,216 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:12:40,216 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:12:40,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 13:12:40,216 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-02-06 13:12:40,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:12:40,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1816168355, now seen corresponding path program 2 times [2025-02-06 13:12:40,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:12:40,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361555303] [2025-02-06 13:12:40,217 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:12:40,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:12:40,221 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-02-06 13:12:40,252 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 13:12:40,252 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:12:40,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:12:40,615 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:12:40,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:12:40,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361555303] [2025-02-06 13:12:40,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361555303] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:12:40,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507893761] [2025-02-06 13:12:40,615 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:12:40,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:12:40,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:12:40,617 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:12:40,618 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:12:40,652 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-02-06 13:12:40,669 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 13:12:40,669 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:12:40,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:12:40,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 13:12:40,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:12:40,711 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 13:12:40,711 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:12:40,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1507893761] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:12:40,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 13:12:40,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-02-06 13:12:40,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706080766] [2025-02-06 13:12:40,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:12:40,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:12:40,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:12:40,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:12:40,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-02-06 13:12:40,712 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-02-06 13:12:40,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 34 transitions, 149 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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:12:40,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:12:40,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-02-06 13:12:40,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:12:40,862 INFO L124 PetriNetUnfolderBase]: 936/1678 cut-off events. [2025-02-06 13:12:40,862 INFO L125 PetriNetUnfolderBase]: For 1518/1518 co-relation queries the response was YES. [2025-02-06 13:12:40,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4066 conditions, 1678 events. 936/1678 cut-off events. For 1518/1518 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 8055 event pairs, 409 based on Foata normal form. 33/1441 useless extension candidates. Maximal degree in co-relation 3112. Up to 667 conditions per place. [2025-02-06 13:12:40,867 INFO L140 encePairwiseOnDemand]: 34/37 looper letters, 54 selfloop transitions, 7 changer transitions 3/67 dead transitions. [2025-02-06 13:12:40,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 67 transitions, 395 flow [2025-02-06 13:12:40,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:12:40,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:12:40,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2025-02-06 13:12:40,868 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5743243243243243 [2025-02-06 13:12:40,868 INFO L175 Difference]: Start difference. First operand has 46 places, 34 transitions, 149 flow. Second operand 4 states and 85 transitions. [2025-02-06 13:12:40,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 67 transitions, 395 flow [2025-02-06 13:12:40,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 67 transitions, 377 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-02-06 13:12:40,871 INFO L231 Difference]: Finished difference. Result has 47 places, 36 transitions, 190 flow [2025-02-06 13:12:40,871 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=190, PETRI_PLACES=47, PETRI_TRANSITIONS=36} [2025-02-06 13:12:40,871 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 11 predicate places. [2025-02-06 13:12:40,871 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 190 flow [2025-02-06 13:12:40,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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:12:40,871 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:12:40,871 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:12:40,879 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:12:41,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-06 13:12:41,072 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-02-06 13:12:41,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:12:41,073 INFO L85 PathProgramCache]: Analyzing trace with hash 269483246, now seen corresponding path program 3 times [2025-02-06 13:12:41,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:12:41,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124220592] [2025-02-06 13:12:41,073 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 13:12:41,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:12:41,090 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 3 equivalence classes. [2025-02-06 13:12:41,098 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 32 of 34 statements. [2025-02-06 13:12:41,098 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 13:12:41,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:12:41,190 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 13:12:41,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:12:41,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124220592] [2025-02-06 13:12:41,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124220592] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:12:41,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230509459] [2025-02-06 13:12:41,190 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 13:12:41,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:12:41,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:12:41,193 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:12:41,194 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:12:41,231 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 3 equivalence classes. [2025-02-06 13:12:41,249 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 32 of 34 statements. [2025-02-06 13:12:41,249 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 13:12:41,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:12:41,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 13:12:41,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:12:41,394 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 13:12:41,395 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:12:41,425 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-06 13:12:41,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2025-02-06 13:12:41,461 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 13:12:41,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230509459] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:12:41,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:12:41,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 5] total 13 [2025-02-06 13:12:41,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946833642] [2025-02-06 13:12:41,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:12:41,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 13:12:41,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:12:41,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 13:12:41,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-02-06 13:12:41,468 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-02-06 13:12:41,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 190 flow. Second operand has 14 states, 14 states have (on average 11.785714285714286) internal successors, (165), 14 states have internal predecessors, (165), 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:12:41,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:12:41,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-02-06 13:12:41,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:12:41,845 INFO L124 PetriNetUnfolderBase]: 959/1673 cut-off events. [2025-02-06 13:12:41,846 INFO L125 PetriNetUnfolderBase]: For 2490/2490 co-relation queries the response was YES. [2025-02-06 13:12:41,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4493 conditions, 1673 events. 959/1673 cut-off events. For 2490/2490 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 7551 event pairs, 140 based on Foata normal form. 4/1415 useless extension candidates. Maximal degree in co-relation 4462. Up to 300 conditions per place. [2025-02-06 13:12:41,852 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 84 selfloop transitions, 16 changer transitions 45/148 dead transitions. [2025-02-06 13:12:41,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 148 transitions, 810 flow [2025-02-06 13:12:41,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 13:12:41,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-06 13:12:41,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 239 transitions. [2025-02-06 13:12:41,855 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5382882882882883 [2025-02-06 13:12:41,855 INFO L175 Difference]: Start difference. First operand has 47 places, 36 transitions, 190 flow. Second operand 12 states and 239 transitions. [2025-02-06 13:12:41,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 148 transitions, 810 flow [2025-02-06 13:12:41,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 148 transitions, 742 flow, removed 34 selfloop flow, removed 3 redundant places. [2025-02-06 13:12:41,860 INFO L231 Difference]: Finished difference. Result has 56 places, 42 transitions, 265 flow [2025-02-06 13:12:41,860 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=265, PETRI_PLACES=56, PETRI_TRANSITIONS=42} [2025-02-06 13:12:41,861 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 20 predicate places. [2025-02-06 13:12:41,861 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 42 transitions, 265 flow [2025-02-06 13:12:41,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 11.785714285714286) internal successors, (165), 14 states have internal predecessors, (165), 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:12:41,862 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:12:41,862 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:12:41,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 13:12:42,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-06 13:12:42,062 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-02-06 13:12:42,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:12:42,063 INFO L85 PathProgramCache]: Analyzing trace with hash -2084630832, now seen corresponding path program 4 times [2025-02-06 13:12:42,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:12:42,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126302029] [2025-02-06 13:12:42,063 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 13:12:42,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:12:42,070 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-02-06 13:12:42,087 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 13:12:42,087 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 13:12:42,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:12:42,211 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 13:12:42,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:12:42,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126302029] [2025-02-06 13:12:42,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126302029] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:12:42,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278651408] [2025-02-06 13:12:42,211 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 13:12:42,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:12:42,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:12:42,217 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:12:42,217 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:12:42,254 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-02-06 13:12:42,279 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 13:12:42,279 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 13:12:42,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:12:42,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 13:12:42,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:12:46,447 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 5 refuted. 1 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 13:12:46,447 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:12:46,514 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-06 13:12:46,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 11 [2025-02-06 13:12:46,553 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 13:12:46,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278651408] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:12:46,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:12:46,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-02-06 13:12:46,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724369100] [2025-02-06 13:12:46,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:12:46,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 13:12:46,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:12:46,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 13:12:46,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=116, Unknown=1, NotChecked=0, Total=156 [2025-02-06 13:12:46,554 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-02-06 13:12:46,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 42 transitions, 265 flow. Second operand has 13 states, 13 states have (on average 12.76923076923077) internal successors, (166), 13 states have internal predecessors, (166), 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:12:46,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:12:46,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-02-06 13:12:46,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:12:47,342 INFO L124 PetriNetUnfolderBase]: 2718/4674 cut-off events. [2025-02-06 13:12:47,342 INFO L125 PetriNetUnfolderBase]: For 6985/6985 co-relation queries the response was YES. [2025-02-06 13:12:47,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12205 conditions, 4674 events. 2718/4674 cut-off events. For 6985/6985 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 25481 event pairs, 176 based on Foata normal form. 24/3972 useless extension candidates. Maximal degree in co-relation 12170. Up to 850 conditions per place. [2025-02-06 13:12:47,354 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 124 selfloop transitions, 43 changer transitions 66/236 dead transitions. [2025-02-06 13:12:47,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 236 transitions, 1455 flow [2025-02-06 13:12:47,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 13:12:47,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-02-06 13:12:47,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 349 transitions. [2025-02-06 13:12:47,356 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.589527027027027 [2025-02-06 13:12:47,356 INFO L175 Difference]: Start difference. First operand has 56 places, 42 transitions, 265 flow. Second operand 16 states and 349 transitions. [2025-02-06 13:12:47,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 236 transitions, 1455 flow [2025-02-06 13:12:47,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 236 transitions, 1295 flow, removed 62 selfloop flow, removed 6 redundant places. [2025-02-06 13:12:47,365 INFO L231 Difference]: Finished difference. Result has 78 places, 70 transitions, 652 flow [2025-02-06 13:12:47,365 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=652, PETRI_PLACES=78, PETRI_TRANSITIONS=70} [2025-02-06 13:12:47,365 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 42 predicate places. [2025-02-06 13:12:47,365 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 70 transitions, 652 flow [2025-02-06 13:12:47,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.76923076923077) internal successors, (166), 13 states have internal predecessors, (166), 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:12:47,366 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:12:47,366 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:12:47,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-06 13:12:47,570 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,SelfDestructingSolverStorable12 [2025-02-06 13:12:47,570 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-02-06 13:12:47,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:12:47,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1517178927, now seen corresponding path program 5 times [2025-02-06 13:12:47,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:12:47,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029109709] [2025-02-06 13:12:47,571 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 13:12:47,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:12:47,583 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 3 equivalence classes. [2025-02-06 13:12:47,593 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 13:12:47,593 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-02-06 13:12:47,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:12:47,703 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 13:12:47,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:12:47,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029109709] [2025-02-06 13:12:47,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029109709] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:12:47,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822163699] [2025-02-06 13:12:47,704 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 13:12:47,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:12:47,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:12:47,708 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:12:47,711 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:12:47,778 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 3 equivalence classes. [2025-02-06 13:12:47,801 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 13:12:47,801 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-02-06 13:12:47,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:12:47,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 13:12:47,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:12:47,977 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-06 13:12:47,977 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:12:48,117 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-06 13:12:48,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822163699] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:12:48,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:12:48,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 19 [2025-02-06 13:12:48,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125691090] [2025-02-06 13:12:48,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:12:48,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-06 13:12:48,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:12:48,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-06 13:12:48,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2025-02-06 13:12:48,147 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-02-06 13:12:48,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 70 transitions, 652 flow. Second operand has 20 states, 20 states have (on average 11.55) internal successors, (231), 20 states have internal predecessors, (231), 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:12:48,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:12:48,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-02-06 13:12:48,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:12:48,929 INFO L124 PetriNetUnfolderBase]: 3384/5890 cut-off events. [2025-02-06 13:12:48,929 INFO L125 PetriNetUnfolderBase]: For 14192/14192 co-relation queries the response was YES. [2025-02-06 13:12:48,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16406 conditions, 5890 events. 3384/5890 cut-off events. For 14192/14192 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 35246 event pairs, 2456 based on Foata normal form. 51/5018 useless extension candidates. Maximal degree in co-relation 15871. Up to 4666 conditions per place. [2025-02-06 13:12:48,947 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 63 selfloop transitions, 6 changer transitions 96/168 dead transitions. [2025-02-06 13:12:48,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 168 transitions, 1292 flow [2025-02-06 13:12:48,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 13:12:48,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-06 13:12:48,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 229 transitions. [2025-02-06 13:12:48,948 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4760914760914761 [2025-02-06 13:12:48,948 INFO L175 Difference]: Start difference. First operand has 78 places, 70 transitions, 652 flow. Second operand 13 states and 229 transitions. [2025-02-06 13:12:48,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 168 transitions, 1292 flow [2025-02-06 13:12:48,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 168 transitions, 1180 flow, removed 51 selfloop flow, removed 3 redundant places. [2025-02-06 13:12:48,977 INFO L231 Difference]: Finished difference. Result has 96 places, 72 transitions, 602 flow [2025-02-06 13:12:48,977 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=550, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=602, PETRI_PLACES=96, PETRI_TRANSITIONS=72} [2025-02-06 13:12:48,977 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 60 predicate places. [2025-02-06 13:12:48,977 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 72 transitions, 602 flow [2025-02-06 13:12:48,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 11.55) internal successors, (231), 20 states have internal predecessors, (231), 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:12:48,977 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:12:48,977 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:12:48,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-06 13:12:49,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:12:49,178 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-02-06 13:12:49,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:12:49,178 INFO L85 PathProgramCache]: Analyzing trace with hash -165619074, now seen corresponding path program 6 times [2025-02-06 13:12:49,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:12:49,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088767743] [2025-02-06 13:12:49,179 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 13:12:49,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:12:49,186 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 42 statements into 4 equivalence classes. [2025-02-06 13:12:49,216 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 13:12:49,216 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-02-06 13:12:49,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:12:50,003 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 13:12:50,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:12:50,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088767743] [2025-02-06 13:12:50,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088767743] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:12:50,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807137907] [2025-02-06 13:12:50,004 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 13:12:50,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:12:50,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:12:50,006 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:12:50,016 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:12:50,059 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 42 statements into 4 equivalence classes. [2025-02-06 13:12:50,257 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 13:12:50,258 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-02-06 13:12:50,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:12:50,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 13:12:50,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:12:50,428 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-06 13:12:50,428 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:12:50,458 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-06 13:12:50,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 11 [2025-02-06 13:12:50,485 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-06 13:12:50,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807137907] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:12:50,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:12:50,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 18 [2025-02-06 13:12:50,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499449544] [2025-02-06 13:12:50,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:12:50,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 13:12:50,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:12:50,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 13:12:50,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2025-02-06 13:12:50,598 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-02-06 13:12:50,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 72 transitions, 602 flow. Second operand has 19 states, 19 states have (on average 11.631578947368421) internal successors, (221), 19 states have internal predecessors, (221), 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:12:50,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:12:50,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-02-06 13:12:50,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:12:51,952 INFO L124 PetriNetUnfolderBase]: 3388/5840 cut-off events. [2025-02-06 13:12:51,952 INFO L125 PetriNetUnfolderBase]: For 14363/14363 co-relation queries the response was YES. [2025-02-06 13:12:51,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16376 conditions, 5840 events. 3388/5840 cut-off events. For 14363/14363 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 33387 event pairs, 388 based on Foata normal form. 2/4940 useless extension candidates. Maximal degree in co-relation 15889. Up to 1102 conditions per place. [2025-02-06 13:12:51,971 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 103 selfloop transitions, 53 changer transitions 103/262 dead transitions. [2025-02-06 13:12:51,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 262 transitions, 1790 flow [2025-02-06 13:12:51,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 13:12:51,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-02-06 13:12:51,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 387 transitions. [2025-02-06 13:12:51,976 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.522972972972973 [2025-02-06 13:12:51,976 INFO L175 Difference]: Start difference. First operand has 96 places, 72 transitions, 602 flow. Second operand 20 states and 387 transitions. [2025-02-06 13:12:51,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 262 transitions, 1790 flow [2025-02-06 13:12:52,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 262 transitions, 1748 flow, removed 19 selfloop flow, removed 9 redundant places. [2025-02-06 13:12:52,008 INFO L231 Difference]: Finished difference. Result has 102 places, 79 transitions, 760 flow [2025-02-06 13:12:52,008 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=760, PETRI_PLACES=102, PETRI_TRANSITIONS=79} [2025-02-06 13:12:52,008 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 66 predicate places. [2025-02-06 13:12:52,009 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 79 transitions, 760 flow [2025-02-06 13:12:52,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 11.631578947368421) internal successors, (221), 19 states have internal predecessors, (221), 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:12:52,009 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:12:52,009 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:12:52,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-06 13:12:52,209 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,SelfDestructingSolverStorable14 [2025-02-06 13:12:52,210 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-02-06 13:12:52,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:12:52,211 INFO L85 PathProgramCache]: Analyzing trace with hash 689619332, now seen corresponding path program 7 times [2025-02-06 13:12:52,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:12:52,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543196074] [2025-02-06 13:12:52,211 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 13:12:52,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:12:52,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-06 13:12:52,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 13:12:52,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:12:52,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:12:52,301 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-06 13:12:52,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:12:52,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543196074] [2025-02-06 13:12:52,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543196074] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:12:52,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1653319991] [2025-02-06 13:12:52,302 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 13:12:52,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:12:52,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:12:52,308 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:12:52,310 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:12:52,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-06 13:12:52,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 13:12:52,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:12:52,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:12:52,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 13:12:52,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:12:52,444 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-06 13:12:52,444 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:12:52,519 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-06 13:12:52,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1653319991] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:12:52,519 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:12:52,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2025-02-06 13:12:52,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169918324] [2025-02-06 13:12:52,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:12:52,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 13:12:52,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:12:52,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 13:12:52,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 13:12:52,520 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-02-06 13:12:52,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 79 transitions, 760 flow. Second operand has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 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:12:52,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:12:52,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-02-06 13:12:52,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:12:53,111 INFO L124 PetriNetUnfolderBase]: 5194/8942 cut-off events. [2025-02-06 13:12:53,111 INFO L125 PetriNetUnfolderBase]: For 28972/28972 co-relation queries the response was YES. [2025-02-06 13:12:53,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26424 conditions, 8942 events. 5194/8942 cut-off events. For 28972/28972 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 54099 event pairs, 1080 based on Foata normal form. 22/7575 useless extension candidates. Maximal degree in co-relation 26285. Up to 2214 conditions per place. [2025-02-06 13:12:53,144 INFO L140 encePairwiseOnDemand]: 34/37 looper letters, 98 selfloop transitions, 63 changer transitions 0/164 dead transitions. [2025-02-06 13:12:53,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 164 transitions, 1770 flow [2025-02-06 13:12:53,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:12:53,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 13:12:53,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2025-02-06 13:12:53,146 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5990990990990991 [2025-02-06 13:12:53,146 INFO L175 Difference]: Start difference. First operand has 102 places, 79 transitions, 760 flow. Second operand 6 states and 133 transitions. [2025-02-06 13:12:53,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 164 transitions, 1770 flow [2025-02-06 13:12:53,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 164 transitions, 1660 flow, removed 18 selfloop flow, removed 8 redundant places. [2025-02-06 13:12:53,170 INFO L231 Difference]: Finished difference. Result has 96 places, 108 transitions, 1248 flow [2025-02-06 13:12:53,170 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=714, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1248, PETRI_PLACES=96, PETRI_TRANSITIONS=108} [2025-02-06 13:12:53,171 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 60 predicate places. [2025-02-06 13:12:53,171 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 108 transitions, 1248 flow [2025-02-06 13:12:53,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 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:12:53,171 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:12:53,171 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:12:53,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-06 13:12:53,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:12:53,372 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-02-06 13:12:53,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:12:53,373 INFO L85 PathProgramCache]: Analyzing trace with hash 2083030712, now seen corresponding path program 8 times [2025-02-06 13:12:53,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:12:53,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533093544] [2025-02-06 13:12:53,373 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:12:53,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:12:53,381 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-02-06 13:12:53,394 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 13:12:53,395 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:12:53,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:12:53,778 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 3 proven. 53 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-06 13:12:53,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:12:53,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533093544] [2025-02-06 13:12:53,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533093544] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:12:53,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318424090] [2025-02-06 13:12:53,779 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:12:53,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:12:53,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:12:53,781 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:12:53,787 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:12:53,824 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-02-06 13:12:53,849 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 13:12:53,849 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:12:53,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:12:53,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 13:12:53,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:12:54,001 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-06 13:12:54,001 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:12:54,022 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-06 13:12:54,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2025-02-06 13:12:54,059 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-06 13:12:54,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318424090] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:12:54,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:12:54,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 17 [2025-02-06 13:12:54,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879820478] [2025-02-06 13:12:54,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:12:54,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 13:12:54,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:12:54,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 13:12:54,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2025-02-06 13:12:54,093 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-02-06 13:12:54,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 108 transitions, 1248 flow. Second operand has 18 states, 18 states have (on average 11.833333333333334) internal successors, (213), 18 states have internal predecessors, (213), 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:12:54,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:12:54,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-02-06 13:12:54,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:12:56,926 INFO L124 PetriNetUnfolderBase]: 11384/19742 cut-off events. [2025-02-06 13:12:56,926 INFO L125 PetriNetUnfolderBase]: For 79445/79445 co-relation queries the response was YES. [2025-02-06 13:12:56,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58693 conditions, 19742 events. 11384/19742 cut-off events. For 79445/79445 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 135817 event pairs, 1060 based on Foata normal form. 235/16881 useless extension candidates. Maximal degree in co-relation 57467. Up to 3650 conditions per place. [2025-02-06 13:12:56,983 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 430 selfloop transitions, 152 changer transitions 234/819 dead transitions. [2025-02-06 13:12:56,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 819 transitions, 6465 flow [2025-02-06 13:12:56,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-02-06 13:12:56,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2025-02-06 13:12:56,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 1185 transitions. [2025-02-06 13:12:56,986 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.561877667140825 [2025-02-06 13:12:56,986 INFO L175 Difference]: Start difference. First operand has 96 places, 108 transitions, 1248 flow. Second operand 57 states and 1185 transitions. [2025-02-06 13:12:56,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 819 transitions, 6465 flow [2025-02-06 13:12:57,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 819 transitions, 6277 flow, removed 94 selfloop flow, removed 0 redundant places. [2025-02-06 13:12:57,093 INFO L231 Difference]: Finished difference. Result has 172 places, 183 transitions, 2721 flow [2025-02-06 13:12:57,093 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1186, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=57, PETRI_FLOW=2721, PETRI_PLACES=172, PETRI_TRANSITIONS=183} [2025-02-06 13:12:57,093 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 136 predicate places. [2025-02-06 13:12:57,093 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 183 transitions, 2721 flow [2025-02-06 13:12:57,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 11.833333333333334) internal successors, (213), 18 states have internal predecessors, (213), 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:12:57,094 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:12:57,094 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:12:57,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-06 13:12:57,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-06 13:12:57,295 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-02-06 13:12:57,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:12:57,295 INFO L85 PathProgramCache]: Analyzing trace with hash 122808602, now seen corresponding path program 9 times [2025-02-06 13:12:57,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:12:57,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436711195] [2025-02-06 13:12:57,295 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 13:12:57,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:12:57,301 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 50 statements into 5 equivalence classes. [2025-02-06 13:12:57,335 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 48 of 50 statements. [2025-02-06 13:12:57,335 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-06 13:12:57,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:12:57,700 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 5 proven. 31 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-06 13:12:57,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:12:57,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436711195] [2025-02-06 13:12:57,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436711195] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:12:57,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146145975] [2025-02-06 13:12:57,700 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 13:12:57,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:12:57,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:12:57,702 INFO L229 MonitoredProcess]: Starting monitored process 12 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:12:57,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-06 13:12:57,743 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 50 statements into 5 equivalence classes. [2025-02-06 13:12:57,771 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 48 of 50 statements. [2025-02-06 13:12:57,772 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-06 13:12:57,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:12:57,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-06 13:12:57,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:12:58,026 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-06 13:12:58,027 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:12:58,104 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-06 13:12:58,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 11 [2025-02-06 13:12:58,167 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-06 13:12:58,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146145975] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:12:58,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:12:58,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 26 [2025-02-06 13:12:58,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742873945] [2025-02-06 13:12:58,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:12:58,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-06 13:12:58,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:12:58,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-06 13:12:58,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=580, Unknown=0, NotChecked=0, Total=702 [2025-02-06 13:12:58,177 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-02-06 13:12:58,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 183 transitions, 2721 flow. Second operand has 27 states, 27 states have (on average 11.74074074074074) internal successors, (317), 27 states have internal predecessors, (317), 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:12:58,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:12:58,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-02-06 13:12:58,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:13:04,164 INFO L124 PetriNetUnfolderBase]: 24183/41441 cut-off events. [2025-02-06 13:13:04,165 INFO L125 PetriNetUnfolderBase]: For 273589/273589 co-relation queries the response was YES. [2025-02-06 13:13:04,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136453 conditions, 41441 events. 24183/41441 cut-off events. For 273589/273589 co-relation queries the response was YES. Maximal size of possible extension queue 748. Compared 308056 event pairs, 1584 based on Foata normal form. 101/35105 useless extension candidates. Maximal degree in co-relation 135260. Up to 7625 conditions per place. [2025-02-06 13:13:04,510 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 446 selfloop transitions, 357 changer transitions 238/1044 dead transitions. [2025-02-06 13:13:04,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 1044 transitions, 11484 flow [2025-02-06 13:13:04,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-02-06 13:13:04,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2025-02-06 13:13:04,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 1202 transitions. [2025-02-06 13:13:04,515 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5801158301158301 [2025-02-06 13:13:04,515 INFO L175 Difference]: Start difference. First operand has 172 places, 183 transitions, 2721 flow. Second operand 56 states and 1202 transitions. [2025-02-06 13:13:04,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 1044 transitions, 11484 flow [2025-02-06 13:13:04,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 1044 transitions, 9904 flow, removed 624 selfloop flow, removed 11 redundant places. [2025-02-06 13:13:04,978 INFO L231 Difference]: Finished difference. Result has 236 places, 412 transitions, 7077 flow [2025-02-06 13:13:04,978 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1913, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=56, PETRI_FLOW=7077, PETRI_PLACES=236, PETRI_TRANSITIONS=412} [2025-02-06 13:13:04,980 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 200 predicate places. [2025-02-06 13:13:04,980 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 412 transitions, 7077 flow [2025-02-06 13:13:04,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 11.74074074074074) internal successors, (317), 27 states have internal predecessors, (317), 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:13:04,980 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:13:04,980 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:13:04,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-02-06 13:13:05,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-06 13:13:05,182 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-02-06 13:13:05,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:13:05,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1873367111, now seen corresponding path program 10 times [2025-02-06 13:13:05,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:13:05,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159780714] [2025-02-06 13:13:05,183 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 13:13:05,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:13:05,192 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-02-06 13:13:05,221 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-02-06 13:13:05,222 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 13:13:05,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:13:05,451 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 26 proven. 40 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 13:13:05,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:13:05,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159780714] [2025-02-06 13:13:05,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159780714] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:13:05,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326290452] [2025-02-06 13:13:05,451 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 13:13:05,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:13:05,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:13:05,457 INFO L229 MonitoredProcess]: Starting monitored process 13 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:13:05,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-06 13:13:05,499 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-02-06 13:13:05,561 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-02-06 13:13:05,561 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 13:13:05,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:13:05,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 13:13:05,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:13:05,920 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 26 proven. 40 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 13:13:05,922 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:13:06,237 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 16 proven. 50 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 13:13:06,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326290452] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:13:06,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:13:06,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2025-02-06 13:13:06,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785389846] [2025-02-06 13:13:06,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:13:06,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-02-06 13:13:06,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:13:06,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-02-06 13:13:06,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=904, Unknown=0, NotChecked=0, Total=1190 [2025-02-06 13:13:06,268 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-02-06 13:13:06,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 412 transitions, 7077 flow. Second operand has 35 states, 35 states have (on average 11.285714285714286) internal successors, (395), 35 states have internal predecessors, (395), 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:13:06,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:13:06,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-02-06 13:13:06,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:13:12,388 INFO L124 PetriNetUnfolderBase]: 21360/36656 cut-off events. [2025-02-06 13:13:12,388 INFO L125 PetriNetUnfolderBase]: For 259210/259210 co-relation queries the response was YES. [2025-02-06 13:13:12,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122626 conditions, 36656 events. 21360/36656 cut-off events. For 259210/259210 co-relation queries the response was YES. Maximal size of possible extension queue 688. Compared 277603 event pairs, 13662 based on Foata normal form. 198/31156 useless extension candidates. Maximal degree in co-relation 121414. Up to 24651 conditions per place. [2025-02-06 13:13:12,858 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 352 selfloop transitions, 121 changer transitions 29/505 dead transitions. [2025-02-06 13:13:12,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 505 transitions, 9430 flow [2025-02-06 13:13:12,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 13:13:12,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-02-06 13:13:12,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 239 transitions. [2025-02-06 13:13:12,859 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4613899613899614 [2025-02-06 13:13:12,859 INFO L175 Difference]: Start difference. First operand has 236 places, 412 transitions, 7077 flow. Second operand 14 states and 239 transitions. [2025-02-06 13:13:12,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 505 transitions, 9430 flow [2025-02-06 13:13:14,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 505 transitions, 6437 flow, removed 1445 selfloop flow, removed 13 redundant places. [2025-02-06 13:13:14,253 INFO L231 Difference]: Finished difference. Result has 223 places, 398 transitions, 5101 flow [2025-02-06 13:13:14,254 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4337, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=5101, PETRI_PLACES=223, PETRI_TRANSITIONS=398} [2025-02-06 13:13:14,254 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 187 predicate places. [2025-02-06 13:13:14,254 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 398 transitions, 5101 flow [2025-02-06 13:13:14,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 11.285714285714286) internal successors, (395), 35 states have internal predecessors, (395), 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:13:14,254 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:13:14,254 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:13:14,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-06 13:13:14,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:13:14,455 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-02-06 13:13:14,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:13:14,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1575438072, now seen corresponding path program 11 times [2025-02-06 13:13:14,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:13:14,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911191443] [2025-02-06 13:13:14,456 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 13:13:14,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:13:14,466 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 58 statements into 6 equivalence classes. [2025-02-06 13:13:14,493 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 13:13:14,493 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-02-06 13:13:14,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:13:15,101 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 13:13:15,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:13:15,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911191443] [2025-02-06 13:13:15,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911191443] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:13:15,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966090767] [2025-02-06 13:13:15,102 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 13:13:15,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:13:15,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:13:15,107 INFO L229 MonitoredProcess]: Starting monitored process 14 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:13:15,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-06 13:13:15,157 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 58 statements into 6 equivalence classes. [2025-02-06 13:13:15,207 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 13:13:15,207 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-02-06 13:13:15,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:13:15,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-02-06 13:13:15,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:13:15,735 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 97 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 13:13:15,736 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:13:15,808 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-06 13:13:15,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 11 [2025-02-06 13:13:15,993 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-06 13:13:15,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966090767] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:13:15,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:13:15,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 12] total 39 [2025-02-06 13:13:15,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826945191] [2025-02-06 13:13:15,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:13:15,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-02-06 13:13:15,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:13:15,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-02-06 13:13:16,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1439, Unknown=0, NotChecked=0, Total=1560 [2025-02-06 13:13:16,105 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-02-06 13:13:16,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 398 transitions, 5101 flow. Second operand has 40 states, 40 states have (on average 11.375) internal successors, (455), 40 states have internal predecessors, (455), 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:13:16,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:13:16,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-02-06 13:13:16,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:13:28,242 INFO L124 PetriNetUnfolderBase]: 40458/69262 cut-off events. [2025-02-06 13:13:28,243 INFO L125 PetriNetUnfolderBase]: For 164882/164882 co-relation queries the response was YES. [2025-02-06 13:13:28,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188287 conditions, 69262 events. 40458/69262 cut-off events. For 164882/164882 co-relation queries the response was YES. Maximal size of possible extension queue 1184. Compared 552015 event pairs, 2404 based on Foata normal form. 23/58503 useless extension candidates. Maximal degree in co-relation 187427. Up to 12800 conditions per place. [2025-02-06 13:13:29,066 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 471 selfloop transitions, 495 changer transitions 498/1467 dead transitions. [2025-02-06 13:13:29,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 1467 transitions, 14223 flow [2025-02-06 13:13:29,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2025-02-06 13:13:29,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2025-02-06 13:13:29,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 1352 transitions. [2025-02-06 13:13:29,069 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.54538120209762 [2025-02-06 13:13:29,069 INFO L175 Difference]: Start difference. First operand has 223 places, 398 transitions, 5101 flow. Second operand 67 states and 1352 transitions. [2025-02-06 13:13:29,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 1467 transitions, 14223 flow [2025-02-06 13:13:30,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 1467 transitions, 13676 flow, removed 268 selfloop flow, removed 5 redundant places. [2025-02-06 13:13:30,478 INFO L231 Difference]: Finished difference. Result has 294 places, 532 transitions, 7296 flow [2025-02-06 13:13:30,479 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4716, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=249, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=67, PETRI_FLOW=7296, PETRI_PLACES=294, PETRI_TRANSITIONS=532} [2025-02-06 13:13:30,479 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 258 predicate places. [2025-02-06 13:13:30,479 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 532 transitions, 7296 flow [2025-02-06 13:13:30,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 11.375) internal successors, (455), 40 states have internal predecessors, (455), 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:13:30,480 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:13:30,480 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:13:30,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-02-06 13:13:30,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:13:30,684 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-02-06 13:13:30,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:13:30,685 INFO L85 PathProgramCache]: Analyzing trace with hash -511645425, now seen corresponding path program 12 times [2025-02-06 13:13:30,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:13:30,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692276456] [2025-02-06 13:13:30,685 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 13:13:30,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:13:30,699 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 61 statements into 6 equivalence classes. [2025-02-06 13:13:30,733 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 61 of 61 statements. [2025-02-06 13:13:30,733 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-02-06 13:13:30,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:13:31,088 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 40 proven. 63 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 13:13:31,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:13:31,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692276456] [2025-02-06 13:13:31,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692276456] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:13:31,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898944306] [2025-02-06 13:13:31,089 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 13:13:31,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:13:31,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:13:31,091 INFO L229 MonitoredProcess]: Starting monitored process 15 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:13:31,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-06 13:13:31,147 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 61 statements into 6 equivalence classes. [2025-02-06 13:13:31,205 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 61 of 61 statements. [2025-02-06 13:13:31,205 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-02-06 13:13:31,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:13:31,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 13:13:31,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:13:31,410 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 45 proven. 58 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 13:13:31,410 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:13:31,735 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 45 proven. 58 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 13:13:31,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898944306] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:13:31,736 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:13:31,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 29 [2025-02-06 13:13:31,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244559597] [2025-02-06 13:13:31,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:13:31,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-06 13:13:31,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:13:31,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-06 13:13:31,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=668, Unknown=0, NotChecked=0, Total=870 [2025-02-06 13:13:31,773 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-02-06 13:13:31,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 532 transitions, 7296 flow. Second operand has 30 states, 30 states have (on average 11.2) internal successors, (336), 30 states have internal predecessors, (336), 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:13:31,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:13:31,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-02-06 13:13:31,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand