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.r338-smll-178021499300467.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 FileSystem-PT-N05I10B15, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r338-smll-178021499300467
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 784K
-rw-r--r-- 1 mcc users 8.2K May 27 10:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 27 10:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 27 10:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 27 10:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jun 16 12:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 16 12:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 16 12:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 16 12:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 13K May 27 10:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K May 27 10:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 27 10:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K May 27 10:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 16 12:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Jun 16 12:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 10 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 349K Jun 10 11:57 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 FileSystem-PT-N05I10B15-LTLCardinality-00
FORMULA_NAME FileSystem-PT-N05I10B15-LTLCardinality-01
FORMULA_NAME FileSystem-PT-N05I10B15-LTLCardinality-02
FORMULA_NAME FileSystem-PT-N05I10B15-LTLCardinality-03
FORMULA_NAME FileSystem-PT-N05I10B15-LTLCardinality-04
FORMULA_NAME FileSystem-PT-N05I10B15-LTLCardinality-05
FORMULA_NAME FileSystem-PT-N05I10B15-LTLCardinality-06
FORMULA_NAME FileSystem-PT-N05I10B15-LTLCardinality-07
FORMULA_NAME FileSystem-PT-N05I10B15-LTLCardinality-08
FORMULA_NAME FileSystem-PT-N05I10B15-LTLCardinality-09
FORMULA_NAME FileSystem-PT-N05I10B15-LTLCardinality-10
FORMULA_NAME FileSystem-PT-N05I10B15-LTLCardinality-11
FORMULA_NAME FileSystem-PT-N05I10B15-LTLCardinality-12
FORMULA_NAME FileSystem-PT-N05I10B15-LTLCardinality-13
FORMULA_NAME FileSystem-PT-N05I10B15-LTLCardinality-14
FORMULA_NAME FileSystem-PT-N05I10B15-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1781616299736

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FileSystem-PT-N05I10B15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-06-16 13:25:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-06-16 13:25:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-16 13:25:02] [INFO ] Load time of PNML (sax parser for PT used): 227 ms
[2026-06-16 13:25:02] [INFO ] Transformed 826 places.
[2026-06-16 13:25:02] [INFO ] Transformed 770 transitions.
[2026-06-16 13:25:02] [INFO ] Parsed PT model containing 826 places and 770 transitions and 2750 arcs in 433 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Reduce places removed 10 places and 0 transitions.
FORMULA FileSystem-PT-N05I10B15-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N05I10B15-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N05I10B15-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 816 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 816/816 places, 770/770 transitions.
Reduce places removed 139 places and 0 transitions.
Iterating post reduction 0 with 139 rules applied. Total rules applied 139 place count 677 transition count 770
Discarding 118 places :
Symmetric choice reduction at 1 with 118 rule applications. Total rules 257 place count 559 transition count 652
Iterating global reduction 1 with 118 rules applied. Total rules applied 375 place count 559 transition count 652
Applied a total of 375 rules in 189 ms. Remains 559 /816 variables (removed 257) and now considering 652/770 (removed 118) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12322855699987951308.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17346556481181058923.kers'
[2026-06-16 13:25:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12322855699987951308.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17346556481181058923.kers]
Culling duplicate invariants (modulo rational): removing 15 columns.
Culled 15 columns in 1 ms.
// Phase 1: matrix 652 rows 544 cols 1807 entries
Finished phase 1 with 527 SingleSign rule and 0 generalized
[2026-06-16 13:25:03] [INFO ] Computed 32 invariants in 12 ms
Computed 32 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-17346556481181058923.kers
Total runtime 15 ms.
[2026-06-16 13:25:04] [INFO ] Implicit Places using invariants in 1164 ms returned []
[2026-06-16 13:25:04] [INFO ] Invariant cache hit.
[2026-06-16 13:25:05] [INFO ] State equation strengthened by 150 read => feed constraints.
[2026-06-16 13:25:09] [INFO ] Implicit Places using invariants and state equation in 5028 ms returned []
Implicit Place search using SMT with State Equation took 6271 ms to find 0 implicit places.
Running 642 sub problems to find dead transitions.
[2026-06-16 13:25:09] [INFO ] Invariant cache hit.
[2026-06-16 13:25:09] [INFO ] State equation strengthened by 150 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 2 (OVERLAPS) 11/548 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 642 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
SMT process timed out in 30691ms, After SMT, problems are : Problem set: 14 solved, 628 unsolved
Search for dead transitions found 14 dead transitions in 30744ms
Found 14 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 14 transitions
Dead transitions reduction (with SMT) removed 14 transitions
Starting structural reductions in LTL mode, iteration 1 : 559/816 places, 638/770 transitions.
Reduce places removed 25 places and 28 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 534 transition count 610
Reduce places removed 15 places and 18 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 40 place count 519 transition count 592
Deduced a syphon composed of 8 places in 2 ms
Applied a total of 40 rules in 43 ms. Remains 519 /559 variables (removed 40) and now considering 592/638 (removed 46) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8936344695800310093.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16307815330177838820.kers'
[2026-06-16 13:25:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8936344695800310093.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16307815330177838820.kers]
Culling trivial invariants: removing 8 columns.
Culling duplicate invariants (modulo rational): removing 15 columns.
Culled 23 columns in 0 ms.
// Phase 1: matrix 592 rows 496 cols 1638 entries
Finished phase 1 with 479 SingleSign rule and 1 generalized
[2026-06-16 13:25:40] [INFO ] Computed 39 invariants in 6 ms
Computed 39 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-16307815330177838820.kers
Total runtime 7 ms.
[2026-06-16 13:25:40] [INFO ] Implicit Places using invariants in 418 ms returned []
[2026-06-16 13:25:40] [INFO ] Invariant cache hit.
[2026-06-16 13:25:41] [INFO ] State equation strengthened by 136 read => feed constraints.
[2026-06-16 13:25:44] [INFO ] Implicit Places using invariants and state equation in 3872 ms returned []
Implicit Place search using SMT with State Equation took 4293 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 519/816 places, 592/770 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41654 ms. Remains : 519/816 places, 592/770 transitions.
Starting structural reductions in LTL mode, iteration 0 : 519/519 places, 592/592 transitions.
Deduced a syphon composed of 8 places in 6 ms
Applied a total of 0 rules in 15 ms. Remains 519 /519 variables (removed 0) and now considering 592/592 (removed 0) transitions.
[2026-06-16 13:25:44] [INFO ] Invariant cache hit.
[2026-06-16 13:25:45] [INFO ] Implicit Places using invariants in 345 ms returned []
[2026-06-16 13:25:45] [INFO ] Invariant cache hit.
[2026-06-16 13:25:45] [INFO ] State equation strengthened by 136 read => feed constraints.
[2026-06-16 13:25:49] [INFO ] Implicit Places using invariants and state equation in 3796 ms returned []
Implicit Place search using SMT with State Equation took 4173 ms to find 0 implicit places.
Running 582 sub problems to find dead transitions.
[2026-06-16 13:25:49] [INFO ] Invariant cache hit.
[2026-06-16 13:25:49] [INFO ] State equation strengthened by 136 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/491 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/491 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 2 (OVERLAPS) 11/502 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 582 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/502 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 582 unsolved
SMT process timed out in 30188ms, After SMT, problems are : Problem set: 0 solved, 582 unsolved
Search for dead transitions found 0 dead transitions in 30193ms
Finished structural reductions in LTL mode , in 1 iterations and 34385 ms. Remains : 519/519 places, 592/592 transitions.
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Support contains 32 out of 511 places after structural reductions.
FORMULA FileSystem-PT-N05I10B15-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-06-16 13:26:19] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2026-06-16 13:26:19] [INFO ] Flatten gal took : 144 ms
FORMULA FileSystem-PT-N05I10B15-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-06-16 13:26:19] [INFO ] Flatten gal took : 78 ms
[2026-06-16 13:26:19] [INFO ] Input system was already deterministic with 592 transitions.
Support contains 28 out of 511 places (down from 32) after GAL structural reductions.
RANDOM walk for 40000 steps (784 resets) in 2480 ms. (16 steps per ms) remains 16/20 properties
BEST_FIRST walk for 4004 steps (12 resets) in 52 ms. (75 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (12 resets) in 47 ms. (83 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (12 resets) in 84 ms. (47 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (11 resets) in 54 ms. (72 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (12 resets) in 66 ms. (59 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (12 resets) in 62 ms. (63 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (12 resets) in 21 ms. (182 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (12 resets) in 44 ms. (88 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (12 resets) in 39 ms. (100 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (11 resets) in 36 ms. (108 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (12 resets) in 45 ms. (87 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (12 resets) in 32 ms. (121 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (12 resets) in 25 ms. (154 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (12 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (12 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (12 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14676420340832169102.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7007578653172464314.kers'
[2026-06-16 13:26:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14676420340832169102.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7007578653172464314.kers]
Culling duplicate invariants (modulo rational): removing 15 columns.
Culled 15 columns in 0 ms.
// Phase 1: matrix 592 rows 496 cols 1638 entries
Finished phase 1 with 479 SingleSign rule and 1 generalized
[2026-06-16 13:26:20] [INFO ] Computed 31 invariants in 6 ms
Computed 31 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-7007578653172464314.kers
Total runtime 8 ms.
[2026-06-16 13:26:20] [INFO ] State equation strengthened by 136 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp16 is UNSAT
At refinement iteration 1 (OVERLAPS) 195/218 variables, 10/10 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 0/10 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 37/255 variables, 1/11 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 0/11 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 110/365 variables, 20/31 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/31 constraints. Problems are: Problem set: 4 solved, 12 unsolved
Problem AtomicPropp13 is UNSAT
At refinement iteration 7 (OVERLAPS) 582/947 variables, 365/396 constraints. Problems are: Problem set: 5 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/947 variables, 136/532 constraints. Problems are: Problem set: 5 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/947 variables, 0/532 constraints. Problems are: Problem set: 5 solved, 11 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp8 is UNSAT
At refinement iteration 10 (OVERLAPS) 156/1103 variables, 146/678 constraints. Problems are: Problem set: 7 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1103 variables, 0/678 constraints. Problems are: Problem set: 7 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 0/1103 variables, 0/678 constraints. Problems are: Problem set: 7 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1103/1103 variables, and 678 constraints, problems are : Problem set: 7 solved, 9 unsolved in 1785 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 511/511 constraints, ReadFeed: 136/136 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 119/135 variables, 6/6 constraints. Problems are: Problem set: 7 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/6 constraints. Problems are: Problem set: 7 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 42/177 variables, 1/7 constraints. Problems are: Problem set: 7 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 4/11 constraints. Problems are: Problem set: 7 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 0/11 constraints. Problems are: Problem set: 7 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 186/363 variables, 24/35 constraints. Problems are: Problem set: 7 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 3/38 constraints. Problems are: Problem set: 7 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 0/38 constraints. Problems are: Problem set: 7 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 582/945 variables, 363/401 constraints. Problems are: Problem set: 7 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/945 variables, 136/537 constraints. Problems are: Problem set: 7 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/945 variables, 5/542 constraints. Problems are: Problem set: 7 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/945 variables, 0/542 constraints. Problems are: Problem set: 7 solved, 9 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp17 is UNSAT
After SMT solving in domain Int declared 1103/1103 variables, and 690 constraints, problems are : Problem set: 16 solved, 0 unsolved in 2815 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 511/511 constraints, ReadFeed: 136/136 constraints, PredecessorRefiner: 5/16 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4633ms problems are : Problem set: 16 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 16 atomic propositions for a total of 11 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA FileSystem-PT-N05I10B15-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N05I10B15-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N05I10B15-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N05I10B15-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N05I10B15-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N05I10B15-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N05I10B15-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 91 stabilizing places and 187 stable transitions
Graph (complete) has 1240 edges and 511 vertex of which 502 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.14 ms
FORMULA FileSystem-PT-N05I10B15-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(!p0))||(p0&&F(!p0)))))'
Support contains 1 out of 511 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 511/511 places, 592/592 transitions.
Graph (complete) has 1240 edges and 511 vertex of which 503 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.4 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 503 transition count 582
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 493 transition count 582
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 33 place count 481 transition count 570
Iterating global reduction 2 with 12 rules applied. Total rules applied 45 place count 481 transition count 570
Performed 151 Post agglomeration using F-continuation condition.Transition count delta: 151
Deduced a syphon composed of 151 places in 1 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 2 with 302 rules applied. Total rules applied 347 place count 330 transition count 419
Applied a total of 347 rules in 113 ms. Remains 330 /511 variables (removed 181) and now considering 419/592 (removed 173) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4372114414971102045.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17927084961428060034.kers'
[2026-06-16 13:26:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4372114414971102045.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17927084961428060034.kers]
Culling duplicate invariants (modulo rational): removing 15 columns.
Culled 15 columns in 0 ms.
// Phase 1: matrix 419 rows 315 cols 1392 entries
Finished phase 1 with 298 SingleSign rule and 1 generalized
[2026-06-16 13:26:25] [INFO ] Computed 31 invariants in 3 ms
Computed 31 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-17927084961428060034.kers
Total runtime 5 ms.
[2026-06-16 13:26:26] [INFO ] Implicit Places using invariants in 286 ms returned []
[2026-06-16 13:26:26] [INFO ] Invariant cache hit.
[2026-06-16 13:26:26] [INFO ] State equation strengthened by 136 read => feed constraints.
[2026-06-16 13:26:28] [INFO ] Implicit Places using invariants and state equation in 2693 ms returned []
Implicit Place search using SMT with State Equation took 2983 ms to find 0 implicit places.
[2026-06-16 13:26:28] [INFO ] Redundant transitions in 43 ms returned []
Running 409 sub problems to find dead transitions.
[2026-06-16 13:26:28] [INFO ] Invariant cache hit.
[2026-06-16 13:26:28] [INFO ] State equation strengthened by 136 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/318 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/318 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (OVERLAPS) 11/329 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/329 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 419/748 variables, 329/360 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/748 variables, 136/496 constraints. Problems are: Problem set: 183 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/748 variables, 0/496 constraints. Problems are: Problem set: 183 solved, 226 unsolved
SMT process timed out in 30157ms, After SMT, problems are : Problem set: 183 solved, 226 unsolved
Search for dead transitions found 183 dead transitions in 30162ms
Found 183 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 183 transitions
Dead transitions reduction (with SMT) removed 183 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 330/511 places, 236/592 transitions.
Graph (complete) has 625 edges and 330 vertex of which 214 are kept as prefixes of interest. Removing 116 places using SCC suffix rule.2 ms
Discarding 116 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 15 ms. Remains 214 /330 variables (removed 116) and now considering 236/236 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18001512893018190570.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9203076544391172511.kers'
[2026-06-16 13:26:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18001512893018190570.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9203076544391172511.kers]
Culling duplicate invariants (modulo rational): removing 15 columns.
Culled 15 columns in 0 ms.
// Phase 1: matrix 236 rows 199 cols 785 entries
Finished phase 1 with 182 SingleSign rule and 1 generalized
[2026-06-16 13:26:59] [INFO ] Computed 31 invariants in 1 ms
Computed 31 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9203076544391172511.kers
Total runtime 2 ms.
[2026-06-16 13:26:59] [INFO ] Implicit Places using invariants in 242 ms returned []
[2026-06-16 13:26:59] [INFO ] Invariant cache hit.
[2026-06-16 13:26:59] [INFO ] State equation strengthened by 69 read => feed constraints.
[2026-06-16 13:27:00] [INFO ] Implicit Places using invariants and state equation in 1294 ms returned []
Implicit Place search using SMT with State Equation took 1539 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 214/511 places, 236/592 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 34870 ms. Remains : 214/511 places, 236/592 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||(!p0&&F(p0)))))'
Stuttering acceptance computed with spot in 267 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FileSystem-PT-N05I10B15-LTLCardinality-00
Product exploration explored 100000 steps with 3981 reset in 434 ms.
Product exploration explored 100000 steps with 3966 reset in 384 ms.
Computed a total of 214 stabilizing places and 236 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 214 transition count 236
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 4 factoid took 88 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 92 steps (0 resets) in 5 ms. (15 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 88 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
[2026-06-16 13:27:02] [INFO ] Invariant cache hit.
[2026-06-16 13:27:02] [INFO ] [Real]Absence check using 30 positive place invariants in 23 ms returned sat
[2026-06-16 13:27:02] [INFO ] [Real]Absence check using 30 positive and 1 generalized place invariants in 4 ms returned sat
[2026-06-16 13:27:04] [INFO ] [Real]Absence check using state equation in 1845 ms returned sat
[2026-06-16 13:27:04] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 13:27:04] [INFO ] [Nat]Absence check using 30 positive place invariants in 18 ms returned sat
[2026-06-16 13:27:04] [INFO ] [Nat]Absence check using 30 positive and 1 generalized place invariants in 1 ms returned sat
[2026-06-16 13:27:04] [INFO ] [Nat]Absence check using state equation in 332 ms returned sat
[2026-06-16 13:27:04] [INFO ] State equation strengthened by 69 read => feed constraints.
[2026-06-16 13:27:05] [INFO ] [Nat]Added 69 Read/Feed constraints in 149 ms returned sat
[2026-06-16 13:27:05] [INFO ] Computed and/alt/rep : 226/595/226 causal constraints (skipped 0 transitions) in 18 ms.
[2026-06-16 13:27:05] [INFO ] Added : 20 causal constraints over 4 iterations in 243 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 3620 ms.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 214 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 214/214 places, 236/236 transitions.
Applied a total of 0 rules in 13 ms. Remains 214 /214 variables (removed 0) and now considering 236/236 (removed 0) transitions.
[2026-06-16 13:27:05] [INFO ] Invariant cache hit.
[2026-06-16 13:27:05] [INFO ] Implicit Places using invariants in 203 ms returned []
[2026-06-16 13:27:05] [INFO ] Invariant cache hit.
[2026-06-16 13:27:05] [INFO ] State equation strengthened by 69 read => feed constraints.
[2026-06-16 13:27:07] [INFO ] Implicit Places using invariants and state equation in 1378 ms returned []
Implicit Place search using SMT with State Equation took 1583 ms to find 0 implicit places.
[2026-06-16 13:27:07] [INFO ] Redundant transitions in 2 ms returned []
Running 226 sub problems to find dead transitions.
[2026-06-16 13:27:07] [INFO ] Invariant cache hit.
[2026-06-16 13:27:07] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/202 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (OVERLAPS) 11/213 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (OVERLAPS) 236/449 variables, 213/244 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/449 variables, 69/313 constraints. Problems are: Problem set: 0 solved, 226 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/449 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (OVERLAPS) 1/450 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 450/450 variables, and 314 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 214/214 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/202 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (OVERLAPS) 11/213 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (OVERLAPS) 236/449 variables, 213/244 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/449 variables, 69/313 constraints. Problems are: Problem set: 205 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/449 variables, 19/332 constraints. Problems are: Problem set: 205 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/449 variables, 0/332 constraints. Problems are: Problem set: 205 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 1/450 variables, 1/333 constraints. Problems are: Problem set: 205 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/450 variables, 2/335 constraints. Problems are: Problem set: 205 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/450 variables, 0/335 constraints. Problems are: Problem set: 205 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 0/450 variables, 0/335 constraints. Problems are: Problem set: 205 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 450/450 variables, and 335 constraints, problems are : Problem set: 205 solved, 21 unsolved in 12255 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 214/214 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 21/226 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42299ms problems are : Problem set: 205 solved, 21 unsolved
Search for dead transitions found 205 dead transitions in 42301ms
Found 205 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 205 transitions
Dead transitions reduction (with SMT) removed 205 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 214/214 places, 31/236 transitions.
Graph (complete) has 101 edges and 214 vertex of which 53 are kept as prefixes of interest. Removing 161 places using SCC suffix rule.0 ms
Discarding 161 places :
Also discarding 0 output transitions
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 1 place count 53 transition count 20
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 33 place count 32 transition count 20
Applied a total of 33 rules in 12 ms. Remains 32 /214 variables (removed 182) and now considering 20/31 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17504057154925942046.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6989592094594680765.kers'
[2026-06-16 13:27:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17504057154925942046.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6989592094594680765.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 20 rows 31 cols 60 entries
Finished phase 1 with 10 SingleSign rule and 10 generalized
[2026-06-16 13:27:49] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6989592094594680765.kers
Total runtime 1 ms.
[2026-06-16 13:27:49] [INFO ] Implicit Places using invariants in 66 ms returned [10, 11, 12, 13, 14, 15, 16, 17, 18, 19]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 69 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 22/214 places, 20/236 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 22 transition count 11
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 13 transition count 11
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 26 place count 5 transition count 3
Iterating global reduction 2 with 8 rules applied. Total rules applied 34 place count 5 transition count 3
Applied a total of 34 rules in 2 ms. Remains 5 /22 variables (removed 17) and now considering 3/20 (removed 17) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8134013677965344554.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15556332997240464529.kers'
[2026-06-16 13:27:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8134013677965344554.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15556332997240464529.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 3 rows 4 cols 5 entries
Finished phase 1 with 3 SingleSign rule and 0 generalized
[2026-06-16 13:27:49] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15556332997240464529.kers
Total runtime 0 ms.
[2026-06-16 13:27:49] [INFO ] Implicit Places using invariants in 28 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 4/214 places, 3/236 transitions.
Graph (complete) has 2 edges and 4 vertex of which 3 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 0 ms. Remains 2 /4 variables (removed 2) and now considering 1/3 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7985000063721795596.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13033984934904368717.kers'
[2026-06-16 13:27:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7985000063721795596.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13033984934904368717.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 1 rows 1 cols 1 entries
Finished phase 1 with 1 SingleSign rule and 0 generalized
[2026-06-16 13:27:49] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13033984934904368717.kers
Total runtime 0 ms.
[2026-06-16 13:27:49] [INFO ] Implicit Places using invariants in 22 ms returned []
[2026-06-16 13:27:49] [INFO ] Invariant cache hit.
[2026-06-16 13:27:49] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 2/214 places, 1/236 transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 44066 ms. Remains : 2/214 places, 1/236 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 4 factoid took 56 ms. Proved property starting from automaton with 2 states, 3 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 83 ms.
FORMULA FileSystem-PT-N05I10B15-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FileSystem-PT-N05I10B15-LTLCardinality-00 finished in 83922 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 511/511 places, 592/592 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 503 transition count 592
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 20 place count 491 transition count 580
Iterating global reduction 1 with 12 rules applied. Total rules applied 32 place count 491 transition count 580
Applied a total of 32 rules in 49 ms. Remains 491 /511 variables (removed 20) and now considering 580/592 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17553324744598878919.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1723577904634517140.kers'
[2026-06-16 13:27:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17553324744598878919.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1723577904634517140.kers]
Culling duplicate invariants (modulo rational): removing 15 columns.
Culled 15 columns in 0 ms.
// Phase 1: matrix 580 rows 476 cols 1594 entries
Finished phase 1 with 459 SingleSign rule and 1 generalized
[2026-06-16 13:27:49] [INFO ] Computed 31 invariants in 6 ms
Computed 31 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-1723577904634517140.kers
Total runtime 7 ms.
[2026-06-16 13:27:50] [INFO ] Implicit Places using invariants in 495 ms returned []
[2026-06-16 13:27:50] [INFO ] Invariant cache hit.
[2026-06-16 13:27:50] [INFO ] State equation strengthened by 136 read => feed constraints.
[2026-06-16 13:27:54] [INFO ] Implicit Places using invariants and state equation in 4163 ms returned []
Implicit Place search using SMT with State Equation took 4662 ms to find 0 implicit places.
Running 570 sub problems to find dead transitions.
[2026-06-16 13:27:54] [INFO ] Invariant cache hit.
[2026-06-16 13:27:54] [INFO ] State equation strengthened by 136 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/479 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 2 (OVERLAPS) 11/490 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/490 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 570 unsolved
SMT process timed out in 30100ms, After SMT, problems are : Problem set: 0 solved, 570 unsolved
Search for dead transitions found 0 dead transitions in 30104ms
Starting structural reductions in LTL mode, iteration 1 : 491/511 places, 580/592 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34820 ms. Remains : 491/511 places, 580/592 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FileSystem-PT-N05I10B15-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 38 steps with 0 reset in 0 ms.
FORMULA FileSystem-PT-N05I10B15-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FileSystem-PT-N05I10B15-LTLCardinality-06 finished in 34948 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 511/511 places, 592/592 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 502 transition count 592
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 21 place count 490 transition count 580
Iterating global reduction 1 with 12 rules applied. Total rules applied 33 place count 490 transition count 580
Applied a total of 33 rules in 47 ms. Remains 490 /511 variables (removed 21) and now considering 580/592 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11351230141688195272.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5631305528264498709.kers'
[2026-06-16 13:28:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11351230141688195272.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5631305528264498709.kers]
Culling duplicate invariants (modulo rational): removing 15 columns.
Culled 15 columns in 0 ms.
// Phase 1: matrix 580 rows 475 cols 1593 entries
Finished phase 1 with 458 SingleSign rule and 1 generalized
[2026-06-16 13:28:24] [INFO ] Computed 31 invariants in 5 ms
Computed 31 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-5631305528264498709.kers
Total runtime 7 ms.
[2026-06-16 13:28:24] [INFO ] Implicit Places using invariants in 342 ms returned []
[2026-06-16 13:28:24] [INFO ] Invariant cache hit.
[2026-06-16 13:28:25] [INFO ] State equation strengthened by 136 read => feed constraints.
[2026-06-16 13:28:28] [INFO ] Implicit Places using invariants and state equation in 3769 ms returned []
Implicit Place search using SMT with State Equation took 4113 ms to find 0 implicit places.
Running 570 sub problems to find dead transitions.
[2026-06-16 13:28:28] [INFO ] Invariant cache hit.
[2026-06-16 13:28:28] [INFO ] State equation strengthened by 136 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/479 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 2 (OVERLAPS) 11/490 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/490 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 570 unsolved
SMT process timed out in 30083ms, After SMT, problems are : Problem set: 0 solved, 570 unsolved
Search for dead transitions found 0 dead transitions in 30085ms
Starting structural reductions in LTL mode, iteration 1 : 490/511 places, 580/592 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34247 ms. Remains : 490/511 places, 580/592 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FileSystem-PT-N05I10B15-LTLCardinality-14
Product exploration explored 100000 steps with 33333 reset in 329 ms.
Product exploration explored 100000 steps with 33333 reset in 342 ms.
Computed a total of 70 stabilizing places and 175 stable transitions
Computed a total of 70 stabilizing places and 175 stable transitions
Detected a total of 70/490 stabilizing places and 175/580 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 3 factoid took 13 ms. Proved property starting from automaton with 3 states, 3 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 27 ms.
FORMULA FileSystem-PT-N05I10B15-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FileSystem-PT-N05I10B15-LTLCardinality-14 finished in 35090 ms.
All properties solved by simple procedures.
Total runtime 237205 ms.

BK_STOP 1781616539996

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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 LTLCardinality -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="FileSystem-PT-N05I10B15"
export BK_EXAMINATION="LTLCardinality"
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 FileSystem-PT-N05I10B15, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r338-smll-178021499300467"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FileSystem-PT-N05I10B15.tgz
mv FileSystem-PT-N05I10B15 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;