./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-lit/sssc12_variant.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-lit/sssc12_variant.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0ff08c0361e0fdb1af5d85b333c023f31932563eeba591605f3b3b9ddd16afc8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:52:56,816 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:52:56,872 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 00:52:56,879 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:52:56,880 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:52:56,906 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:52:56,907 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:52:56,907 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:52:56,907 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:52:56,907 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:52:56,907 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:52:56,908 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:52:56,908 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:52:56,908 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:52:56,908 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:52:56,908 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:52:56,908 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:52:56,909 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:52:56,909 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:52:56,909 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:52:56,909 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:52:56,909 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:52:56,909 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:52:56,909 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:52:56,909 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:52:56,910 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:52:56,910 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:52:56,910 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:52:56,910 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:52:56,910 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:52:56,910 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:52:56,910 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:52:56,911 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:52:56,911 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:52:56,911 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:52:56,911 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:52:56,911 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:52:56,911 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:52:56,911 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:52:56,911 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:52:56,912 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:52:56,912 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:52:56,912 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:52:56,912 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:52:56,912 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:52:56,912 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:52:56,912 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:52:56,912 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0ff08c0361e0fdb1af5d85b333c023f31932563eeba591605f3b3b9ddd16afc8 [2025-01-10 00:52:57,172 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:52:57,181 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:52:57,183 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:52:57,184 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:52:57,184 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:52:57,185 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-lit/sssc12_variant.i [2025-01-10 00:52:58,451 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c5c2fbb69/d1bf1a6aa3784d46b6f003adcf8ff142/FLAG7fee6c3e8 [2025-01-10 00:52:58,850 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:52:58,851 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-lit/sssc12_variant.i [2025-01-10 00:52:58,870 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c5c2fbb69/d1bf1a6aa3784d46b6f003adcf8ff142/FLAG7fee6c3e8 [2025-01-10 00:52:58,886 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c5c2fbb69/d1bf1a6aa3784d46b6f003adcf8ff142 [2025-01-10 00:52:58,889 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:52:58,890 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:52:58,892 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:52:58,892 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:52:58,895 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:52:58,897 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:52:58" (1/1) ... [2025-01-10 00:52:58,898 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44a541f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:52:58, skipping insertion in model container [2025-01-10 00:52:58,898 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:52:58" (1/1) ... [2025-01-10 00:52:58,941 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:52:59,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:52:59,298 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:52:59,341 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:52:59,398 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:52:59,400 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:52:59 WrapperNode [2025-01-10 00:52:59,400 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:52:59,401 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:52:59,401 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:52:59,401 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:52:59,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:52:59" (1/1) ... [2025-01-10 00:52:59,417 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:52:59" (1/1) ... [2025-01-10 00:52:59,440 INFO L138 Inliner]: procedures = 272, calls = 22, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 73 [2025-01-10 00:52:59,440 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:52:59,441 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:52:59,441 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:52:59,441 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:52:59,447 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:52:59" (1/1) ... [2025-01-10 00:52:59,448 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:52:59" (1/1) ... [2025-01-10 00:52:59,451 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:52:59" (1/1) ... [2025-01-10 00:52:59,462 INFO L175 MemorySlicer]: Split 10 memory accesses to 3 slices as follows [2, 5, 3]. 50 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 2 writes are split as follows [0, 0, 2]. [2025-01-10 00:52:59,463 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:52:59" (1/1) ... [2025-01-10 00:52:59,463 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:52:59" (1/1) ... [2025-01-10 00:52:59,468 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:52:59" (1/1) ... [2025-01-10 00:52:59,469 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:52:59" (1/1) ... [2025-01-10 00:52:59,475 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:52:59" (1/1) ... [2025-01-10 00:52:59,476 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:52:59" (1/1) ... [2025-01-10 00:52:59,477 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:52:59" (1/1) ... [2025-01-10 00:52:59,479 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:52:59,480 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:52:59,480 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:52:59,480 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:52:59,481 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:52:59" (1/1) ... [2025-01-10 00:52:59,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:52:59,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:52:59,515 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 00:52:59,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 00:52:59,541 INFO L130 BoogieDeclarations]: Found specification of procedure thr [2025-01-10 00:52:59,541 INFO L138 BoogieDeclarations]: Found implementation of procedure thr [2025-01-10 00:52:59,541 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 00:52:59,542 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 00:52:59,542 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 00:52:59,542 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 00:52:59,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 00:52:59,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 00:52:59,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 00:52:59,543 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 00:52:59,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 00:52:59,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:52:59,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:52:59,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 00:52:59,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 00:52:59,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:52:59,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:52:59,545 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 00:52:59,693 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:52:59,695 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:52:59,878 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:52:59,878 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:52:59,996 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:52:59,997 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-10 00:52:59,997 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:52:59 BoogieIcfgContainer [2025-01-10 00:52:59,997 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:53:00,001 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:53:00,001 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:53:00,005 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:53:00,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:52:58" (1/3) ... [2025-01-10 00:53:00,007 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72a4f277 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:53:00, skipping insertion in model container [2025-01-10 00:53:00,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:52:59" (2/3) ... [2025-01-10 00:53:00,009 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72a4f277 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:53:00, skipping insertion in model container [2025-01-10 00:53:00,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:52:59" (3/3) ... [2025-01-10 00:53:00,010 INFO L128 eAbstractionObserver]: Analyzing ICFG sssc12_variant.i [2025-01-10 00:53:00,025 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:53:00,026 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sssc12_variant.i that has 2 procedures, 29 locations, 1 initial locations, 2 loop locations, and 8 error locations. [2025-01-10 00:53:00,026 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:53:00,085 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:53:00,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 32 transitions, 68 flow [2025-01-10 00:53:00,153 INFO L124 PetriNetUnfolderBase]: 3/36 cut-off events. [2025-01-10 00:53:00,156 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:53:00,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 36 events. 3/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 56 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 29. Up to 2 conditions per place. [2025-01-10 00:53:00,158 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 32 transitions, 68 flow [2025-01-10 00:53:00,162 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 32 transitions, 68 flow [2025-01-10 00:53:00,174 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:53:00,185 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;@235d0c31, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:53:00,186 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-01-10 00:53:00,190 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:53:00,190 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-01-10 00:53:00,190 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:53:00,190 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:53:00,191 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:53:00,191 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-01-10 00:53:00,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:53:00,198 INFO L85 PathProgramCache]: Analyzing trace with hash 250825, now seen corresponding path program 1 times [2025-01-10 00:53:00,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:53:00,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712012545] [2025-01-10 00:53:00,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:53:00,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:53:00,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:53:00,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:53:00,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:53:00,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:53:00,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:53:00,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:53:00,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712012545] [2025-01-10 00:53:00,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712012545] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:53:00,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:53:00,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:53:00,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730780550] [2025-01-10 00:53:00,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:53:00,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 00:53:00,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:53:00,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 00:53:00,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 00:53:00,421 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 32 [2025-01-10 00:53:00,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 32 transitions, 68 flow. Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:53:00,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:53:00,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 32 [2025-01-10 00:53:00,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:53:00,492 INFO L124 PetriNetUnfolderBase]: 17/84 cut-off events. [2025-01-10 00:53:00,494 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:53:00,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 84 events. 17/84 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 265 event pairs, 14 based on Foata normal form. 6/75 useless extension candidates. Maximal degree in co-relation 119. Up to 44 conditions per place. [2025-01-10 00:53:00,497 INFO L140 encePairwiseOnDemand]: 29/32 looper letters, 12 selfloop transitions, 0 changer transitions 0/26 dead transitions. [2025-01-10 00:53:00,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 26 transitions, 80 flow [2025-01-10 00:53:00,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 00:53:00,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-10 00:53:00,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 45 transitions. [2025-01-10 00:53:00,507 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.703125 [2025-01-10 00:53:00,525 INFO L175 Difference]: Start difference. First operand has 32 places, 32 transitions, 68 flow. Second operand 2 states and 45 transitions. [2025-01-10 00:53:00,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 26 transitions, 80 flow [2025-01-10 00:53:00,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 26 transitions, 80 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:53:00,531 INFO L231 Difference]: Finished difference. Result has 29 places, 26 transitions, 56 flow [2025-01-10 00:53:00,535 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=56, PETRI_PLACES=29, PETRI_TRANSITIONS=26} [2025-01-10 00:53:00,539 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, -3 predicate places. [2025-01-10 00:53:00,542 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 26 transitions, 56 flow [2025-01-10 00:53:00,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:53:00,542 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:53:00,542 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-01-10 00:53:00,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:53:00,543 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-01-10 00:53:00,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:53:00,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1117364841, now seen corresponding path program 1 times [2025-01-10 00:53:00,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:53:00,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629211754] [2025-01-10 00:53:00,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:53:00,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:53:00,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 00:53:00,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 00:53:00,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:53:00,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:53:00,587 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:53:00,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 00:53:00,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 00:53:00,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:53:00,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:53:00,626 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:53:00,628 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:53:00,629 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2025-01-10 00:53:00,633 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2025-01-10 00:53:00,633 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2025-01-10 00:53:00,634 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2025-01-10 00:53:00,634 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2025-01-10 00:53:00,634 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2025-01-10 00:53:00,634 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2025-01-10 00:53:00,634 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2025-01-10 00:53:00,634 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONMEMORY_LEAK (7 of 16 remaining) [2025-01-10 00:53:00,634 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2025-01-10 00:53:00,634 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 16 remaining) [2025-01-10 00:53:00,634 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 16 remaining) [2025-01-10 00:53:00,634 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 16 remaining) [2025-01-10 00:53:00,634 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 16 remaining) [2025-01-10 00:53:00,634 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 16 remaining) [2025-01-10 00:53:00,634 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2025-01-10 00:53:00,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:53:00,635 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-10 00:53:00,642 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 00:53:00,642 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-10 00:53:00,675 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:53:00,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 57 transitions, 124 flow [2025-01-10 00:53:00,699 INFO L124 PetriNetUnfolderBase]: 6/66 cut-off events. [2025-01-10 00:53:00,699 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 00:53:00,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 66 events. 6/66 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 182 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 53. Up to 3 conditions per place. [2025-01-10 00:53:00,700 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 57 transitions, 124 flow [2025-01-10 00:53:00,701 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 57 transitions, 124 flow [2025-01-10 00:53:00,702 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:53:00,703 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;@235d0c31, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:53:00,703 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-01-10 00:53:00,707 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:53:00,708 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-01-10 00:53:00,708 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:53:00,708 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:53:00,708 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:53:00,708 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-01-10 00:53:00,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:53:00,710 INFO L85 PathProgramCache]: Analyzing trace with hash 307426, now seen corresponding path program 1 times [2025-01-10 00:53:00,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:53:00,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901767805] [2025-01-10 00:53:00,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:53:00,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:53:00,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:53:00,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:53:00,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:53:00,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:53:00,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:53:00,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:53:00,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901767805] [2025-01-10 00:53:00,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901767805] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:53:00,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:53:00,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:53:00,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629208693] [2025-01-10 00:53:00,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:53:00,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 00:53:00,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:53:00,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 00:53:00,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 00:53:00,747 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 57 [2025-01-10 00:53:00,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 57 transitions, 124 flow. Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:53:00,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:53:00,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 57 [2025-01-10 00:53:00,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:53:00,988 INFO L124 PetriNetUnfolderBase]: 409/1275 cut-off events. [2025-01-10 00:53:00,988 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-01-10 00:53:00,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1956 conditions, 1275 events. 409/1275 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 8918 event pairs, 325 based on Foata normal form. 114/1104 useless extension candidates. Maximal degree in co-relation 1448. Up to 652 conditions per place. [2025-01-10 00:53:01,007 INFO L140 encePairwiseOnDemand]: 52/57 looper letters, 21 selfloop transitions, 0 changer transitions 0/48 dead transitions. [2025-01-10 00:53:01,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 48 transitions, 148 flow [2025-01-10 00:53:01,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 00:53:01,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-10 00:53:01,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 82 transitions. [2025-01-10 00:53:01,009 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7192982456140351 [2025-01-10 00:53:01,009 INFO L175 Difference]: Start difference. First operand has 56 places, 57 transitions, 124 flow. Second operand 2 states and 82 transitions. [2025-01-10 00:53:01,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 48 transitions, 148 flow [2025-01-10 00:53:01,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 48 transitions, 148 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:53:01,011 INFO L231 Difference]: Finished difference. Result has 52 places, 48 transitions, 106 flow [2025-01-10 00:53:01,011 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=106, PETRI_PLACES=52, PETRI_TRANSITIONS=48} [2025-01-10 00:53:01,012 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, -4 predicate places. [2025-01-10 00:53:01,012 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 48 transitions, 106 flow [2025-01-10 00:53:01,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:53:01,012 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:53:01,014 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2025-01-10 00:53:01,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:53:01,014 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-01-10 00:53:01,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:53:01,015 INFO L85 PathProgramCache]: Analyzing trace with hash -248584135, now seen corresponding path program 1 times [2025-01-10 00:53:01,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:53:01,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729639457] [2025-01-10 00:53:01,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:53:01,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:53:01,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:53:01,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:53:01,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:53:01,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:53:01,058 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:53:01,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:53:01,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:53:01,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:53:01,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:53:01,074 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:53:01,074 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:53:01,074 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 23 remaining) [2025-01-10 00:53:01,074 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (21 of 23 remaining) [2025-01-10 00:53:01,074 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 23 remaining) [2025-01-10 00:53:01,074 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 23 remaining) [2025-01-10 00:53:01,074 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 23 remaining) [2025-01-10 00:53:01,074 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 23 remaining) [2025-01-10 00:53:01,074 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 23 remaining) [2025-01-10 00:53:01,074 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 23 remaining) [2025-01-10 00:53:01,074 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONMEMORY_LEAK (14 of 23 remaining) [2025-01-10 00:53:01,074 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 23 remaining) [2025-01-10 00:53:01,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 23 remaining) [2025-01-10 00:53:01,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 23 remaining) [2025-01-10 00:53:01,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 23 remaining) [2025-01-10 00:53:01,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 23 remaining) [2025-01-10 00:53:01,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 23 remaining) [2025-01-10 00:53:01,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONMEMORY_LEAK (7 of 23 remaining) [2025-01-10 00:53:01,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 23 remaining) [2025-01-10 00:53:01,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 23 remaining) [2025-01-10 00:53:01,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 23 remaining) [2025-01-10 00:53:01,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 23 remaining) [2025-01-10 00:53:01,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 23 remaining) [2025-01-10 00:53:01,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 23 remaining) [2025-01-10 00:53:01,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONMEMORY_LEAK (0 of 23 remaining) [2025-01-10 00:53:01,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:53:01,075 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-10 00:53:01,076 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 00:53:01,076 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-10 00:53:01,112 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:53:01,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 82 transitions, 182 flow [2025-01-10 00:53:01,148 INFO L124 PetriNetUnfolderBase]: 9/96 cut-off events. [2025-01-10 00:53:01,148 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-10 00:53:01,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 96 events. 9/96 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 322 event pairs, 0 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 77. Up to 4 conditions per place. [2025-01-10 00:53:01,149 INFO L82 GeneralOperation]: Start removeDead. Operand has 80 places, 82 transitions, 182 flow [2025-01-10 00:53:01,152 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 82 transitions, 182 flow [2025-01-10 00:53:01,154 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:53:01,156 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;@235d0c31, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:53:01,156 INFO L334 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2025-01-10 00:53:01,157 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:53:01,157 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-01-10 00:53:01,157 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:53:01,157 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:53:01,157 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:53:01,157 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 00:53:01,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:53:01,159 INFO L85 PathProgramCache]: Analyzing trace with hash 388852, now seen corresponding path program 1 times [2025-01-10 00:53:01,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:53:01,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677281491] [2025-01-10 00:53:01,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:53:01,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:53:01,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:53:01,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:53:01,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:53:01,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:53:01,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:53:01,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:53:01,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677281491] [2025-01-10 00:53:01,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677281491] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:53:01,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:53:01,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:53:01,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93006376] [2025-01-10 00:53:01,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:53:01,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 00:53:01,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:53:01,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 00:53:01,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 00:53:01,189 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 82 [2025-01-10 00:53:01,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 82 transitions, 182 flow. Second operand has 2 states, 2 states have (on average 42.0) internal successors, (84), 2 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:53:01,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:53:01,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 82 [2025-01-10 00:53:01,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:53:02,778 INFO L124 PetriNetUnfolderBase]: 6301/15930 cut-off events. [2025-01-10 00:53:02,779 INFO L125 PetriNetUnfolderBase]: For 508/508 co-relation queries the response was YES. [2025-01-10 00:53:02,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24790 conditions, 15930 events. 6301/15930 cut-off events. For 508/508 co-relation queries the response was YES. Maximal size of possible extension queue 664. Compared 165852 event pairs, 4948 based on Foata normal form. 1572/13856 useless extension candidates. Maximal degree in co-relation 7164. Up to 8542 conditions per place. [2025-01-10 00:53:02,911 INFO L140 encePairwiseOnDemand]: 75/82 looper letters, 30 selfloop transitions, 0 changer transitions 0/70 dead transitions. [2025-01-10 00:53:02,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 70 transitions, 218 flow [2025-01-10 00:53:02,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 00:53:02,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-10 00:53:02,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 119 transitions. [2025-01-10 00:53:02,915 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.725609756097561 [2025-01-10 00:53:02,915 INFO L175 Difference]: Start difference. First operand has 80 places, 82 transitions, 182 flow. Second operand 2 states and 119 transitions. [2025-01-10 00:53:02,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 70 transitions, 218 flow [2025-01-10 00:53:02,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 70 transitions, 216 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-01-10 00:53:02,918 INFO L231 Difference]: Finished difference. Result has 75 places, 70 transitions, 156 flow [2025-01-10 00:53:02,919 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=156, PETRI_PLACES=75, PETRI_TRANSITIONS=70} [2025-01-10 00:53:02,919 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, -5 predicate places. [2025-01-10 00:53:02,919 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 70 transitions, 156 flow [2025-01-10 00:53:02,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 42.0) internal successors, (84), 2 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:53:02,919 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:53:02,920 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:53:02,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:53:02,920 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thrErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 00:53:02,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:53:02,920 INFO L85 PathProgramCache]: Analyzing trace with hash 2077144431, now seen corresponding path program 1 times [2025-01-10 00:53:02,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:53:02,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748508570] [2025-01-10 00:53:02,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:53:02,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:53:02,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 00:53:02,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 00:53:02,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:53:02,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:53:03,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:53:03,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:53:03,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748508570] [2025-01-10 00:53:03,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748508570] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:53:03,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:53:03,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:53:03,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611173382] [2025-01-10 00:53:03,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:53:03,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:53:03,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:53:03,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:53:03,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:53:03,160 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 82 [2025-01-10 00:53:03,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 70 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:53:03,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:53:03,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 82 [2025-01-10 00:53:03,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:53:04,776 INFO L124 PetriNetUnfolderBase]: 11513/20722 cut-off events. [2025-01-10 00:53:04,777 INFO L125 PetriNetUnfolderBase]: For 421/421 co-relation queries the response was YES. [2025-01-10 00:53:04,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36718 conditions, 20722 events. 11513/20722 cut-off events. For 421/421 co-relation queries the response was YES. Maximal size of possible extension queue 723. Compared 168595 event pairs, 9521 based on Foata normal form. 0/20537 useless extension candidates. Maximal degree in co-relation 36712. Up to 15622 conditions per place. [2025-01-10 00:53:04,940 INFO L140 encePairwiseOnDemand]: 72/82 looper letters, 35 selfloop transitions, 1 changer transitions 0/61 dead transitions. [2025-01-10 00:53:04,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 61 transitions, 210 flow [2025-01-10 00:53:04,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:53:04,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:53:04,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2025-01-10 00:53:04,944 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-01-10 00:53:04,944 INFO L175 Difference]: Start difference. First operand has 75 places, 70 transitions, 156 flow. Second operand 3 states and 123 transitions. [2025-01-10 00:53:04,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 61 transitions, 210 flow [2025-01-10 00:53:04,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 61 transitions, 210 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:53:04,948 INFO L231 Difference]: Finished difference. Result has 68 places, 61 transitions, 140 flow [2025-01-10 00:53:04,949 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=68, PETRI_TRANSITIONS=61} [2025-01-10 00:53:04,950 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, -12 predicate places. [2025-01-10 00:53:04,950 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 61 transitions, 140 flow [2025-01-10 00:53:04,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:53:04,951 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:53:04,951 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:53:04,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:53:04,951 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thrErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 00:53:04,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:53:04,952 INFO L85 PathProgramCache]: Analyzing trace with hash 2077144432, now seen corresponding path program 1 times [2025-01-10 00:53:04,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:53:04,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988274969] [2025-01-10 00:53:04,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:53:04,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:53:04,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 00:53:04,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 00:53:04,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:53:04,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:53:05,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:53:05,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:53:05,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988274969] [2025-01-10 00:53:05,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988274969] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:53:05,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:53:05,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:53:05,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462470803] [2025-01-10 00:53:05,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:53:05,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:53:05,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:53:05,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:53:05,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:53:05,583 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 82 [2025-01-10 00:53:05,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 61 transitions, 140 flow. Second operand has 6 states, 6 states have (on average 36.5) internal successors, (219), 6 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:53:05,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:53:05,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 82 [2025-01-10 00:53:05,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:53:07,181 INFO L124 PetriNetUnfolderBase]: 11575/22683 cut-off events. [2025-01-10 00:53:07,182 INFO L125 PetriNetUnfolderBase]: For 458/458 co-relation queries the response was YES. [2025-01-10 00:53:07,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38908 conditions, 22683 events. 11575/22683 cut-off events. For 458/458 co-relation queries the response was YES. Maximal size of possible extension queue 837. Compared 206909 event pairs, 2206 based on Foata normal form. 0/19812 useless extension candidates. Maximal degree in co-relation 38901. Up to 6074 conditions per place. [2025-01-10 00:53:07,312 INFO L140 encePairwiseOnDemand]: 71/82 looper letters, 89 selfloop transitions, 12 changer transitions 0/126 dead transitions. [2025-01-10 00:53:07,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 126 transitions, 512 flow [2025-01-10 00:53:07,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:53:07,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:53:07,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 314 transitions. [2025-01-10 00:53:07,315 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6382113821138211 [2025-01-10 00:53:07,315 INFO L175 Difference]: Start difference. First operand has 68 places, 61 transitions, 140 flow. Second operand 6 states and 314 transitions. [2025-01-10 00:53:07,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 126 transitions, 512 flow [2025-01-10 00:53:07,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 126 transitions, 511 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:53:07,321 INFO L231 Difference]: Finished difference. Result has 75 places, 67 transitions, 213 flow [2025-01-10 00:53:07,322 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=213, PETRI_PLACES=75, PETRI_TRANSITIONS=67} [2025-01-10 00:53:07,326 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, -5 predicate places. [2025-01-10 00:53:07,326 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 67 transitions, 213 flow [2025-01-10 00:53:07,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.5) internal successors, (219), 6 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:53:07,326 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:53:07,326 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2025-01-10 00:53:07,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:53:07,327 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 00:53:07,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:53:07,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1278957718, now seen corresponding path program 1 times [2025-01-10 00:53:07,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:53:07,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950290834] [2025-01-10 00:53:07,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:53:07,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:53:07,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 00:53:07,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 00:53:07,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:53:07,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:53:07,349 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:53:07,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 00:53:07,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 00:53:07,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:53:07,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:53:07,366 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:53:07,367 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:53:07,367 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 30 remaining) [2025-01-10 00:53:07,367 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (28 of 30 remaining) [2025-01-10 00:53:07,367 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 30 remaining) [2025-01-10 00:53:07,367 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 30 remaining) [2025-01-10 00:53:07,367 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 30 remaining) [2025-01-10 00:53:07,367 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 30 remaining) [2025-01-10 00:53:07,368 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 30 remaining) [2025-01-10 00:53:07,368 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 30 remaining) [2025-01-10 00:53:07,368 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONMEMORY_LEAK (21 of 30 remaining) [2025-01-10 00:53:07,368 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 30 remaining) [2025-01-10 00:53:07,368 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 30 remaining) [2025-01-10 00:53:07,368 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 30 remaining) [2025-01-10 00:53:07,368 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 30 remaining) [2025-01-10 00:53:07,368 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 30 remaining) [2025-01-10 00:53:07,368 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 30 remaining) [2025-01-10 00:53:07,368 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONMEMORY_LEAK (14 of 30 remaining) [2025-01-10 00:53:07,368 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 30 remaining) [2025-01-10 00:53:07,369 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 30 remaining) [2025-01-10 00:53:07,369 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 30 remaining) [2025-01-10 00:53:07,369 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 30 remaining) [2025-01-10 00:53:07,369 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 30 remaining) [2025-01-10 00:53:07,369 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 30 remaining) [2025-01-10 00:53:07,369 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONMEMORY_LEAK (7 of 30 remaining) [2025-01-10 00:53:07,369 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 30 remaining) [2025-01-10 00:53:07,369 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 30 remaining) [2025-01-10 00:53:07,369 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 30 remaining) [2025-01-10 00:53:07,369 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 30 remaining) [2025-01-10 00:53:07,369 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 30 remaining) [2025-01-10 00:53:07,369 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 30 remaining) [2025-01-10 00:53:07,370 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONMEMORY_LEAK (0 of 30 remaining) [2025-01-10 00:53:07,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:53:07,370 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-10 00:53:07,371 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 00:53:07,371 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-01-10 00:53:07,413 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:53:07,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 107 transitions, 242 flow [2025-01-10 00:53:07,424 INFO L124 PetriNetUnfolderBase]: 12/126 cut-off events. [2025-01-10 00:53:07,424 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-01-10 00:53:07,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 126 events. 12/126 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 472 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 108. Up to 5 conditions per place. [2025-01-10 00:53:07,425 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 107 transitions, 242 flow [2025-01-10 00:53:07,426 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 107 transitions, 242 flow [2025-01-10 00:53:07,427 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:53:07,427 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;@235d0c31, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:53:07,427 INFO L334 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2025-01-10 00:53:07,428 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:53:07,428 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-01-10 00:53:07,428 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:53:07,428 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:53:07,430 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:53:07,431 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2025-01-10 00:53:07,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:53:07,431 INFO L85 PathProgramCache]: Analyzing trace with hash 495103, now seen corresponding path program 1 times [2025-01-10 00:53:07,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:53:07,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611189716] [2025-01-10 00:53:07,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:53:07,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:53:07,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:53:07,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:53:07,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:53:07,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:53:07,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:53:07,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:53:07,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611189716] [2025-01-10 00:53:07,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611189716] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:53:07,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:53:07,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:53:07,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223858176] [2025-01-10 00:53:07,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:53:07,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 00:53:07,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:53:07,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 00:53:07,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 00:53:07,453 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 107 [2025-01-10 00:53:07,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 107 transitions, 242 flow. Second operand has 2 states, 2 states have (on average 55.0) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:53:07,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:53:07,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 107 [2025-01-10 00:53:07,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:53:17,320 INFO L124 PetriNetUnfolderBase]: 79731/172664 cut-off events. [2025-01-10 00:53:17,320 INFO L125 PetriNetUnfolderBase]: For 7903/7903 co-relation queries the response was YES. [2025-01-10 00:53:17,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 276351 conditions, 172664 events. 79731/172664 cut-off events. For 7903/7903 co-relation queries the response was YES. Maximal size of possible extension queue 5970. Compared 2224068 event pairs, 62793 based on Foata normal form. 18627/154596 useless extension candidates. Maximal degree in co-relation 26460. Up to 100038 conditions per place. [2025-01-10 00:53:18,646 INFO L140 encePairwiseOnDemand]: 98/107 looper letters, 39 selfloop transitions, 0 changer transitions 0/92 dead transitions. [2025-01-10 00:53:18,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 92 transitions, 290 flow [2025-01-10 00:53:18,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 00:53:18,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-10 00:53:18,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 156 transitions. [2025-01-10 00:53:18,648 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7289719626168224 [2025-01-10 00:53:18,648 INFO L175 Difference]: Start difference. First operand has 104 places, 107 transitions, 242 flow. Second operand 2 states and 156 transitions. [2025-01-10 00:53:18,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 92 transitions, 290 flow [2025-01-10 00:53:18,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 92 transitions, 284 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-01-10 00:53:18,655 INFO L231 Difference]: Finished difference. Result has 98 places, 92 transitions, 206 flow [2025-01-10 00:53:18,655 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=206, PETRI_PLACES=98, PETRI_TRANSITIONS=92} [2025-01-10 00:53:18,656 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, -6 predicate places. [2025-01-10 00:53:18,656 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 92 transitions, 206 flow [2025-01-10 00:53:18,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 55.0) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:53:18,656 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:53:18,656 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:53:18,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:53:18,656 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thrErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2025-01-10 00:53:18,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:53:18,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1875067593, now seen corresponding path program 1 times [2025-01-10 00:53:18,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:53:18,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722977811] [2025-01-10 00:53:18,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:53:18,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:53:18,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 00:53:18,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 00:53:18,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:53:18,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:53:18,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:53:18,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:53:18,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722977811] [2025-01-10 00:53:18,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722977811] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:53:18,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:53:18,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:53:18,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955218565] [2025-01-10 00:53:18,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:53:18,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:53:18,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:53:18,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:53:18,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:53:18,800 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 107 [2025-01-10 00:53:18,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 92 transitions, 206 flow. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:53:18,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:53:18,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 107 [2025-01-10 00:53:18,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:53:34,569 INFO L124 PetriNetUnfolderBase]: 176287/279039 cut-off events. [2025-01-10 00:53:34,569 INFO L125 PetriNetUnfolderBase]: For 5065/5065 co-relation queries the response was YES.