./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 2d41b1dc1d5d7eec1f1fd4e3cbbef0194aa2dded6486a15b383e9bb8fe1468a3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:10:06,821 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:10:06,871 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:10:06,876 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:10:06,876 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:10:06,888 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:10:06,889 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:10:06,889 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:10:06,889 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:10:06,889 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:10:06,889 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:10:06,889 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:10:06,890 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:10:06,890 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:10:06,890 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:10:06,890 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:10:06,890 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:10:06,890 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:10:06,890 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:10:06,890 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:10:06,890 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:10:06,891 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:10:06,891 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:10:06,891 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:10:06,891 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:10:06,891 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:10:06,891 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:10:06,891 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:10:06,891 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:10:06,891 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:10:06,891 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:10:06,891 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:10:06,891 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:10:06,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:10:06,892 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:10:06,892 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:10:06,892 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:10:06,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:10:06,892 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:10:06,892 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:10:06,892 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:10:06,892 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:10:06,892 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/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 -> 2d41b1dc1d5d7eec1f1fd4e3cbbef0194aa2dded6486a15b383e9bb8fe1468a3 [2025-03-04 10:10:07,100 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:10:07,106 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:10:07,108 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:10:07,109 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:10:07,110 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:10:07,110 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c [2025-03-04 10:10:08,244 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c63caf621/fada31e62cc545f781d67cfa8b75a1c6/FLAG12b25586d [2025-03-04 10:10:08,506 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:10:08,508 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c [2025-03-04 10:10:08,517 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c63caf621/fada31e62cc545f781d67cfa8b75a1c6/FLAG12b25586d [2025-03-04 10:10:08,533 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c63caf621/fada31e62cc545f781d67cfa8b75a1c6 [2025-03-04 10:10:08,535 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:10:08,536 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:10:08,538 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:10:08,539 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:10:08,542 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:10:08,543 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:10:08" (1/1) ... [2025-03-04 10:10:08,545 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b63ad30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:08, skipping insertion in model container [2025-03-04 10:10:08,545 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:10:08" (1/1) ... [2025-03-04 10:10:08,561 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:10:08,706 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 10:10:08,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:10:08,722 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:10:08,749 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:10:08,766 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:10:08,767 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:08 WrapperNode [2025-03-04 10:10:08,767 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:10:08,768 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:10:08,768 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:10:08,768 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:10:08,773 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:08" (1/1) ... [2025-03-04 10:10:08,782 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:08" (1/1) ... [2025-03-04 10:10:08,803 INFO L138 Inliner]: procedures = 26, calls = 54, calls flagged for inlining = 19, calls inlined = 23, statements flattened = 247 [2025-03-04 10:10:08,803 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:10:08,804 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:10:08,804 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:10:08,804 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:10:08,810 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:08" (1/1) ... [2025-03-04 10:10:08,810 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:08" (1/1) ... [2025-03-04 10:10:08,812 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:08" (1/1) ... [2025-03-04 10:10:08,833 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 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-03-04 10:10:08,833 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:08" (1/1) ... [2025-03-04 10:10:08,833 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:08" (1/1) ... [2025-03-04 10:10:08,840 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:08" (1/1) ... [2025-03-04 10:10:08,842 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:08" (1/1) ... [2025-03-04 10:10:08,843 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:08" (1/1) ... [2025-03-04 10:10:08,844 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:08" (1/1) ... [2025-03-04 10:10:08,846 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:10:08,847 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:10:08,847 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:10:08,847 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:10:08,848 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:08" (1/1) ... [2025-03-04 10:10:08,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:10:08,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:10:08,872 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:10:08,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:10:08,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:10:08,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:10:08,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:10:08,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:10:08,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:10:08,888 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 10:10:08,888 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 10:10:08,888 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 10:10:08,888 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 10:10:08,888 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 10:10:08,888 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 10:10:08,889 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-04 10:10:08,889 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-04 10:10:08,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:10:08,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:10:08,889 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 10:10:08,889 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 10:10:08,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 10:10:08,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:10:08,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:10:08,890 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 10:10:08,978 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:10:08,979 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:10:09,349 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:10:09,349 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:10:09,594 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:10:09,594 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:10:09,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:10:09 BoogieIcfgContainer [2025-03-04 10:10:09,595 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:10:09,596 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:10:09,596 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:10:09,627 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:10:09,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:10:08" (1/3) ... [2025-03-04 10:10:09,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bd445f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:10:09, skipping insertion in model container [2025-03-04 10:10:09,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:08" (2/3) ... [2025-03-04 10:10:09,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bd445f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:10:09, skipping insertion in model container [2025-03-04 10:10:09,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:10:09" (3/3) ... [2025-03-04 10:10:09,630 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-equiv.wvr.c [2025-03-04 10:10:09,643 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:10:09,645 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-parallel-sum-equiv.wvr.c that has 5 procedures, 59 locations, 1 initial locations, 4 loop locations, and 10 error locations. [2025-03-04 10:10:09,645 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:10:09,711 INFO L143 ThreadInstanceAdder]: Constructed 10 joinOtherThreadTransitions. [2025-03-04 10:10:09,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 70 transitions, 180 flow [2025-03-04 10:10:09,778 INFO L124 PetriNetUnfolderBase]: 9/63 cut-off events. [2025-03-04 10:10:09,782 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 10:10:09,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 63 events. 9/63 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 59. Up to 3 conditions per place. [2025-03-04 10:10:09,787 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 70 transitions, 180 flow [2025-03-04 10:10:09,789 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 62 transitions, 154 flow [2025-03-04 10:10:09,799 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:10:09,808 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;@452c4a4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:10:09,808 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-03-04 10:10:09,811 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:10:09,812 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-04 10:10:09,812 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:10:09,812 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:09,812 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:10:09,813 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:10:09,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:09,817 INFO L85 PathProgramCache]: Analyzing trace with hash 729952, now seen corresponding path program 1 times [2025-03-04 10:10:09,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:09,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970251408] [2025-03-04 10:10:09,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:09,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:09,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:10:09,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:10:09,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:09,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:10,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:10:10,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:10,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970251408] [2025-03-04 10:10:10,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970251408] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:10,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:10,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:10:10,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653091722] [2025-03-04 10:10:10,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:10,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:10:10,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:10,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:10:10,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:10:10,076 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 72 [2025-03-04 10:10:10,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 62 transitions, 154 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-03-04 10:10:10,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:10,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 72 [2025-03-04 10:10:10,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:11,429 INFO L124 PetriNetUnfolderBase]: 14986/20198 cut-off events. [2025-03-04 10:10:11,430 INFO L125 PetriNetUnfolderBase]: For 1062/1062 co-relation queries the response was YES. [2025-03-04 10:10:11,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41822 conditions, 20198 events. 14986/20198 cut-off events. For 1062/1062 co-relation queries the response was YES. Maximal size of possible extension queue 749. Compared 103947 event pairs, 13324 based on Foata normal form. 1/15683 useless extension candidates. Maximal degree in co-relation 41747. Up to 20169 conditions per place. [2025-03-04 10:10:11,566 INFO L140 encePairwiseOnDemand]: 65/72 looper letters, 49 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2025-03-04 10:10:11,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 56 transitions, 244 flow [2025-03-04 10:10:11,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:10:11,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:10:11,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2025-03-04 10:10:11,578 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39814814814814814 [2025-03-04 10:10:11,579 INFO L175 Difference]: Start difference. First operand has 66 places, 62 transitions, 154 flow. Second operand 3 states and 86 transitions. [2025-03-04 10:10:11,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 56 transitions, 244 flow [2025-03-04 10:10:11,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 56 transitions, 224 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-04 10:10:11,598 INFO L231 Difference]: Finished difference. Result has 57 places, 56 transitions, 126 flow [2025-03-04 10:10:11,600 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=57, PETRI_TRANSITIONS=56} [2025-03-04 10:10:11,604 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -9 predicate places. [2025-03-04 10:10:11,605 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 56 transitions, 126 flow [2025-03-04 10:10:11,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-03-04 10:10:11,605 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:11,605 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:10:11,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:10:11,606 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:10:11,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:11,607 INFO L85 PathProgramCache]: Analyzing trace with hash 729953, now seen corresponding path program 1 times [2025-03-04 10:10:11,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:11,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507012525] [2025-03-04 10:10:11,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:11,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:11,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:10:11,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:10:11,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:11,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:11,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:10:11,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:11,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507012525] [2025-03-04 10:10:11,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507012525] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:11,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:11,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:10:11,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455150058] [2025-03-04 10:10:11,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:11,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:10:11,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:11,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:10:11,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:10:11,960 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 72 [2025-03-04 10:10:11,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 56 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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-03-04 10:10:11,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:11,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 72 [2025-03-04 10:10:11,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:13,064 INFO L124 PetriNetUnfolderBase]: 14987/20201 cut-off events. [2025-03-04 10:10:13,064 INFO L125 PetriNetUnfolderBase]: For 176/176 co-relation queries the response was YES. [2025-03-04 10:10:13,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40858 conditions, 20201 events. 14987/20201 cut-off events. For 176/176 co-relation queries the response was YES. Maximal size of possible extension queue 749. Compared 103846 event pairs, 13324 based on Foata normal form. 0/15685 useless extension candidates. Maximal degree in co-relation 40836. Up to 20174 conditions per place. [2025-03-04 10:10:13,128 INFO L140 encePairwiseOnDemand]: 67/72 looper letters, 51 selfloop transitions, 4 changer transitions 0/59 dead transitions. [2025-03-04 10:10:13,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 59 transitions, 244 flow [2025-03-04 10:10:13,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:10:13,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:10:13,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2025-03-04 10:10:13,131 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2025-03-04 10:10:13,131 INFO L175 Difference]: Start difference. First operand has 57 places, 56 transitions, 126 flow. Second operand 4 states and 96 transitions. [2025-03-04 10:10:13,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 59 transitions, 244 flow [2025-03-04 10:10:13,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 59 transitions, 238 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:10:13,133 INFO L231 Difference]: Finished difference. Result has 60 places, 59 transitions, 149 flow [2025-03-04 10:10:13,134 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=149, PETRI_PLACES=60, PETRI_TRANSITIONS=59} [2025-03-04 10:10:13,134 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -6 predicate places. [2025-03-04 10:10:13,134 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 59 transitions, 149 flow [2025-03-04 10:10:13,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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-03-04 10:10:13,136 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:13,136 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-04 10:10:13,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:10:13,136 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:10:13,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:13,137 INFO L85 PathProgramCache]: Analyzing trace with hash 701507490, now seen corresponding path program 1 times [2025-03-04 10:10:13,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:13,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086240199] [2025-03-04 10:10:13,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:13,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:13,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:10:13,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:10:13,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:13,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:13,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:10:13,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:13,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086240199] [2025-03-04 10:10:13,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086240199] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:10:13,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089021934] [2025-03-04 10:10:13,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:13,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:10:13,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:10:13,393 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:10:13,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:10:13,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:10:13,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:10:13,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:13,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:13,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:10:13,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:10:13,493 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-03-04 10:10:13,667 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:10:13,668 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:10:13,773 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:10:13,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089021934] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:10:13,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:10:13,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-04 10:10:13,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58358982] [2025-03-04 10:10:13,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:10:13,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:10:13,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:13,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:10:13,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:10:13,800 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 72 [2025-03-04 10:10:13,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 59 transitions, 149 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 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-03-04 10:10:13,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:13,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 72 [2025-03-04 10:10:13,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:14,769 INFO L124 PetriNetUnfolderBase]: 14987/20200 cut-off events. [2025-03-04 10:10:14,769 INFO L125 PetriNetUnfolderBase]: For 176/176 co-relation queries the response was YES. [2025-03-04 10:10:14,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40865 conditions, 20200 events. 14987/20200 cut-off events. For 176/176 co-relation queries the response was YES. Maximal size of possible extension queue 749. Compared 104002 event pairs, 13324 based on Foata normal form. 0/15684 useless extension candidates. Maximal degree in co-relation 40843. Up to 20170 conditions per place. [2025-03-04 10:10:14,861 INFO L140 encePairwiseOnDemand]: 67/72 looper letters, 47 selfloop transitions, 7 changer transitions 0/58 dead transitions. [2025-03-04 10:10:14,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 58 transitions, 253 flow [2025-03-04 10:10:14,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:10:14,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:10:14,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2025-03-04 10:10:14,862 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2662037037037037 [2025-03-04 10:10:14,862 INFO L175 Difference]: Start difference. First operand has 60 places, 59 transitions, 149 flow. Second operand 6 states and 115 transitions. [2025-03-04 10:10:14,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 58 transitions, 253 flow [2025-03-04 10:10:14,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 58 transitions, 250 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:10:14,864 INFO L231 Difference]: Finished difference. Result has 63 places, 58 transitions, 156 flow [2025-03-04 10:10:14,864 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=156, PETRI_PLACES=63, PETRI_TRANSITIONS=58} [2025-03-04 10:10:14,864 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -3 predicate places. [2025-03-04 10:10:14,864 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 58 transitions, 156 flow [2025-03-04 10:10:14,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 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-03-04 10:10:14,864 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:14,864 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:10:14,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 10:10:15,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:10:15,066 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread4Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:10:15,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:15,067 INFO L85 PathProgramCache]: Analyzing trace with hash -387183865, now seen corresponding path program 1 times [2025-03-04 10:10:15,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:15,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068136033] [2025-03-04 10:10:15,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:15,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:15,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:10:15,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:10:15,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:15,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:15,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:10:15,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:15,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068136033] [2025-03-04 10:10:15,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068136033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:15,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:15,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:10:15,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624388584] [2025-03-04 10:10:15,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:15,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:10:15,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:15,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:10:15,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:10:15,158 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 72 [2025-03-04 10:10:15,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 58 transitions, 156 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-03-04 10:10:15,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:15,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 72 [2025-03-04 10:10:15,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:15,892 INFO L124 PetriNetUnfolderBase]: 11187/15107 cut-off events. [2025-03-04 10:10:15,893 INFO L125 PetriNetUnfolderBase]: For 140/140 co-relation queries the response was YES. [2025-03-04 10:10:15,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30601 conditions, 15107 events. 11187/15107 cut-off events. For 140/140 co-relation queries the response was YES. Maximal size of possible extension queue 552. Compared 74431 event pairs, 9814 based on Foata normal form. 0/12548 useless extension candidates. Maximal degree in co-relation 30575. Up to 15076 conditions per place. [2025-03-04 10:10:15,968 INFO L140 encePairwiseOnDemand]: 67/72 looper letters, 48 selfloop transitions, 3 changer transitions 0/55 dead transitions. [2025-03-04 10:10:15,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 55 transitions, 252 flow [2025-03-04 10:10:15,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:10:15,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:10:15,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2025-03-04 10:10:15,970 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3159722222222222 [2025-03-04 10:10:15,970 INFO L175 Difference]: Start difference. First operand has 63 places, 58 transitions, 156 flow. Second operand 4 states and 91 transitions. [2025-03-04 10:10:15,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 55 transitions, 252 flow [2025-03-04 10:10:15,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 55 transitions, 222 flow, removed 3 selfloop flow, removed 7 redundant places. [2025-03-04 10:10:15,971 INFO L231 Difference]: Finished difference. Result has 56 places, 55 transitions, 126 flow [2025-03-04 10:10:15,971 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=126, PETRI_PLACES=56, PETRI_TRANSITIONS=55} [2025-03-04 10:10:15,972 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -10 predicate places. [2025-03-04 10:10:15,972 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 55 transitions, 126 flow [2025-03-04 10:10:15,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-03-04 10:10:15,972 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:15,972 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:10:15,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:10:15,972 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread4Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:10:15,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:15,973 INFO L85 PathProgramCache]: Analyzing trace with hash -387183864, now seen corresponding path program 1 times [2025-03-04 10:10:15,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:15,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475418283] [2025-03-04 10:10:15,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:15,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:15,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:10:15,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:10:15,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:15,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:16,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:10:16,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:16,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475418283] [2025-03-04 10:10:16,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475418283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:16,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:16,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:10:16,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069979770] [2025-03-04 10:10:16,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:16,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:10:16,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:16,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:10:16,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:10:16,048 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 72 [2025-03-04 10:10:16,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 55 transitions, 126 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:16,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:16,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 72 [2025-03-04 10:10:16,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:17,140 INFO L124 PetriNetUnfolderBase]: 19693/26747 cut-off events. [2025-03-04 10:10:17,141 INFO L125 PetriNetUnfolderBase]: For 294/294 co-relation queries the response was YES. [2025-03-04 10:10:17,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54196 conditions, 26747 events. 19693/26747 cut-off events. For 294/294 co-relation queries the response was YES. Maximal size of possible extension queue 910. Compared 147061 event pairs, 11285 based on Foata normal form. 391/22809 useless extension candidates. Maximal degree in co-relation 30487. Up to 15035 conditions per place. [2025-03-04 10:10:17,246 INFO L140 encePairwiseOnDemand]: 66/72 looper letters, 118 selfloop transitions, 4 changer transitions 0/126 dead transitions. [2025-03-04 10:10:17,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 126 transitions, 529 flow [2025-03-04 10:10:17,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:10:17,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:10:17,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 179 transitions. [2025-03-04 10:10:17,247 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49722222222222223 [2025-03-04 10:10:17,247 INFO L175 Difference]: Start difference. First operand has 56 places, 55 transitions, 126 flow. Second operand 5 states and 179 transitions. [2025-03-04 10:10:17,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 126 transitions, 529 flow [2025-03-04 10:10:17,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 126 transitions, 525 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:10:17,249 INFO L231 Difference]: Finished difference. Result has 60 places, 56 transitions, 141 flow [2025-03-04 10:10:17,249 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=141, PETRI_PLACES=60, PETRI_TRANSITIONS=56} [2025-03-04 10:10:17,250 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -6 predicate places. [2025-03-04 10:10:17,250 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 56 transitions, 141 flow [2025-03-04 10:10:17,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:17,250 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:17,250 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:10:17,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:10:17,250 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:10:17,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:17,250 INFO L85 PathProgramCache]: Analyzing trace with hash -451268357, now seen corresponding path program 1 times [2025-03-04 10:10:17,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:17,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645690193] [2025-03-04 10:10:17,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:17,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:17,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:10:17,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:10:17,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:17,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:17,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:10:17,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:17,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645690193] [2025-03-04 10:10:17,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645690193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:17,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:17,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:10:17,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705298767] [2025-03-04 10:10:17,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:17,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:10:17,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:17,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:10:17,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:10:17,327 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 72 [2025-03-04 10:10:17,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 56 transitions, 141 flow. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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-03-04 10:10:17,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:17,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 72 [2025-03-04 10:10:17,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:18,021 INFO L124 PetriNetUnfolderBase]: 14905/20422 cut-off events. [2025-03-04 10:10:18,021 INFO L125 PetriNetUnfolderBase]: For 1535/1535 co-relation queries the response was YES. [2025-03-04 10:10:18,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42932 conditions, 20422 events. 14905/20422 cut-off events. For 1535/1535 co-relation queries the response was YES. Maximal size of possible extension queue 706. Compared 108447 event pairs, 11441 based on Foata normal form. 432/17552 useless extension candidates. Maximal degree in co-relation 31741. Up to 15079 conditions per place. [2025-03-04 10:10:18,105 INFO L140 encePairwiseOnDemand]: 64/72 looper letters, 87 selfloop transitions, 4 changer transitions 4/99 dead transitions. [2025-03-04 10:10:18,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 99 transitions, 432 flow [2025-03-04 10:10:18,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:10:18,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:10:18,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 154 transitions. [2025-03-04 10:10:18,107 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42777777777777776 [2025-03-04 10:10:18,107 INFO L175 Difference]: Start difference. First operand has 60 places, 56 transitions, 141 flow. Second operand 5 states and 154 transitions. [2025-03-04 10:10:18,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 99 transitions, 432 flow [2025-03-04 10:10:18,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 99 transitions, 427 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:10:18,110 INFO L231 Difference]: Finished difference. Result has 64 places, 57 transitions, 159 flow [2025-03-04 10:10:18,110 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=159, PETRI_PLACES=64, PETRI_TRANSITIONS=57} [2025-03-04 10:10:18,110 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -2 predicate places. [2025-03-04 10:10:18,110 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 57 transitions, 159 flow [2025-03-04 10:10:18,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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-03-04 10:10:18,110 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:18,110 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:10:18,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:10:18,111 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread4Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:10:18,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:18,111 INFO L85 PathProgramCache]: Analyzing trace with hash 208071591, now seen corresponding path program 1 times [2025-03-04 10:10:18,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:18,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788502288] [2025-03-04 10:10:18,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:18,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:18,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:10:18,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:10:18,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:18,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:18,174 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:10:18,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:18,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788502288] [2025-03-04 10:10:18,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788502288] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:10:18,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575644421] [2025-03-04 10:10:18,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:18,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:10:18,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:10:18,176 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:10:18,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:10:18,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:10:18,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:10:18,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:18,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:18,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:10:18,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:10:18,268 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:10:18,268 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:10:18,308 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:10:18,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575644421] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:10:18,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:10:18,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-04 10:10:18,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579037816] [2025-03-04 10:10:18,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:10:18,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:10:18,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:18,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:10:18,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:10:18,318 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 72 [2025-03-04 10:10:18,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 57 transitions, 159 flow. Second operand has 12 states, 12 states have (on average 13.25) internal successors, (159), 12 states have internal predecessors, (159), 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-03-04 10:10:18,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:18,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 72 [2025-03-04 10:10:18,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:19,519 INFO L124 PetriNetUnfolderBase]: 23412/32029 cut-off events. [2025-03-04 10:10:19,520 INFO L125 PetriNetUnfolderBase]: For 3113/3113 co-relation queries the response was YES. [2025-03-04 10:10:19,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69768 conditions, 32029 events. 23412/32029 cut-off events. For 3113/3113 co-relation queries the response was YES. Maximal size of possible extension queue 1004. Compared 184195 event pairs, 9882 based on Foata normal form. 391/27342 useless extension candidates. Maximal degree in co-relation 58577. Up to 13384 conditions per place. [2025-03-04 10:10:19,663 INFO L140 encePairwiseOnDemand]: 64/72 looper letters, 148 selfloop transitions, 10 changer transitions 0/162 dead transitions. [2025-03-04 10:10:19,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 162 transitions, 746 flow [2025-03-04 10:10:19,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:10:19,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:10:19,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 245 transitions. [2025-03-04 10:10:19,668 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4253472222222222 [2025-03-04 10:10:19,668 INFO L175 Difference]: Start difference. First operand has 64 places, 57 transitions, 159 flow. Second operand 8 states and 245 transitions. [2025-03-04 10:10:19,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 162 transitions, 746 flow [2025-03-04 10:10:19,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 162 transitions, 741 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:10:19,678 INFO L231 Difference]: Finished difference. Result has 73 places, 62 transitions, 213 flow [2025-03-04 10:10:19,678 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=213, PETRI_PLACES=73, PETRI_TRANSITIONS=62} [2025-03-04 10:10:19,678 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 7 predicate places. [2025-03-04 10:10:19,678 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 62 transitions, 213 flow [2025-03-04 10:10:19,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 13.25) internal successors, (159), 12 states have internal predecessors, (159), 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-03-04 10:10:19,678 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:19,679 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:10:19,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 10:10:19,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-04 10:10:19,879 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:10:19,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:19,880 INFO L85 PathProgramCache]: Analyzing trace with hash 821781564, now seen corresponding path program 1 times [2025-03-04 10:10:19,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:19,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827930300] [2025-03-04 10:10:19,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:19,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:19,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:10:19,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:10:19,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:19,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:19,955 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:10:19,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:19,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827930300] [2025-03-04 10:10:19,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827930300] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:10:19,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754377523] [2025-03-04 10:10:19,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:19,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:10:19,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:10:19,958 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:10:19,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:10:19,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:10:20,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:10:20,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:20,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:20,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:10:20,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:10:20,067 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:10:20,068 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:10:20,111 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:10:20,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754377523] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:10:20,112 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:10:20,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-04 10:10:20,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940260011] [2025-03-04 10:10:20,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:10:20,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:10:20,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:20,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:10:20,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:10:20,120 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 72 [2025-03-04 10:10:20,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 62 transitions, 213 flow. Second operand has 12 states, 12 states have (on average 13.666666666666666) internal successors, (164), 12 states have internal predecessors, (164), 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-03-04 10:10:20,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:20,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 72 [2025-03-04 10:10:20,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:21,372 INFO L124 PetriNetUnfolderBase]: 18228/25344 cut-off events. [2025-03-04 10:10:21,373 INFO L125 PetriNetUnfolderBase]: For 6897/6897 co-relation queries the response was YES. [2025-03-04 10:10:21,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57488 conditions, 25344 events. 18228/25344 cut-off events. For 6897/6897 co-relation queries the response was YES. Maximal size of possible extension queue 775. Compared 142272 event pairs, 9011 based on Foata normal form. 612/22072 useless extension candidates. Maximal degree in co-relation 39434. Up to 10410 conditions per place. [2025-03-04 10:10:21,521 INFO L140 encePairwiseOnDemand]: 61/72 looper letters, 111 selfloop transitions, 11 changer transitions 4/130 dead transitions. [2025-03-04 10:10:21,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 130 transitions, 647 flow [2025-03-04 10:10:21,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:10:21,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:10:21,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 219 transitions. [2025-03-04 10:10:21,523 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3802083333333333 [2025-03-04 10:10:21,523 INFO L175 Difference]: Start difference. First operand has 73 places, 62 transitions, 213 flow. Second operand 8 states and 219 transitions. [2025-03-04 10:10:21,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 130 transitions, 647 flow [2025-03-04 10:10:21,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 130 transitions, 630 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-03-04 10:10:21,532 INFO L231 Difference]: Finished difference. Result has 82 places, 65 transitions, 269 flow [2025-03-04 10:10:21,533 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=269, PETRI_PLACES=82, PETRI_TRANSITIONS=65} [2025-03-04 10:10:21,533 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 16 predicate places. [2025-03-04 10:10:21,533 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 65 transitions, 269 flow [2025-03-04 10:10:21,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 13.666666666666666) internal successors, (164), 12 states have internal predecessors, (164), 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-03-04 10:10:21,534 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:21,534 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:10:21,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 10:10:21,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:10:21,738 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread4Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:10:21,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:21,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1017913478, now seen corresponding path program 2 times [2025-03-04 10:10:21,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:21,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742125213] [2025-03-04 10:10:21,739 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:10:21,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:21,746 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-04 10:10:21,759 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 14 statements. [2025-03-04 10:10:21,760 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:10:21,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:21,901 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:10:21,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:21,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742125213] [2025-03-04 10:10:21,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742125213] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:21,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:21,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:10:21,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507592835] [2025-03-04 10:10:21,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:21,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:10:21,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:21,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:10:21,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:10:21,910 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 72 [2025-03-04 10:10:21,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 65 transitions, 269 flow. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:21,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:21,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 72 [2025-03-04 10:10:21,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:23,753 INFO L124 PetriNetUnfolderBase]: 24944/34337 cut-off events. [2025-03-04 10:10:23,753 INFO L125 PetriNetUnfolderBase]: For 12371/12371 co-relation queries the response was YES. [2025-03-04 10:10:23,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83458 conditions, 34337 events. 24944/34337 cut-off events. For 12371/12371 co-relation queries the response was YES. Maximal size of possible extension queue 865. Compared 198162 event pairs, 10774 based on Foata normal form. 0/29132 useless extension candidates. Maximal degree in co-relation 61675. Up to 17334 conditions per place. [2025-03-04 10:10:23,910 INFO L140 encePairwiseOnDemand]: 67/72 looper letters, 95 selfloop transitions, 8 changer transitions 0/107 dead transitions. [2025-03-04 10:10:23,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 107 transitions, 626 flow [2025-03-04 10:10:23,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:10:23,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:10:23,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 142 transitions. [2025-03-04 10:10:23,911 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39444444444444443 [2025-03-04 10:10:23,911 INFO L175 Difference]: Start difference. First operand has 82 places, 65 transitions, 269 flow. Second operand 5 states and 142 transitions. [2025-03-04 10:10:23,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 107 transitions, 626 flow [2025-03-04 10:10:23,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 107 transitions, 596 flow, removed 10 selfloop flow, removed 4 redundant places. [2025-03-04 10:10:23,926 INFO L231 Difference]: Finished difference. Result has 83 places, 66 transitions, 278 flow [2025-03-04 10:10:23,926 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=278, PETRI_PLACES=83, PETRI_TRANSITIONS=66} [2025-03-04 10:10:23,927 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 17 predicate places. [2025-03-04 10:10:23,927 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 66 transitions, 278 flow [2025-03-04 10:10:23,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:23,927 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:23,927 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:10:23,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 10:10:23,927 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:10:23,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:23,927 INFO L85 PathProgramCache]: Analyzing trace with hash 157076285, now seen corresponding path program 2 times [2025-03-04 10:10:23,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:23,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186052196] [2025-03-04 10:10:23,927 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:10:23,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:23,934 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-04 10:10:23,942 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 15 statements. [2025-03-04 10:10:23,942 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:10:23,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:24,063 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:10:24,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:24,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186052196] [2025-03-04 10:10:24,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186052196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:24,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:24,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:10:24,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096311857] [2025-03-04 10:10:24,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:24,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:10:24,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:24,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:10:24,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:10:24,071 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 72 [2025-03-04 10:10:24,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 66 transitions, 278 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:24,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:24,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 72 [2025-03-04 10:10:24,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:25,767 INFO L124 PetriNetUnfolderBase]: 32963/45360 cut-off events. [2025-03-04 10:10:25,767 INFO L125 PetriNetUnfolderBase]: For 20503/20503 co-relation queries the response was YES. [2025-03-04 10:10:25,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110894 conditions, 45360 events. 32963/45360 cut-off events. For 20503/20503 co-relation queries the response was YES. Maximal size of possible extension queue 1025. Compared 262236 event pairs, 16158 based on Foata normal form. 0/38432 useless extension candidates. Maximal degree in co-relation 88652. Up to 23855 conditions per place. [2025-03-04 10:10:26,077 INFO L140 encePairwiseOnDemand]: 65/72 looper letters, 94 selfloop transitions, 9 changer transitions 0/107 dead transitions. [2025-03-04 10:10:26,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 107 transitions, 636 flow [2025-03-04 10:10:26,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:10:26,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:10:26,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 140 transitions. [2025-03-04 10:10:26,079 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2025-03-04 10:10:26,079 INFO L175 Difference]: Start difference. First operand has 83 places, 66 transitions, 278 flow. Second operand 5 states and 140 transitions. [2025-03-04 10:10:26,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 107 transitions, 636 flow [2025-03-04 10:10:26,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 107 transitions, 612 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-03-04 10:10:26,097 INFO L231 Difference]: Finished difference. Result has 85 places, 68 transitions, 305 flow [2025-03-04 10:10:26,097 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=305, PETRI_PLACES=85, PETRI_TRANSITIONS=68} [2025-03-04 10:10:26,098 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 19 predicate places. [2025-03-04 10:10:26,098 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 68 transitions, 305 flow [2025-03-04 10:10:26,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:26,098 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:26,098 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:10:26,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 10:10:26,098 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread4Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:10:26,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:26,099 INFO L85 PathProgramCache]: Analyzing trace with hash -764267069, now seen corresponding path program 1 times [2025-03-04 10:10:26,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:26,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403010907] [2025-03-04 10:10:26,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:26,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:26,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:10:26,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:10:26,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:26,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:26,214 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:10:26,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:26,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403010907] [2025-03-04 10:10:26,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403010907] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:10:26,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224496617] [2025-03-04 10:10:26,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:26,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:10:26,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:10:26,217 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:10:26,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 10:10:26,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:10:26,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:10:26,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:26,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:26,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:10:26,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:10:26,357 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:10:26,357 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:10:26,423 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:10:26,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224496617] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:10:26,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:10:26,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2025-03-04 10:10:26,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67988785] [2025-03-04 10:10:26,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:10:26,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 10:10:26,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:26,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 10:10:26,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:10:26,440 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 72 [2025-03-04 10:10:26,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 68 transitions, 305 flow. Second operand has 17 states, 17 states have (on average 13.411764705882353) internal successors, (228), 17 states have internal predecessors, (228), 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-03-04 10:10:26,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:26,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 72 [2025-03-04 10:10:26,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:30,518 INFO L124 PetriNetUnfolderBase]: 56306/77114 cut-off events. [2025-03-04 10:10:30,518 INFO L125 PetriNetUnfolderBase]: For 36301/36301 co-relation queries the response was YES. [2025-03-04 10:10:30,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192279 conditions, 77114 events. 56306/77114 cut-off events. For 36301/36301 co-relation queries the response was YES. Maximal size of possible extension queue 1811. Compared 480339 event pairs, 19888 based on Foata normal form. 568/66330 useless extension candidates. Maximal degree in co-relation 170079. Up to 25890 conditions per place. [2025-03-04 10:10:30,913 INFO L140 encePairwiseOnDemand]: 64/72 looper letters, 245 selfloop transitions, 16 changer transitions 0/265 dead transitions. [2025-03-04 10:10:30,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 265 transitions, 1602 flow [2025-03-04 10:10:30,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:10:30,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:10:30,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 350 transitions. [2025-03-04 10:10:30,915 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44191919191919193 [2025-03-04 10:10:30,915 INFO L175 Difference]: Start difference. First operand has 85 places, 68 transitions, 305 flow. Second operand 11 states and 350 transitions. [2025-03-04 10:10:30,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 265 transitions, 1602 flow [2025-03-04 10:10:30,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 265 transitions, 1520 flow, removed 24 selfloop flow, removed 3 redundant places. [2025-03-04 10:10:30,936 INFO L231 Difference]: Finished difference. Result has 97 places, 75 transitions, 392 flow [2025-03-04 10:10:30,936 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=392, PETRI_PLACES=97, PETRI_TRANSITIONS=75} [2025-03-04 10:10:30,937 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 31 predicate places. [2025-03-04 10:10:30,937 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 75 transitions, 392 flow [2025-03-04 10:10:30,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 13.411764705882353) internal successors, (228), 17 states have internal predecessors, (228), 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-03-04 10:10:30,937 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:30,937 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:10:30,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 10:10:31,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:10:31,138 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:10:31,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:31,138 INFO L85 PathProgramCache]: Analyzing trace with hash 751165242, now seen corresponding path program 1 times [2025-03-04 10:10:31,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:31,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348618188] [2025-03-04 10:10:31,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:31,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:31,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:10:31,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:10:31,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:31,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:31,229 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:10:31,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:31,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348618188] [2025-03-04 10:10:31,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348618188] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:10:31,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614988577] [2025-03-04 10:10:31,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:31,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:10:31,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:10:31,231 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:10:31,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 10:10:31,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:10:31,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:10:31,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:31,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:31,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:10:31,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:10:31,374 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:10:31,374 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:10:31,444 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:10:31,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614988577] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:10:31,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:10:31,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2025-03-04 10:10:31,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868278166] [2025-03-04 10:10:31,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:10:31,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 10:10:31,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:31,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 10:10:31,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:10:31,459 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 72 [2025-03-04 10:10:31,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 75 transitions, 392 flow. Second operand has 17 states, 17 states have (on average 13.705882352941176) internal successors, (233), 17 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:31,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:31,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 72 [2025-03-04 10:10:31,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:35,274 INFO L124 PetriNetUnfolderBase]: 51896/71503 cut-off events. [2025-03-04 10:10:35,275 INFO L125 PetriNetUnfolderBase]: For 47194/47194 co-relation queries the response was YES. [2025-03-04 10:10:35,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180885 conditions, 71503 events. 51896/71503 cut-off events. For 47194/47194 co-relation queries the response was YES. Maximal size of possible extension queue 1656. Compared 439320 event pairs, 15998 based on Foata normal form. 780/62063 useless extension candidates. Maximal degree in co-relation 157066. Up to 18797 conditions per place. [2025-03-04 10:10:35,723 INFO L140 encePairwiseOnDemand]: 61/72 looper letters, 187 selfloop transitions, 20 changer transitions 4/215 dead transitions. [2025-03-04 10:10:35,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 215 transitions, 1328 flow [2025-03-04 10:10:35,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:10:35,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:10:35,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 313 transitions. [2025-03-04 10:10:35,724 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3952020202020202 [2025-03-04 10:10:35,724 INFO L175 Difference]: Start difference. First operand has 97 places, 75 transitions, 392 flow. Second operand 11 states and 313 transitions. [2025-03-04 10:10:35,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 215 transitions, 1328 flow [2025-03-04 10:10:35,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 215 transitions, 1316 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-04 10:10:35,751 INFO L231 Difference]: Finished difference. Result has 108 places, 84 transitions, 515 flow [2025-03-04 10:10:35,752 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=515, PETRI_PLACES=108, PETRI_TRANSITIONS=84} [2025-03-04 10:10:35,752 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 42 predicate places. [2025-03-04 10:10:35,752 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 84 transitions, 515 flow [2025-03-04 10:10:35,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 13.705882352941176) internal successors, (233), 17 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:35,752 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:35,752 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:10:35,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 10:10:35,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-04 10:10:35,953 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread4Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:10:35,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:35,954 INFO L85 PathProgramCache]: Analyzing trace with hash -745666718, now seen corresponding path program 2 times [2025-03-04 10:10:35,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:35,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003617846] [2025-03-04 10:10:35,954 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:10:35,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:35,960 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-04 10:10:35,971 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:10:35,972 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:10:35,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:36,141 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 10:10:36,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:36,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003617846] [2025-03-04 10:10:36,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003617846] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:36,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:36,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:10:36,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46621686] [2025-03-04 10:10:36,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:36,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:10:36,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:36,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:10:36,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:10:36,151 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 72 [2025-03-04 10:10:36,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 84 transitions, 515 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:36,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:36,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 72 [2025-03-04 10:10:36,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:40,068 INFO L124 PetriNetUnfolderBase]: 50283/69154 cut-off events. [2025-03-04 10:10:40,068 INFO L125 PetriNetUnfolderBase]: For 63869/63869 co-relation queries the response was YES. [2025-03-04 10:10:40,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183445 conditions, 69154 events. 50283/69154 cut-off events. For 63869/63869 co-relation queries the response was YES. Maximal size of possible extension queue 1681. Compared 440813 event pairs, 5099 based on Foata normal form. 0/59816 useless extension candidates. Maximal degree in co-relation 158376. Up to 60513 conditions per place. [2025-03-04 10:10:40,557 INFO L140 encePairwiseOnDemand]: 68/72 looper letters, 115 selfloop transitions, 9 changer transitions 0/128 dead transitions. [2025-03-04 10:10:40,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 128 transitions, 1009 flow [2025-03-04 10:10:40,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:10:40,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:10:40,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2025-03-04 10:10:40,561 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36944444444444446 [2025-03-04 10:10:40,561 INFO L175 Difference]: Start difference. First operand has 108 places, 84 transitions, 515 flow. Second operand 5 states and 133 transitions. [2025-03-04 10:10:40,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 128 transitions, 1009 flow [2025-03-04 10:10:40,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 128 transitions, 986 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-03-04 10:10:40,787 INFO L231 Difference]: Finished difference. Result has 107 places, 83 transitions, 510 flow [2025-03-04 10:10:40,787 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=510, PETRI_PLACES=107, PETRI_TRANSITIONS=83} [2025-03-04 10:10:40,787 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 41 predicate places. [2025-03-04 10:10:40,787 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 83 transitions, 510 flow [2025-03-04 10:10:40,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:40,788 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:40,788 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:10:40,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 10:10:40,788 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:10:40,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:40,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1327776123, now seen corresponding path program 2 times [2025-03-04 10:10:40,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:40,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278385672] [2025-03-04 10:10:40,788 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:10:40,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:40,793 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-04 10:10:40,800 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:10:40,800 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:10:40,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:40,929 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 10:10:40,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:40,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278385672] [2025-03-04 10:10:40,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278385672] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:40,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:40,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:10:40,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972600377] [2025-03-04 10:10:40,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:40,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:10:40,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:40,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:10:40,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:10:40,936 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 72 [2025-03-04 10:10:40,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 83 transitions, 510 flow. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 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-03-04 10:10:40,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:40,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 72 [2025-03-04 10:10:40,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:44,747 INFO L124 PetriNetUnfolderBase]: 47275/65263 cut-off events. [2025-03-04 10:10:44,748 INFO L125 PetriNetUnfolderBase]: For 63804/63804 co-relation queries the response was YES. [2025-03-04 10:10:45,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171629 conditions, 65263 events. 47275/65263 cut-off events. For 63804/63804 co-relation queries the response was YES. Maximal size of possible extension queue 1596. Compared 405938 event pairs, 18656 based on Foata normal form. 0/56973 useless extension candidates. Maximal degree in co-relation 146101. Up to 64604 conditions per place. [2025-03-04 10:10:45,259 INFO L140 encePairwiseOnDemand]: 67/72 looper letters, 87 selfloop transitions, 9 changer transitions 0/100 dead transitions. [2025-03-04 10:10:45,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 100 transitions, 810 flow [2025-03-04 10:10:45,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:10:45,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:10:45,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2025-03-04 10:10:45,260 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3138888888888889 [2025-03-04 10:10:45,260 INFO L175 Difference]: Start difference. First operand has 107 places, 83 transitions, 510 flow. Second operand 5 states and 113 transitions. [2025-03-04 10:10:45,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 100 transitions, 810 flow [2025-03-04 10:10:45,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 100 transitions, 792 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:10:45,336 INFO L231 Difference]: Finished difference. Result has 106 places, 81 transitions, 498 flow [2025-03-04 10:10:45,336 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=498, PETRI_PLACES=106, PETRI_TRANSITIONS=81} [2025-03-04 10:10:45,337 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 40 predicate places. [2025-03-04 10:10:45,337 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 81 transitions, 498 flow [2025-03-04 10:10:45,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 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-03-04 10:10:45,337 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:45,337 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:10:45,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 10:10:45,337 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:10:45,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:45,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1830273086, now seen corresponding path program 1 times [2025-03-04 10:10:45,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:45,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898834637] [2025-03-04 10:10:45,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:45,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:45,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 10:10:45,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 10:10:45,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:45,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:45,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:10:45,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:45,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898834637] [2025-03-04 10:10:45,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898834637] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:45,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:45,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:10:45,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571902975] [2025-03-04 10:10:45,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:45,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:10:45,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:45,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:10:45,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:10:45,373 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 72 [2025-03-04 10:10:45,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 81 transitions, 498 flow. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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-03-04 10:10:45,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:45,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 72 [2025-03-04 10:10:45,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:50,470 INFO L124 PetriNetUnfolderBase]: 63963/88088 cut-off events. [2025-03-04 10:10:50,470 INFO L125 PetriNetUnfolderBase]: For 74912/74912 co-relation queries the response was YES.