About the Execution of ITS-Tools for Railroad-PT-010
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 105546.00 | 0.00 | 0.00 | FFFTFFFFTTTTTTTT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r170-smll-174889233300083.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is Railroad-PT-010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-smll-174889233300083
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 82K May 29 14:32 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 Railroad-PT-010-LTLCardinality-00
FORMULA_NAME Railroad-PT-010-LTLCardinality-01
FORMULA_NAME Railroad-PT-010-LTLCardinality-02
FORMULA_NAME Railroad-PT-010-LTLCardinality-03
FORMULA_NAME Railroad-PT-010-LTLCardinality-04
FORMULA_NAME Railroad-PT-010-LTLCardinality-05
FORMULA_NAME Railroad-PT-010-LTLCardinality-06
FORMULA_NAME Railroad-PT-010-LTLCardinality-07
FORMULA_NAME Railroad-PT-010-LTLCardinality-08
FORMULA_NAME Railroad-PT-010-LTLCardinality-09
FORMULA_NAME Railroad-PT-010-LTLCardinality-10
FORMULA_NAME Railroad-PT-010-LTLCardinality-11
FORMULA_NAME Railroad-PT-010-LTLCardinality-12
FORMULA_NAME Railroad-PT-010-LTLCardinality-13
FORMULA_NAME Railroad-PT-010-LTLCardinality-14
FORMULA_NAME Railroad-PT-010-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1748958875024
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Railroad-PT-010
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-03 13:54:37] [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]
[2025-06-03 13:54:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 13:54:37] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2025-06-03 13:54:37] [INFO ] Transformed 118 places.
[2025-06-03 13:54:37] [INFO ] Transformed 156 transitions.
[2025-06-03 13:54:37] [INFO ] Found NUPN structural information;
[2025-06-03 13:54:37] [INFO ] Parsed PT model containing 118 places and 156 transitions and 898 arcs in 304 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 10 transitions.
FORMULA Railroad-PT-010-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-010-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-010-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-010-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-010-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-010-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-010-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-010-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-010-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-010-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 146/146 transitions.
Ensure Unique test removed 11 places
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 76 transition count 146
Applied a total of 11 rules in 31 ms. Remains 76 /87 variables (removed 11) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 76 cols
[2025-06-03 13:54:38] [INFO ] Computed 30 invariants in 25 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:54:38] [INFO ] Implicit Places using invariants in 538 ms returned [32, 33, 34, 35, 36, 38, 44, 45, 46, 55, 58, 61, 68, 73]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 599 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/87 places, 146/146 transitions.
Applied a total of 0 rules in 6 ms. Remains 62 /62 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 665 ms. Remains : 62/87 places, 146/146 transitions.
Support contains 19 out of 62 places after structural reductions.
[2025-06-03 13:54:39] [INFO ] Flatten gal took : 85 ms
[2025-06-03 13:54:39] [INFO ] Flatten gal took : 42 ms
[2025-06-03 13:54:39] [INFO ] Input system was already deterministic with 146 transitions.
RANDOM walk for 40000 steps (8 resets) in 1596 ms. (25 steps per ms) remains 1/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 331 ms. (120 steps per ms) remains 1/1 properties
// Phase 1: matrix 146 rows 62 cols
[2025-06-03 13:54:40] [INFO ] Computed 16 invariants in 5 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp6 is UNSAT
After SMT solving in domain Real declared 12/208 variables, and 8 constraints, problems are : Problem set: 1 solved, 0 unsolved in 68 ms.
Refiners :[Domain max(s): 4/62 constraints, Positive P Invariants (semi-flows): 4/13 constraints, Generalized P Invariants (flows): 0/3 constraints, State Equation: 0/62 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 102ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 6 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 146/146 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 61 transition count 142
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 57 transition count 142
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 8 place count 57 transition count 134
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 24 place count 49 transition count 134
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 29 place count 46 transition count 132
Applied a total of 29 rules in 40 ms. Remains 46 /62 variables (removed 16) and now considering 132/146 (removed 14) transitions.
// Phase 1: matrix 132 rows 46 cols
[2025-06-03 13:54:40] [INFO ] Computed 14 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:54:40] [INFO ] Implicit Places using invariants in 160 ms returned []
[2025-06-03 13:54:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:54:40] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 449 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 13:54:40] [INFO ] Redundant transitions in 5 ms returned []
Running 122 sub problems to find dead transitions.
[2025-06-03 13:54:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 11/46 variables, 11/47 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 11/58 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:54:42] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:54:42] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/46 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 132/178 variables, 46/108 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/178 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/178 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/178 variables, and 108 constraints, problems are : Problem set: 0 solved, 122 unsolved in 6633 ms.
Refiners :[Domain max(s): 46/46 constraints, Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 46/46 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 11/46 variables, 11/49 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 11/60 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/46 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 132/178 variables, 46/108 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/178 variables, 122/230 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/178 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 11 (OVERLAPS) 0/178 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/178 variables, and 230 constraints, problems are : Problem set: 0 solved, 122 unsolved in 9245 ms.
Refiners :[Domain max(s): 46/46 constraints, Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 46/46 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16067ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 16071ms
Starting structural reductions in SI_LTL mode, iteration 1 : 46/62 places, 132/146 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16575 ms. Remains : 46/62 places, 132/146 transitions.
Stuttering acceptance computed with spot in 309 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Railroad-PT-010-LTLCardinality-00
Product exploration explored 100000 steps with 0 reset in 717 ms.
Stack based approach found an accepted trace after 413 steps with 20 reset with depth 12 and stack size 12 in 6 ms.
FORMULA Railroad-PT-010-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-010-LTLCardinality-00 finished in 17705 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 146/146 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 61 transition count 146
Applied a total of 1 rules in 4 ms. Remains 61 /62 variables (removed 1) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 61 cols
[2025-06-03 13:54:58] [INFO ] Computed 15 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:54:58] [INFO ] Implicit Places using invariants in 108 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 111 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/62 places, 146/146 transitions.
Applied a total of 0 rules in 5 ms. Remains 60 /60 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 120 ms. Remains : 60/62 places, 146/146 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Railroad-PT-010-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Railroad-PT-010-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-010-LTLCardinality-01 finished in 227 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((!p0&&F(p1))) U X(X(!p2))))'
Support contains 6 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 146/146 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 61 transition count 146
Applied a total of 1 rules in 3 ms. Remains 61 /62 variables (removed 1) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 61 cols
[2025-06-03 13:54:58] [INFO ] Computed 15 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:54:58] [INFO ] Implicit Places using invariants in 127 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 129 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/62 places, 146/146 transitions.
Applied a total of 0 rules in 4 ms. Remains 60 /60 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 137 ms. Remains : 60/62 places, 146/146 transitions.
Stuttering acceptance computed with spot in 565 ms :[p2, (AND (NOT p1) p2), p2, (OR (AND (NOT p1) p2) (AND p0 p2)), (AND (NOT p1) p2), (AND (NOT p1) p2), p2, (OR (AND (NOT p1) p2) (AND p0 p2)), (OR (AND (NOT p1) p2) (AND p0 p2)), (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : Railroad-PT-010-LTLCardinality-02
Product exploration explored 100000 steps with 26 reset in 311 ms.
Stack based approach found an accepted trace after 175 steps with 0 reset with depth 176 and stack size 176 in 1 ms.
FORMULA Railroad-PT-010-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-010-LTLCardinality-02 finished in 1041 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 146/146 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 61 transition count 146
Applied a total of 1 rules in 3 ms. Remains 61 /62 variables (removed 1) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 61 cols
[2025-06-03 13:54:59] [INFO ] Computed 15 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:54:59] [INFO ] Implicit Places using invariants in 168 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 170 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/62 places, 146/146 transitions.
Applied a total of 0 rules in 3 ms. Remains 60 /60 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 177 ms. Remains : 60/62 places, 146/146 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Railroad-PT-010-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Railroad-PT-010-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-010-LTLCardinality-07 finished in 317 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(((p0 U p1)&&F(p2)))||X(X(F(p3))))))'
Support contains 7 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 146/146 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 61 transition count 145
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 60 transition count 145
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 2 place count 60 transition count 135
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 22 place count 50 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 49 transition count 134
Applied a total of 24 rules in 20 ms. Remains 49 /62 variables (removed 13) and now considering 134/146 (removed 12) transitions.
// Phase 1: matrix 134 rows 49 cols
[2025-06-03 13:54:59] [INFO ] Computed 15 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:54:59] [INFO ] Implicit Places using invariants in 128 ms returned [41]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 129 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/62 places, 134/146 transitions.
Applied a total of 0 rules in 11 ms. Remains 48 /48 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 161 ms. Remains : 48/62 places, 134/146 transitions.
Stuttering acceptance computed with spot in 395 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : Railroad-PT-010-LTLCardinality-09
Product exploration explored 100000 steps with 24957 reset in 263 ms.
Product exploration explored 100000 steps with 25170 reset in 324 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p2 p3), (X (NOT p2)), (X (NOT p1)), (X (X p2)), (X (X (NOT (OR (AND p1 (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3)))))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p3)))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))), (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))))), (X p0), (X (NOT p0)), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (X p3)), (X (X (NOT p3))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 9 factoid took 594 ms. Reduced automaton from 7 states, 16 edges and 4 AP (stutter insensitive) to 4 states, 10 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 241 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 423 ms. (94 steps per ms) remains 2/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 482 ms. (82 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 240 ms. (165 steps per ms) remains 2/2 properties
// Phase 1: matrix 134 rows 48 cols
[2025-06-03 13:55:02] [INFO ] Computed 14 invariants in 3 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 10/17 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 23/40 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 8/48 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/48 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/48 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 134/182 variables, 48/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/182 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/182 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 110 constraints, problems are : Problem set: 0 solved, 2 unsolved in 121 ms.
Refiners :[Domain max(s): 48/48 constraints, Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 48/48 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf4 is UNSAT
Problem apf7 is UNSAT
After SMT solving in domain Int declared 7/182 variables, and 7 constraints, problems are : Problem set: 2 solved, 0 unsolved in 64 ms.
Refiners :[Domain max(s): 7/48 constraints, Positive P Invariants (semi-flows): 0/12 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/48 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 205ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0 p2 p3), (X (NOT p2)), (X (NOT p1)), (X (X p2)), (X (X (NOT (OR (AND p1 (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3)))))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (G (AND (OR (NOT p1) p2 p3) (OR p2 p3 (NOT p0)))), (G (OR p2 p3))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))), (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))))), (X p0), (X (NOT p0)), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (X p3)), (X (X (NOT p3))), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR p1 p3 p0))), (F p1), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p1 p3 (NOT p0)))), (F (NOT p3))]
Knowledge based reduction with 11 factoid took 730 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Support contains 4 out of 48 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 134/134 transitions.
Applied a total of 0 rules in 18 ms. Remains 48 /48 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2025-06-03 13:55:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:55:03] [INFO ] Implicit Places using invariants in 132 ms returned []
[2025-06-03 13:55:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:55:03] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 13:55:03] [INFO ] Redundant transitions in 7 ms returned []
Running 124 sub problems to find dead transitions.
[2025-06-03 13:55:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (OVERLAPS) 10/48 variables, 10/50 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 10/60 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 124 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:55:05] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:55:05] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:55:05] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:55:05] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 4/66 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 8 (OVERLAPS) 134/182 variables, 48/114 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 10 (OVERLAPS) 0/182 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 114 constraints, problems are : Problem set: 0 solved, 124 unsolved in 6910 ms.
Refiners :[Domain max(s): 48/48 constraints, Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 48/48 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 124 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (OVERLAPS) 10/48 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 10/63 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 9 (OVERLAPS) 134/182 variables, 48/114 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 124/238 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 12 (OVERLAPS) 0/182 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 238 constraints, problems are : Problem set: 0 solved, 124 unsolved in 9239 ms.
Refiners :[Domain max(s): 48/48 constraints, Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 48/48 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16293ms problems are : Problem set: 0 solved, 124 unsolved
Search for dead transitions found 0 dead transitions in 16297ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16698 ms. Remains : 48/48 places, 134/134 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p3), (X p3), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X p1))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3)))]
Knowledge based reduction with 6 factoid took 163 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1))]
RANDOM walk for 81 steps (0 resets) in 6 ms. (11 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) p3), (X p3), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X p1))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (F (NOT p3)), (F p1), (F (NOT (OR p3 p1)))]
Knowledge based reduction with 6 factoid took 240 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1))]
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1))]
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1))]
Product exploration explored 100000 steps with 3651 reset in 253 ms.
Product exploration explored 100000 steps with 3668 reset in 346 ms.
Built C files in :
/tmp/ltsmin2678955580453234266
[2025-06-03 13:55:21] [INFO ] Computing symmetric may disable matrix : 134 transitions.
[2025-06-03 13:55:21] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 13:55:21] [INFO ] Computing symmetric may enable matrix : 134 transitions.
[2025-06-03 13:55:21] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 13:55:21] [INFO ] Computing Do-Not-Accords matrix : 134 transitions.
[2025-06-03 13:55:21] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 13:55:21] [INFO ] Built C files in 79ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2678955580453234266
Running compilation step : cd /tmp/ltsmin2678955580453234266;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 867 ms.
Running link step : cd /tmp/ltsmin2678955580453234266;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 69 ms.
Running LTSmin : cd /tmp/ltsmin2678955580453234266;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4513126932455779983.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 134/134 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 48 transition count 132
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 46 transition count 132
Applied a total of 4 rules in 9 ms. Remains 46 /48 variables (removed 2) and now considering 132/134 (removed 2) transitions.
// Phase 1: matrix 132 rows 46 cols
[2025-06-03 13:55:36] [INFO ] Computed 14 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:55:36] [INFO ] Implicit Places using invariants in 86 ms returned []
[2025-06-03 13:55:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:55:36] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 13:55:36] [INFO ] Redundant transitions in 3 ms returned []
Running 122 sub problems to find dead transitions.
[2025-06-03 13:55:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 10/46 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 10/58 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:55:38] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:55:38] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:55:38] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:55:38] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 4/64 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/46 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 132/178 variables, 46/110 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/178 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/178 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/178 variables, and 110 constraints, problems are : Problem set: 0 solved, 122 unsolved in 6919 ms.
Refiners :[Domain max(s): 46/46 constraints, Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 46/46 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 10/46 variables, 10/51 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/46 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/46 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (OVERLAPS) 132/178 variables, 46/110 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/178 variables, 122/232 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/178 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 12 (OVERLAPS) 0/178 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/178 variables, and 232 constraints, problems are : Problem set: 0 solved, 122 unsolved in 12042 ms.
Refiners :[Domain max(s): 46/46 constraints, Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 46/46 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19018ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 19019ms
Starting structural reductions in SI_LTL mode, iteration 1 : 46/48 places, 132/134 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19264 ms. Remains : 46/48 places, 132/134 transitions.
Built C files in :
/tmp/ltsmin8644054755739572715
[2025-06-03 13:55:55] [INFO ] Computing symmetric may disable matrix : 132 transitions.
[2025-06-03 13:55:55] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 13:55:55] [INFO ] Computing symmetric may enable matrix : 132 transitions.
[2025-06-03 13:55:55] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 13:55:55] [INFO ] Computing Do-Not-Accords matrix : 132 transitions.
[2025-06-03 13:55:55] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 13:55:55] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8644054755739572715
Running compilation step : cd /tmp/ltsmin8644054755739572715;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 618 ms.
Running link step : cd /tmp/ltsmin8644054755739572715;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin8644054755739572715;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11992753240231803520.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-03 13:56:10] [INFO ] Flatten gal took : 16 ms
[2025-06-03 13:56:10] [INFO ] Flatten gal took : 13 ms
[2025-06-03 13:56:10] [INFO ] Time to serialize gal into /tmp/LTL10593873295087693160.gal : 6 ms
[2025-06-03 13:56:10] [INFO ] Time to serialize properties into /tmp/LTL1919890359176437787.prop : 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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10593873295087693160.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6240315673122655561.hoa' '-atoms' '/tmp/LTL1919890359176437787.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL1919890359176437787.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6240315673122655561.hoa
Reverse transition relation is NOT exact ! Due to transitions t128, t129, t130, t131, t132, t133, t134, t135, t136, t144.t137.t140, t2.t17.t29, Intersecti...244
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
781 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,7.84901,156900,1,0,321,432116,298,136,3542,350499,372
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Railroad-PT-010-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Railroad-PT-010-LTLCardinality-09 finished in 79757 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 146/146 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 61 transition count 146
Applied a total of 1 rules in 5 ms. Remains 61 /62 variables (removed 1) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 61 cols
[2025-06-03 13:56:19] [INFO ] Computed 15 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:56:19] [INFO ] Implicit Places using invariants in 176 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 178 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/62 places, 146/146 transitions.
Applied a total of 0 rules in 4 ms. Remains 60 /60 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 188 ms. Remains : 60/62 places, 146/146 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Railroad-PT-010-LTLCardinality-11
Product exploration explored 100000 steps with 50000 reset in 499 ms.
Product exploration explored 100000 steps with 50000 reset in 310 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 14 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Railroad-PT-010-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Railroad-PT-010-LTLCardinality-11 finished in 1119 ms.
All properties solved by simple procedures.
Total runtime 102973 ms.
BK_STOP 1748958980570
--------------------
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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="Railroad-PT-010"
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-5832"
echo " Executing tool itstools"
echo " Input is Railroad-PT-010, 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 r170-smll-174889233300083"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Railroad-PT-010.tgz
mv Railroad-PT-010 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 '
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 ;