Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r512-smll-171654406800068.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool ltsminxred
Input is Parking-PT-208, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r512-smll-171654406800068
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Apr 11 16:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 16:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Apr 11 16:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 49K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Parking-PT-208-LTLFireability-00
FORMULA_NAME Parking-PT-208-LTLFireability-01
FORMULA_NAME Parking-PT-208-LTLFireability-02
FORMULA_NAME Parking-PT-208-LTLFireability-03
FORMULA_NAME Parking-PT-208-LTLFireability-04
FORMULA_NAME Parking-PT-208-LTLFireability-05
FORMULA_NAME Parking-PT-208-LTLFireability-06
FORMULA_NAME Parking-PT-208-LTLFireability-07
FORMULA_NAME Parking-PT-208-LTLFireability-08
FORMULA_NAME Parking-PT-208-LTLFireability-09
FORMULA_NAME Parking-PT-208-LTLFireability-10
FORMULA_NAME Parking-PT-208-LTLFireability-11
FORMULA_NAME Parking-PT-208-LTLFireability-12
FORMULA_NAME Parking-PT-208-LTLFireability-13
FORMULA_NAME Parking-PT-208-LTLFireability-14
FORMULA_NAME Parking-PT-208-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717244984108

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Parking-PT-208
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 12:29:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 12:29:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 12:29:46] [INFO ] Load time of PNML (sax parser for PT used): 160 ms
[2024-06-01 12:29:46] [INFO ] Transformed 137 places.
[2024-06-01 12:29:46] [INFO ] Transformed 201 transitions.
[2024-06-01 12:29:46] [INFO ] Found NUPN structural information;
[2024-06-01 12:29:46] [INFO ] Parsed PT model containing 137 places and 201 transitions and 593 arcs in 335 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 137 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Ensure Unique test removed 84 transitions
Reduce redundant transitions removed 84 transitions.
FORMULA Parking-PT-208-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-208-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-208-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-208-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-208-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-208-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 117/117 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 136 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 136 transition count 116
Applied a total of 2 rules in 42 ms. Remains 136 /137 variables (removed 1) and now considering 116/117 (removed 1) transitions.
// Phase 1: matrix 116 rows 136 cols
[2024-06-01 12:29:46] [INFO ] Computed 34 invariants in 30 ms
[2024-06-01 12:29:47] [INFO ] Implicit Places using invariants in 408 ms returned [28, 36, 44, 52, 64, 94, 102, 110, 118, 130]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 456 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 126/137 places, 116/117 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 121 transition count 111
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 121 transition count 111
Applied a total of 10 rules in 13 ms. Remains 121 /126 variables (removed 5) and now considering 111/116 (removed 5) transitions.
// Phase 1: matrix 111 rows 121 cols
[2024-06-01 12:29:47] [INFO ] Computed 24 invariants in 2 ms
[2024-06-01 12:29:47] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-06-01 12:29:47] [INFO ] Invariant cache hit.
[2024-06-01 12:29:47] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-06-01 12:29:47] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 121/137 places, 111/117 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1024 ms. Remains : 121/137 places, 111/117 transitions.
Support contains 28 out of 121 places after structural reductions.
[2024-06-01 12:29:48] [INFO ] Flatten gal took : 50 ms
[2024-06-01 12:29:48] [INFO ] Flatten gal took : 20 ms
[2024-06-01 12:29:48] [INFO ] Input system was already deterministic with 111 transitions.
Support contains 25 out of 121 places (down from 28) after GAL structural reductions.
RANDOM walk for 40000 steps (1165 resets) in 1994 ms. (20 steps per ms) remains 5/20 properties
BEST_FIRST walk for 40004 steps (106 resets) in 317 ms. (125 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (105 resets) in 278 ms. (143 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (101 resets) in 205 ms. (194 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (99 resets) in 128 ms. (310 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (100 resets) in 99 ms. (400 steps per ms) remains 4/5 properties
[2024-06-01 12:29:49] [INFO ] Invariant cache hit.
[2024-06-01 12:29:49] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 74/83 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 38/121 variables, 18/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 111/232 variables, 121/145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 26/171 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/232 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 232/232 variables, and 171 constraints, problems are : Problem set: 0 solved, 4 unsolved in 398 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, State Equation: 121/121 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 74/83 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 38/121 variables, 18/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 111/232 variables, 121/145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 26/171 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 4/175 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 12:29:49] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 16 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/232 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/232 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/232 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 232/232 variables, and 176 constraints, problems are : Problem set: 0 solved, 4 unsolved in 435 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, State Equation: 121/121 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 874ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 2 properties in 500 ms.
Support contains 4 out of 121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 111/111 transitions.
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 121 transition count 107
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 117 transition count 107
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 117 transition count 103
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 113 transition count 103
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 19 place count 110 transition count 100
Iterating global reduction 2 with 3 rules applied. Total rules applied 22 place count 110 transition count 100
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 34 place count 104 transition count 94
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 36 place count 103 transition count 97
Free-agglomeration rule applied 19 times.
Iterating global reduction 2 with 19 rules applied. Total rules applied 55 place count 103 transition count 78
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 74 place count 84 transition count 78
Applied a total of 74 rules in 56 ms. Remains 84 /121 variables (removed 37) and now considering 78/111 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 84/121 places, 78/111 transitions.
RANDOM walk for 579 steps (0 resets) in 13 ms. (41 steps per ms) remains 0/2 properties
FORMULA Parking-PT-208-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||G(p1)))'
Support contains 3 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 111/111 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 121 transition count 108
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 118 transition count 108
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 118 transition count 105
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 115 transition count 105
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 16 place count 111 transition count 101
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 111 transition count 101
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 30 place count 106 transition count 96
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 34 place count 104 transition count 118
Applied a total of 34 rules in 28 ms. Remains 104 /121 variables (removed 17) and now considering 118/111 (removed -7) transitions.
// Phase 1: matrix 118 rows 104 cols
[2024-06-01 12:29:50] [INFO ] Computed 24 invariants in 2 ms
[2024-06-01 12:29:51] [INFO ] Implicit Places using invariants in 127 ms returned [52, 101]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 129 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 102/121 places, 118/111 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 100 transition count 148
Applied a total of 4 rules in 21 ms. Remains 100 /102 variables (removed 2) and now considering 148/118 (removed -30) transitions.
// Phase 1: matrix 148 rows 100 cols
[2024-06-01 12:29:51] [INFO ] Computed 22 invariants in 2 ms
[2024-06-01 12:29:51] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-06-01 12:29:51] [INFO ] Invariant cache hit.
[2024-06-01 12:29:51] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 12:29:51] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 100/121 places, 148/111 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 515 ms. Remains : 100/121 places, 148/111 transitions.
Stuttering acceptance computed with spot in 321 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Parking-PT-208-LTLFireability-00
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 2 ms.
FORMULA Parking-PT-208-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-LTLFireability-00 finished in 916 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(p0)||F(p1)))))'
Support contains 2 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 111/111 transitions.
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 121 transition count 107
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 117 transition count 107
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 117 transition count 103
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 113 transition count 103
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 19 place count 110 transition count 100
Iterating global reduction 2 with 3 rules applied. Total rules applied 22 place count 110 transition count 100
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 32 place count 105 transition count 95
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 36 place count 103 transition count 117
Applied a total of 36 rules in 25 ms. Remains 103 /121 variables (removed 18) and now considering 117/111 (removed -6) transitions.
// Phase 1: matrix 117 rows 103 cols
[2024-06-01 12:29:51] [INFO ] Computed 24 invariants in 3 ms
[2024-06-01 12:29:51] [INFO ] Implicit Places using invariants in 106 ms returned [50, 100]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 109 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/121 places, 117/111 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 99 transition count 147
Applied a total of 4 rules in 13 ms. Remains 99 /101 variables (removed 2) and now considering 147/117 (removed -30) transitions.
// Phase 1: matrix 147 rows 99 cols
[2024-06-01 12:29:51] [INFO ] Computed 22 invariants in 2 ms
[2024-06-01 12:29:52] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-01 12:29:52] [INFO ] Invariant cache hit.
[2024-06-01 12:29:52] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 12:29:52] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 99/121 places, 147/111 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 474 ms. Remains : 99/121 places, 147/111 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-208-LTLFireability-01
Product exploration explored 100000 steps with 3142 reset in 401 ms.
Product exploration explored 100000 steps with 3123 reset in 366 ms.
Computed a total of 1 stabilizing places and 25 stable transitions
Computed a total of 1 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 214 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (1253 resets) in 248 ms. (160 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (118 resets) in 143 ms. (277 steps per ms) remains 1/1 properties
[2024-06-01 12:29:53] [INFO ] Invariant cache hit.
[2024-06-01 12:29:53] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 94/99 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 147/246 variables, 99/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 72/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/246 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 193 constraints, problems are : Problem set: 0 solved, 1 unsolved in 143 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 99/99 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Int declared 5/246 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 23 ms.
Refiners :[Positive P Invariants (semi-flows): 1/22 constraints, State Equation: 0/99 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 196ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (OR p0 p1))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 16 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Parking-PT-208-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-208-LTLFireability-01 finished in 1993 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(G(p0))||(X(G(p1)) U (p2 U !p0))) U p2))'
Support contains 5 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 111/111 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 119 transition count 109
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 119 transition count 109
Applied a total of 4 rules in 4 ms. Remains 119 /121 variables (removed 2) and now considering 109/111 (removed 2) transitions.
// Phase 1: matrix 109 rows 119 cols
[2024-06-01 12:29:53] [INFO ] Computed 24 invariants in 1 ms
[2024-06-01 12:29:53] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-06-01 12:29:53] [INFO ] Invariant cache hit.
[2024-06-01 12:29:53] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-06-01 12:29:54] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2024-06-01 12:29:54] [INFO ] Invariant cache hit.
[2024-06-01 12:29:54] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-06-01 12:29:54] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 2 ms to minimize.
[2024-06-01 12:29:55] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/228 variables, 119/145 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 26/171 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/228 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 171 constraints, problems are : Problem set: 0 solved, 108 unsolved in 3890 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, State Equation: 119/119 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/228 variables, 119/145 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 26/171 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 108/279 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/228 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 279 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4526 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, State Equation: 119/119 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 2/2 constraints]
After SMT, in 8462ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 8467ms
Starting structural reductions in LTL mode, iteration 1 : 119/121 places, 109/111 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8779 ms. Remains : 119/121 places, 109/111 transitions.
Stuttering acceptance computed with spot in 198 ms :[(NOT p2), (AND (NOT p1) (NOT p0)), true, (NOT p0), (NOT p1)]
Running random walk in product with property : Parking-PT-208-LTLFireability-04
Entered a terminal (fully accepting) state of product in 142 steps with 3 reset in 1 ms.
FORMULA Parking-PT-208-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-LTLFireability-04 finished in 9005 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U G((!p1&&F(p2)))))'
Support contains 4 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 111/111 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 117 transition count 107
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 117 transition count 107
Applied a total of 8 rules in 3 ms. Remains 117 /121 variables (removed 4) and now considering 107/111 (removed 4) transitions.
// Phase 1: matrix 107 rows 117 cols
[2024-06-01 12:30:02] [INFO ] Computed 24 invariants in 1 ms
[2024-06-01 12:30:02] [INFO ] Implicit Places using invariants in 97 ms returned [57, 113]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 111 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 115/121 places, 107/111 transitions.
Applied a total of 0 rules in 2 ms. Remains 115 /115 variables (removed 0) and now considering 107/107 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 116 ms. Remains : 115/121 places, 107/111 transitions.
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p2) p1), (NOT p0), (NOT p2), (AND p1 (NOT p0)), true, (AND p1 p0)]
Running random walk in product with property : Parking-PT-208-LTLFireability-06
Product exploration explored 100000 steps with 24987 reset in 474 ms.
Product exploration explored 100000 steps with 25052 reset in 364 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X p2), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p2)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 16 factoid took 137 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p2) p1), (AND (NOT p1) (NOT p0)), (NOT p2), true, (AND p1 p0)]
RANDOM walk for 20639 steps (605 resets) in 173 ms. (118 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X p2), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p2)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F p1), (F (NOT (OR p2 p1))), (F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT p2)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Property proved to be false thanks to negative knowledge :(F p1)
Knowledge based reduction with 16 factoid took 254 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Parking-PT-208-LTLFireability-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-208-LTLFireability-06 finished in 1850 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((!p0 U (p1||G(!p0))))))'
Support contains 4 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 111/111 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 118 transition count 108
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 118 transition count 108
Applied a total of 6 rules in 2 ms. Remains 118 /121 variables (removed 3) and now considering 108/111 (removed 3) transitions.
// Phase 1: matrix 108 rows 118 cols
[2024-06-01 12:30:04] [INFO ] Computed 24 invariants in 1 ms
[2024-06-01 12:30:04] [INFO ] Implicit Places using invariants in 89 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 90 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 117/121 places, 108/111 transitions.
Applied a total of 0 rules in 1 ms. Remains 117 /117 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 93 ms. Remains : 117/121 places, 108/111 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : Parking-PT-208-LTLFireability-10
Product exploration explored 100000 steps with 50000 reset in 362 ms.
Product exploration explored 100000 steps with 50000 reset in 378 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 18 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Parking-PT-208-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-208-LTLFireability-10 finished in 946 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 3 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 111/111 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 121 transition count 108
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 118 transition count 108
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 118 transition count 105
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 115 transition count 105
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 16 place count 111 transition count 101
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 111 transition count 101
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 30 place count 106 transition count 96
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 34 place count 104 transition count 118
Applied a total of 34 rules in 19 ms. Remains 104 /121 variables (removed 17) and now considering 118/111 (removed -7) transitions.
// Phase 1: matrix 118 rows 104 cols
[2024-06-01 12:30:05] [INFO ] Computed 24 invariants in 1 ms
[2024-06-01 12:30:05] [INFO ] Implicit Places using invariants in 146 ms returned [52, 100]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 148 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 102/121 places, 118/111 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -30
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 100 transition count 148
Applied a total of 4 rules in 10 ms. Remains 100 /102 variables (removed 2) and now considering 148/118 (removed -30) transitions.
// Phase 1: matrix 148 rows 100 cols
[2024-06-01 12:30:05] [INFO ] Computed 22 invariants in 1 ms
[2024-06-01 12:30:05] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-06-01 12:30:05] [INFO ] Invariant cache hit.
[2024-06-01 12:30:06] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 12:30:06] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 100/121 places, 148/111 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 591 ms. Remains : 100/121 places, 148/111 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : Parking-PT-208-LTLFireability-11
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 0 ms.
FORMULA Parking-PT-208-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-LTLFireability-11 finished in 675 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 111/111 transitions.
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 121 transition count 107
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 117 transition count 107
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 117 transition count 103
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 113 transition count 103
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 20 place count 109 transition count 99
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 109 transition count 99
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 36 place count 103 transition count 93
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 40 place count 101 transition count 115
Applied a total of 40 rules in 24 ms. Remains 101 /121 variables (removed 20) and now considering 115/111 (removed -4) transitions.
// Phase 1: matrix 115 rows 101 cols
[2024-06-01 12:30:06] [INFO ] Computed 24 invariants in 1 ms
[2024-06-01 12:30:06] [INFO ] Implicit Places using invariants in 182 ms returned [50, 98]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 186 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 99/121 places, 115/111 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -30
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 97 transition count 145
Applied a total of 4 rules in 24 ms. Remains 97 /99 variables (removed 2) and now considering 145/115 (removed -30) transitions.
// Phase 1: matrix 145 rows 97 cols
[2024-06-01 12:30:06] [INFO ] Computed 22 invariants in 1 ms
[2024-06-01 12:30:06] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-06-01 12:30:06] [INFO ] Invariant cache hit.
[2024-06-01 12:30:06] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-06-01 12:30:06] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 97/121 places, 145/111 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 684 ms. Remains : 97/121 places, 145/111 transitions.
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-208-LTLFireability-12
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 0 ms.
FORMULA Parking-PT-208-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-LTLFireability-12 finished in 913 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 111/111 transitions.
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 121 transition count 107
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 117 transition count 107
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 117 transition count 103
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 113 transition count 103
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 20 place count 109 transition count 99
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 109 transition count 99
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 36 place count 103 transition count 93
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 40 place count 101 transition count 115
Applied a total of 40 rules in 14 ms. Remains 101 /121 variables (removed 20) and now considering 115/111 (removed -4) transitions.
// Phase 1: matrix 115 rows 101 cols
[2024-06-01 12:30:07] [INFO ] Computed 24 invariants in 1 ms
[2024-06-01 12:30:07] [INFO ] Implicit Places using invariants in 103 ms returned [50, 98]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 105 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 99/121 places, 115/111 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 97 transition count 145
Applied a total of 4 rules in 20 ms. Remains 97 /99 variables (removed 2) and now considering 145/115 (removed -30) transitions.
// Phase 1: matrix 145 rows 97 cols
[2024-06-01 12:30:07] [INFO ] Computed 22 invariants in 1 ms
[2024-06-01 12:30:07] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-01 12:30:07] [INFO ] Invariant cache hit.
[2024-06-01 12:30:07] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-06-01 12:30:07] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 97/121 places, 145/111 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 498 ms. Remains : 97/121 places, 145/111 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-208-LTLFireability-13
Product exploration explored 100000 steps with 50000 reset in 633 ms.
Product exploration explored 100000 steps with 50000 reset in 644 ms.
Computed a total of 1 stabilizing places and 25 stable transitions
Computed a total of 1 stabilizing places and 25 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 22 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Parking-PT-208-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-208-LTLFireability-13 finished in 1895 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p1))&&p0)))'
Support contains 3 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 111/111 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 121 transition count 108
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 118 transition count 108
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 118 transition count 105
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 115 transition count 105
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 16 place count 111 transition count 101
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 111 transition count 101
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 30 place count 106 transition count 96
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 34 place count 104 transition count 118
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 104 transition count 118
Applied a total of 35 rules in 27 ms. Remains 104 /121 variables (removed 17) and now considering 118/111 (removed -7) transitions.
// Phase 1: matrix 118 rows 104 cols
[2024-06-01 12:30:09] [INFO ] Computed 24 invariants in 1 ms
[2024-06-01 12:30:09] [INFO ] Implicit Places using invariants in 155 ms returned [53, 101]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 177 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 102/121 places, 118/111 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -30
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 100 transition count 148
Applied a total of 4 rules in 7 ms. Remains 100 /102 variables (removed 2) and now considering 148/118 (removed -30) transitions.
// Phase 1: matrix 148 rows 100 cols
[2024-06-01 12:30:09] [INFO ] Computed 22 invariants in 1 ms
[2024-06-01 12:30:09] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-06-01 12:30:09] [INFO ] Invariant cache hit.
[2024-06-01 12:30:09] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-06-01 12:30:09] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 100/121 places, 148/111 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 572 ms. Remains : 100/121 places, 148/111 transitions.
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : Parking-PT-208-LTLFireability-14
Stuttering criterion allowed to conclude after 62 steps with 1 reset in 0 ms.
FORMULA Parking-PT-208-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-LTLFireability-14 finished in 773 ms.
All properties solved by simple procedures.
Total runtime 23847 ms.
ITS solved all properties within timeout

BK_STOP 1717245009910

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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="Parking-PT-208"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is Parking-PT-208, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r512-smll-171654406800068"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Parking-PT-208.tgz
mv Parking-PT-208 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;