MCC'2026- Execution of r210-smll-177969942000201

About the Execution of ITS-Tools for PhilosophersDyn-COL-10

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
16205.939	2441030.00	2311893.00	125374.40	TTTFFFFFTFTFFTTF	normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r210-smll-177969942000201.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is PhilosophersDyn-COL-10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-smll-177969942000201
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 7.4K Mar 5 13:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Mar 5 13:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Mar 5 13:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Mar 5 13:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Mar 16 08:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 16 08:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 16 08:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 16 08:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Mar 5 13:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K Mar 5 13:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 5 13:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Mar 5 13:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 16 08:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 16 08:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 32K Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME PhilosophersDyn-COL-10-CTLCardinality-2024-00
FORMULA_NAME PhilosophersDyn-COL-10-CTLCardinality-2024-01
FORMULA_NAME PhilosophersDyn-COL-10-CTLCardinality-2024-02
FORMULA_NAME PhilosophersDyn-COL-10-CTLCardinality-2024-03
FORMULA_NAME PhilosophersDyn-COL-10-CTLCardinality-2024-04
FORMULA_NAME PhilosophersDyn-COL-10-CTLCardinality-2024-05
FORMULA_NAME PhilosophersDyn-COL-10-CTLCardinality-2024-06
FORMULA_NAME PhilosophersDyn-COL-10-CTLCardinality-2024-07
FORMULA_NAME PhilosophersDyn-COL-10-CTLCardinality-2024-08
FORMULA_NAME PhilosophersDyn-COL-10-CTLCardinality-2024-09
FORMULA_NAME PhilosophersDyn-COL-10-CTLCardinality-2024-10
FORMULA_NAME PhilosophersDyn-COL-10-CTLCardinality-2024-11
FORMULA_NAME PhilosophersDyn-COL-10-CTLCardinality-2024-12
FORMULA_NAME PhilosophersDyn-COL-10-CTLCardinality-2024-13
FORMULA_NAME PhilosophersDyn-COL-10-CTLCardinality-2024-14
FORMULA_NAME PhilosophersDyn-COL-10-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779934988157

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PhilosophersDyn-COL-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
CTLCardinality COL
Running Version 202604301425
[2026-05-28 02:23:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-28 02:23:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-28 02:23:10] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2026-05-28 02:23:11] [WARNING] Using fallBack plugin, rng conformance not checked
[2026-05-28 02:23:11] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1062 ms
[2026-05-28 02:23:12] [INFO ] Imported 8 HL places and 7 HL transitions for a total of 170 PT places and 2320.0 transition bindings in 39 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 48 ms.
FORMULA PhilosophersDyn-COL-10-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-28 02:23:12] [INFO ] Built PT skeleton of HLPN with 8 places and 7 transitions 33 arcs in 10 ms.
[2026-05-28 02:23:12] [INFO ] Skeletonized 15 HLPN properties in 7 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 15 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40008 steps (2821 resets) in 1443 ms. (27 steps per ms) remains 63/79 properties
BEST_FIRST walk for 4004 steps (208 resets) in 111 ms. (35 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (40 resets) in 103 ms. (38 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (149 resets) in 149 ms. (26 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (198 resets) in 184 ms. (21 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (32 resets) in 65 ms. (60 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (56 resets) in 84 ms. (47 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (127 resets) in 62 ms. (63 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (31 resets) in 96 ms. (41 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4001 steps (210 resets) in 63 ms. (62 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (136 resets) in 46 ms. (85 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (137 resets) in 41 ms. (95 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (294 resets) in 87 ms. (45 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (400 resets) in 94 ms. (42 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (139 resets) in 47 ms. (83 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (203 resets) in 99 ms. (40 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (400 resets) in 58 ms. (67 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (400 resets) in 65 ms. (60 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (188 resets) in 37 ms. (105 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (43 resets) in 28 ms. (138 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (148 resets) in 27 ms. (143 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (141 resets) in 35 ms. (111 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (44 resets) in 35 ms. (111 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (195 resets) in 34 ms. (114 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (400 resets) in 34 ms. (114 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (42 resets) in 20 ms. (190 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (59 resets) in 22 ms. (174 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (400 resets) in 39 ms. (100 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (200 resets) in 31 ms. (125 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (209 resets) in 54 ms. (72 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (198 resets) in 42 ms. (93 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (400 resets) in 46 ms. (85 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (200 resets) in 24 ms. (160 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (209 resets) in 25 ms. (153 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (40 resets) in 23 ms. (166 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (33 resets) in 17 ms. (222 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (400 resets) in 53 ms. (74 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (40 resets) in 21 ms. (181 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (200 resets) in 26 ms. (148 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (149 resets) in 30 ms. (129 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (400 resets) in 50 ms. (78 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (136 resets) in 33 ms. (117 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (196 resets) in 38 ms. (102 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4001 steps (197 resets) in 29 ms. (133 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4008 steps (58 resets) in 46 ms. (85 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (33 resets) in 15 ms. (250 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (201 resets) in 22 ms. (174 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (133 resets) in 19 ms. (200 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4005 steps (60 resets) in 17 ms. (222 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4001 steps (206 resets) in 24 ms. (160 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (130 resets) in 20 ms. (190 steps per ms) remains 63/63 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16094538158383832267.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15133336407449511377.kers'
[2026-05-28 02:23:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16094538158383832267.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15133336407449511377.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 7 rows 7 cols 21 entries
Finished phase 1 with 3 SingleSign rule and 2 generalized
[2026-05-28 02:23:13] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15133336407449511377.kers
Total runtime 2 ms.
[2026-05-28 02:23:13] [INFO ] State equation strengthened by 4 read => feed constraints.
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp75 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 1/1 constraints. Problems are: Problem set: 16 solved, 47 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp76 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp78 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 2/3 constraints. Problems are: Problem set: 55 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 55 solved, 8 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp64 is UNSAT
At refinement iteration 3 (OVERLAPS) 7/15 variables, 8/11 constraints. Problems are: Problem set: 59 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 4/15 constraints. Problems are: Problem set: 59 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 59 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/15 variables, 0/15 constraints. Problems are: Problem set: 59 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/15 variables, and 15 constraints, problems are : Problem set: 59 solved, 4 unsolved in 644 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 8/8 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 59 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 59 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 59 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 3/8 variables, 2/3 constraints. Problems are: Problem set: 59 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 59 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 7/15 variables, 8/11 constraints. Problems are: Problem set: 59 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 4/15 constraints. Problems are: Problem set: 59 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 4/19 constraints. Problems are: Problem set: 59 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/15 variables, 0/19 constraints. Problems are: Problem set: 59 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/15 variables, 0/19 constraints. Problems are: Problem set: 59 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/15 variables, and 19 constraints, problems are : Problem set: 59 solved, 4 unsolved in 208 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 8/8 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/63 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 991ms problems are : Problem set: 59 solved, 4 unsolved
Parikh walk visited 0 properties in 287 ms.
Support contains 5 out of 8 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8/8 places, 7/7 transitions.
Applied a total of 0 rules in 16 ms. Remains 8 /8 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2026-05-28 02:23:15] [INFO ] Invariant cache hit.
[2026-05-28 02:23:15] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 7/15 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/15 variables, and 15 constraints, problems are : Problem set: 0 solved, 6 unsolved in 202 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 8/8 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 7/15 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 6/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/15 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/15 variables, and 21 constraints, problems are : Problem set: 0 solved, 6 unsolved in 196 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 8/8 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 409ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 412ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 484 ms. Remains : 8/8 places, 7/7 transitions.
RANDOM walk for 40010 steps (2821 resets) in 101 ms. (392 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (2034 resets) in 185 ms. (215 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (2036 resets) in 110 ms. (360 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (2033 resets) in 87 ms. (454 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (346 resets) in 141 ms. (281 steps per ms) remains 4/4 properties
Probably explored full state space saw : 504 states, properties seen :0
Probabilistic random walk after 1609 steps, saw 504 distinct states, run finished after 31 ms. (steps per millisecond=51 ) properties seen :0
Explored full state space saw : 504 states, properties seen :0
Exhaustive walk after 1609 steps, saw 504 distinct states, run finished after 18 ms. (steps per millisecond=89 ) properties seen :0
Successfully simplified 63 atomic propositions for a total of 15 simplifications.
FORMULA PhilosophersDyn-COL-10-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-10-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-10-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-10-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-10-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-10-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-28 02:23:15] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2026-05-28 02:23:15] [INFO ] Flatten gal took : 31 ms
[2026-05-28 02:23:15] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA PhilosophersDyn-COL-10-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-10-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-10-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-10-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-10-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-10-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-10-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-10-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-28 02:23:15] [INFO ] Flatten gal took : 5 ms
Domain [Philosopher(10), Philosopher(10)] of place Neighbourhood breaks symmetries in sort Philosopher
[2026-05-28 02:23:16] [INFO ] Unfolded HLPN to a Petri net with 170 places and 2310 transitions 18190 arcs in 139 ms.
[2026-05-28 02:23:16] [INFO ] Unfolded 1 HLPN properties in 0 ms.
Ensure Unique test removed 45 transitions
Reduce redundant transitions removed 45 transitions.
Support contains 50 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 2265/2265 transitions.
Applied a total of 0 rules in 105 ms. Remains 170 /170 variables (removed 0) and now considering 2265/2265 (removed 0) transitions.
Running 2220 sub problems to find dead transitions.
[2026-05-28 02:23:16] [INFO ] Flow matrix only has 1905 transitions (discarded 360 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18315225235027550710.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-799719307998926542.kers'
[2026-05-28 02:23:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18315225235027550710.kers, --Pflows, --basisKERS=/tmp/petrispot-output-799719307998926542.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1905 rows 170 cols 10190 entries
Finished phase 1 with 50 SingleSign rule and 81 generalized
[2026-05-28 02:23:16] [INFO ] Computed 39 invariants in 16 ms
Computed 39 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-799719307998926542.kers
Total runtime 21 ms.
[2026-05-28 02:23:16] [INFO ] State equation strengthened by 1030 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Problem TDEAD45 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD943 is UNSAT
Problem TDEAD945 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1095 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1133 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1176 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1233 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1277 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1297 is UNSAT
Problem TDEAD1307 is UNSAT
Problem TDEAD1317 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1348 is UNSAT
Problem TDEAD1358 is UNSAT
Problem TDEAD1368 is UNSAT
Problem TDEAD1378 is UNSAT
Problem TDEAD1388 is UNSAT
Problem TDEAD1398 is UNSAT
Problem TDEAD1408 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1428 is UNSAT
Problem TDEAD1433 is UNSAT
Problem TDEAD1438 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1449 is UNSAT
Problem TDEAD1459 is UNSAT
Problem TDEAD1469 is UNSAT
Problem TDEAD1479 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1499 is UNSAT
Problem TDEAD1509 is UNSAT
Problem TDEAD1519 is UNSAT
Problem TDEAD1529 is UNSAT
Problem TDEAD1533 is UNSAT
Problem TDEAD1539 is UNSAT
Problem TDEAD1545 is UNSAT
Problem TDEAD1550 is UNSAT
Problem TDEAD1560 is UNSAT
Problem TDEAD1570 is UNSAT
Problem TDEAD1580 is UNSAT
Problem TDEAD1590 is UNSAT
Problem TDEAD1600 is UNSAT
Problem TDEAD1610 is UNSAT
Problem TDEAD1620 is UNSAT
Problem TDEAD1630 is UNSAT
Problem TDEAD1633 is UNSAT
Problem TDEAD1640 is UNSAT
Problem TDEAD1645 is UNSAT
Problem TDEAD1651 is UNSAT
Problem TDEAD1661 is UNSAT
Problem TDEAD1671 is UNSAT
Problem TDEAD1681 is UNSAT
Problem TDEAD1691 is UNSAT
Problem TDEAD1701 is UNSAT
Problem TDEAD1711 is UNSAT
Problem TDEAD1721 is UNSAT
Problem TDEAD1731 is UNSAT
Problem TDEAD1733 is UNSAT
Problem TDEAD1741 is UNSAT
Problem TDEAD1745 is UNSAT
Problem TDEAD1752 is UNSAT
Problem TDEAD1762 is UNSAT
Problem TDEAD1772 is UNSAT
Problem TDEAD1782 is UNSAT
Problem TDEAD1792 is UNSAT
Problem TDEAD1802 is UNSAT
Problem TDEAD1812 is UNSAT
Problem TDEAD1822 is UNSAT
Problem TDEAD1832 is UNSAT
Problem TDEAD1833 is UNSAT
Problem TDEAD1842 is UNSAT
Problem TDEAD1845 is UNSAT
Problem TDEAD1853 is UNSAT
Problem TDEAD1863 is UNSAT
Problem TDEAD1873 is UNSAT
Problem TDEAD1883 is UNSAT
Problem TDEAD1893 is UNSAT
Problem TDEAD1903 is UNSAT
Problem TDEAD1913 is UNSAT
Problem TDEAD1923 is UNSAT
Problem TDEAD1933 is UNSAT
Problem TDEAD1943 is UNSAT
Problem TDEAD1945 is UNSAT
Problem TDEAD2033 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 31/31 constraints. Problems are: Problem set: 216 solved, 2004 unsolved
Problem TDEAD56 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD944 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD964 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1004 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1344 is UNSAT
Problem TDEAD1356 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1389 is UNSAT
Problem TDEAD1400 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1422 is UNSAT
Problem TDEAD1444 is UNSAT
Problem TDEAD1456 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1478 is UNSAT
Problem TDEAD1500 is UNSAT
Problem TDEAD1511 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1544 is UNSAT
Problem TDEAD1556 is UNSAT
Problem TDEAD1567 is UNSAT
Problem TDEAD1578 is UNSAT
Problem TDEAD1589 is UNSAT
Problem TDEAD1611 is UNSAT
Problem TDEAD1622 is UNSAT
Problem TDEAD1644 is UNSAT
Problem TDEAD1656 is UNSAT
Problem TDEAD1667 is UNSAT
Problem TDEAD1678 is UNSAT
Problem TDEAD1689 is UNSAT
Problem TDEAD1700 is UNSAT
Problem TDEAD1722 is UNSAT
Problem TDEAD1744 is UNSAT
Problem TDEAD1756 is UNSAT
Problem TDEAD1767 is UNSAT
Problem TDEAD1778 is UNSAT
Problem TDEAD1789 is UNSAT
Problem TDEAD1800 is UNSAT
Problem TDEAD1811 is UNSAT
Problem TDEAD1844 is UNSAT
Problem TDEAD1856 is UNSAT
Problem TDEAD1867 is UNSAT
Problem TDEAD1878 is UNSAT
Problem TDEAD1889 is UNSAT
Problem TDEAD1900 is UNSAT
Problem TDEAD1911 is UNSAT
Problem TDEAD1922 is UNSAT
Problem TDEAD1944 is UNSAT
Problem TDEAD1954 is UNSAT
Problem TDEAD1956 is UNSAT
Problem TDEAD1964 is UNSAT
Problem TDEAD1967 is UNSAT
Problem TDEAD1974 is UNSAT
Problem TDEAD1978 is UNSAT
Problem TDEAD1984 is UNSAT
Problem TDEAD1989 is UNSAT
Problem TDEAD1994 is UNSAT
Problem TDEAD2000 is UNSAT
Problem TDEAD2004 is UNSAT
Problem TDEAD2011 is UNSAT
Problem TDEAD2014 is UNSAT
Problem TDEAD2022 is UNSAT
Problem TDEAD2024 is UNSAT
Problem TDEAD2034 is UNSAT
Problem TDEAD2044 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 8/39 constraints. Problems are: Problem set: 380 solved, 1840 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/2075 variables, and 39 constraints, problems are : Problem set: 380 solved, 1840 unsolved in 20133 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/170 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 2040/1320 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 380 solved, 1840 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 31/31 constraints. Problems are: Problem set: 380 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 8/39 constraints. Problems are: Problem set: 380 solved, 1840 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 170/2075 variables, and 39 constraints, problems are : Problem set: 380 solved, 1840 unsolved in 20078 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/170 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 720/1320 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46449ms problems are : Problem set: 380 solved, 1840 unsolved
Search for dead transitions found 380 dead transitions in 46495ms
Found 380 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 380 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 380 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13706544392324141128.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-293414930134287599.kers'
[2026-05-28 02:24:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13706544392324141128.kers, --Pflows, --basisKERS=/tmp/petrispot-output-293414930134287599.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1885 rows 170 cols 10120 entries
Finished phase 1 with 40 SingleSign rule and 91 generalized
[2026-05-28 02:24:02] [INFO ] Computed 39 invariants in 24 ms
Computed 39 P flows in 25 ms.
Exported basis to /tmp/petrispot-output-293414930134287599.kers
Total runtime 28 ms.
[2026-05-28 02:24:03] [INFO ] Implicit Places using invariants in 558 ms returned []
[2026-05-28 02:24:03] [INFO ] Invariant cache hit.
[2026-05-28 02:24:04] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2026-05-28 02:24:49] [INFO ] Performed 17/170 implicitness test of which 0 returned IMPLICIT in 43 seconds.
[2026-05-28 02:25:19] [INFO ] Performed 61/170 implicitness test of which 0 returned IMPLICIT in 74 seconds.
[2026-05-28 02:25:24] [INFO ] Implicit Places using invariants and state equation in 81653 ms returned []
Implicit Place search using SMT with State Equation took 82236 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/170 places, 1885/2265 transitions.
Applied a total of 0 rules in 36 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 128909 ms. Remains : 170/170 places, 1885/2265 transitions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 30 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2026-05-28 02:25:25] [INFO ] Invariant cache hit.
[2026-05-28 02:25:25] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 31/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/2055 variables, and 39 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20065 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 0/170 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1840/1120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1840 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 31/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 170/2055 variables, and 39 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20047 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 0/170 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 720/1120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44105ms problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 44116ms
[2026-05-28 02:26:09] [INFO ] Invariant cache hit.
[2026-05-28 02:26:09] [INFO ] Implicit Places using invariants in 401 ms returned []
[2026-05-28 02:26:09] [INFO ] Invariant cache hit.
[2026-05-28 02:26:10] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2026-05-28 02:26:52] [INFO ] Performed 17/170 implicitness test of which 0 returned IMPLICIT in 41 seconds.
[2026-05-28 02:27:19] [INFO ] Implicit Places using invariants and state equation in 70050 ms returned []
Implicit Place search using SMT with State Equation took 70455 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 114620 ms. Remains : 170/170 places, 1885/1885 transitions.
Support contains 50 out of 170 places after structural reductions.
[2026-05-28 02:27:20] [INFO ] Flatten gal took : 537 ms
[2026-05-28 02:27:20] [INFO ] Flatten gal took : 326 ms
[2026-05-28 02:27:21] [INFO ] Input system was already deterministic with 1885 transitions.
RANDOM walk for 40000 steps (4781 resets) in 1829 ms. (21 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (308 resets) in 189 ms. (210 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (348 resets) in 173 ms. (229 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (389 resets) in 386 ms. (103 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 176805 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :0 out of 3
Probabilistic random walk after 176805 steps, saw 45848 distinct states, run finished after 3005 ms. (steps per millisecond=58 ) properties seen :0
[2026-05-28 02:27:24] [INFO ] Invariant cache hit.
[2026-05-28 02:27:25] [INFO ] State equation strengthened by 1010 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 73/123 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp2 is UNSAT
At refinement iteration 3 (OVERLAPS) 47/170 variables, 31/39 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem AtomicPropp0 is UNSAT
At refinement iteration 5 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2055/2055 variables, and 1219 constraints, problems are : Problem set: 2 solved, 1 unsolved in 2052 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 73/93 variables, 8/8 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 77/170 variables, 31/39 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2055/2055 variables, and 1219 constraints, problems are : Problem set: 2 solved, 1 unsolved in 1875 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3992ms problems are : Problem set: 2 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 378 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 379 ms. Remains : 170/170 places, 1885/1885 transitions.
RANDOM walk for 40000 steps (4779 resets) in 759 ms. (52 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (348 resets) in 72 ms. (547 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 227649 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :0 out of 1
Probabilistic random walk after 227649 steps, saw 58320 distinct states, run finished after 3001 ms. (steps per millisecond=75 ) properties seen :0
[2026-05-28 02:27:32] [INFO ] Invariant cache hit.
[2026-05-28 02:27:32] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 73/93 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 77/170 variables, 31/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/2055 variables, 1010/1219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2055 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/2055 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2055/2055 variables, and 1219 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1203 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 73/93 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 77/170 variables, 31/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2055/2055 variables, and 1219 constraints, problems are : Problem set: 0 solved, 1 unsolved in 9742 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10986ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 131 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 164 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2026-05-28 02:27:43] [INFO ] Invariant cache hit.
[2026-05-28 02:27:44] [INFO ] Implicit Places using invariants in 331 ms returned []
[2026-05-28 02:27:44] [INFO ] Invariant cache hit.
[2026-05-28 02:27:44] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2026-05-28 02:28:30] [INFO ] Performed 17/170 implicitness test of which 0 returned IMPLICIT in 45 seconds.
[2026-05-28 02:29:01] [INFO ] Performed 33/170 implicitness test of which 0 returned IMPLICIT in 75 seconds.
[2026-05-28 02:29:23] [INFO ] Implicit Places using invariants and state equation in 99135 ms returned []
Implicit Place search using SMT with State Equation took 99477 ms to find 0 implicit places.
[2026-05-28 02:29:23] [INFO ] Redundant transitions in 259 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99927 ms. Remains : 170/170 places, 1885/1885 transitions.
Successfully simplified 2 atomic propositions for a total of 1 simplifications.
[2026-05-28 02:29:23] [INFO ] Flatten gal took : 132 ms
[2026-05-28 02:29:23] [INFO ] Flatten gal took : 121 ms
[2026-05-28 02:29:24] [INFO ] Input system was already deterministic with 1885 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 8 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Skipped dead transition search.
[2026-05-28 02:29:24] [INFO ] Invariant cache hit.
[2026-05-28 02:29:24] [INFO ] Implicit Places using invariants in 329 ms returned []
[2026-05-28 02:29:24] [INFO ] Invariant cache hit.
[2026-05-28 02:29:25] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2026-05-28 02:30:09] [INFO ] Performed 17/170 implicitness test of which 0 returned IMPLICIT in 43 seconds.
[2026-05-28 02:30:38] [INFO ] Implicit Places using invariants and state equation in 73420 ms returned []
Implicit Place search using SMT with State Equation took 73753 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 73764 ms. Remains : 170/170 places, 1885/1885 transitions.
[2026-05-28 02:30:38] [INFO ] Flatten gal took : 147 ms
[2026-05-28 02:30:38] [INFO ] Flatten gal took : 164 ms
[2026-05-28 02:30:38] [INFO ] Input system was already deterministic with 1885 transitions.
[2026-05-28 02:30:38] [INFO ] Flatten gal took : 140 ms
[2026-05-28 02:30:39] [INFO ] Flatten gal took : 120 ms
[2026-05-28 02:30:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality17039795979819087063.gal : 85 ms
[2026-05-28 02:30:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality551848060136466658.ctl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17039795979819087063.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality551848060136466658.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-28 02:31:09] [INFO ] Flatten gal took : 91 ms
[2026-05-28 02:31:09] [INFO ] Applying decomposition
[2026-05-28 02:31:09] [INFO ] Flatten gal took : 150 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph14753593351926205316.txt' '-o' '/tmp/graph14753593351926205316.bin' '-w' '/tmp/graph14753593351926205316.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14753593351926205316.bin' '-l' '-1' '-v' '-w' '/tmp/graph14753593351926205316.weights' '-q' '0' '-e' '0.001'
[2026-05-28 02:31:10] [INFO ] Decomposing Gal with order
[2026-05-28 02:31:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-28 02:31:11] [INFO ] Removed a total of 3044 redundant transitions.
[2026-05-28 02:31:12] [INFO ] Flatten gal took : 1912 ms
[2026-05-28 02:31:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 1589 labels/synchronizations in 382 ms.
[2026-05-28 02:31:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality5781323359072735177.gal : 37 ms
[2026-05-28 02:31:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality17893969656829051436.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5781323359072735177.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17893969656829051436.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-28 02:31:44] [INFO ] Flatten gal took : 319 ms
[2026-05-28 02:31:44] [INFO ] Flatten gal took : 288 ms
[2026-05-28 02:31:44] [INFO ] Applying decomposition
[2026-05-28 02:31:44] [INFO ] Flatten gal took : 136 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph3866034755116776195.txt' '-o' '/tmp/graph3866034755116776195.bin' '-w' '/tmp/graph3866034755116776195.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3866034755116776195.bin' '-l' '-1' '-v' '-w' '/tmp/graph3866034755116776195.weights' '-q' '0' '-e' '0.001'
[2026-05-28 02:31:44] [INFO ] Decomposing Gal with order
[2026-05-28 02:31:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-28 02:31:46] [INFO ] Removed a total of 2679 redundant transitions.
[2026-05-28 02:31:46] [INFO ] Flatten gal took : 1891 ms
[2026-05-28 02:31:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 1374 labels/synchronizations in 201 ms.
[2026-05-28 02:31:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality17633290767728254044.gal : 24 ms
[2026-05-28 02:31:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality5147749825770692706.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17633290767728254044.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5147749825770692706.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-28 02:54:49] [INFO ] Applying decomposition
[2026-05-28 02:54:51] [INFO ] Flatten gal took : 1699 ms
[2026-05-28 02:54:52] [INFO ] Decomposing Gal with order
[2026-05-28 02:54:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-28 02:54:54] [INFO ] Removed a total of 8710 redundant transitions.
[2026-05-28 02:54:54] [INFO ] Flatten gal took : 1579 ms
[2026-05-28 02:54:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 376 ms.
[2026-05-28 02:54:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality9039640543006476699.gal : 75 ms
[2026-05-28 02:54:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality6829410569052048191.ctl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9039640543006476699.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6829410569052048191.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,199051,79.4508,1774372,2,177783,5,2.71123e+06,6,0,2608,825871,0

Converting to forward existential form...Done !
original formula: EF(EX(AG((((((gPhilosopher0.Outside_0+gPhilosopher1.Outside_1)+(gPhilosopher2.Outside_2+gPhilosopher3.Outside_3))+((gPhilosopher4.Outside...527
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(E(TRUE U !((((((gPhilosopher0.Outside_0+gPhilosopher1.Outside_1)+(gPhilosopher2.Outsid...591
Reverse transition relation is NOT exact ! Due to transitions t855, t856, t857, t858, t859, t860, t861, t862, t863, t864, t865, t866, t867, t868, t869, t87...5690
(forward)formula 0,1,524.312,9123724,1,0,4263,2.9522e+07,3680,1743,46274,1.10232e+07,3664
FORMULA PhilosophersDyn-COL-10-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

Total runtime 2436870 ms.

BK_STOP 1779937429187

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PhilosophersDyn-COL-10"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is PhilosophersDyn-COL-10, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r210-smll-177969942000201"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-COL-10.tgz
mv PhilosophersDyn-COL-10 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;