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.r311-tall-171662335900108.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 greatspnxred
Input is QuasiCertifProtocol-PT-32, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-171662335900108
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.0M
-rw-r--r-- 1 mcc users 80K Apr 13 04:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 499K Apr 13 04:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 24K Apr 13 03:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 148K Apr 13 03:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 49K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 216K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 387K Apr 13 04:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.3M Apr 13 04:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 40K Apr 13 04:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 236K Apr 13 04:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.9K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.5K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 942K 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 QuasiCertifProtocol-PT-32-LTLFireability-00
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-01
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-02
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-03
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-04
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-05
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-06
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-07
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-08
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-09
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-10
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-11
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-12
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-13
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-14
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716664211041

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-32
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 19:10:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-25 19:10:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 19:10:12] [INFO ] Load time of PNML (sax parser for PT used): 168 ms
[2024-05-25 19:10:12] [INFO ] Transformed 3806 places.
[2024-05-25 19:10:12] [INFO ] Transformed 506 transitions.
[2024-05-25 19:10:12] [INFO ] Parsed PT model containing 3806 places and 506 transitions and 8173 arcs in 282 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 2457 out of 3806 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 3736 transition count 506
Applied a total of 70 rules in 172 ms. Remains 3736 /3806 variables (removed 70) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2024-05-25 19:10:13] [INFO ] Computed 3232 invariants in 127 ms
[2024-05-25 19:10:16] [INFO ] Implicit Places using invariants in 3385 ms returned []
[2024-05-25 19:10:16] [INFO ] Invariant cache hit.
[2024-05-25 19:10:21] [INFO ] Implicit Places using invariants and state equation in 5533 ms returned []
Implicit Place search using SMT with State Equation took 8946 ms to find 0 implicit places.
Running 472 sub problems to find dead transitions.
[2024-05-25 19:10:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3735 variables, 3232/3232 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3735/4242 variables, and 3232 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30041 ms.
Refiners :[Generalized P Invariants (flows): 3232/3232 constraints, State Equation: 0/3736 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 472 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3735 variables, 3232/3232 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3735/4242 variables, and 3232 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 3232/3232 constraints, State Equation: 0/3736 constraints, PredecessorRefiner: 0/472 constraints, Known Traps: 0/0 constraints]
After SMT, in 61074ms problems are : Problem set: 0 solved, 472 unsolved
Search for dead transitions found 0 dead transitions in 61096ms
Starting structural reductions in LTL mode, iteration 1 : 3736/3806 places, 506/506 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70243 ms. Remains : 3736/3806 places, 506/506 transitions.
Support contains 2457 out of 3736 places after structural reductions.
[2024-05-25 19:11:23] [INFO ] Flatten gal took : 259 ms
[2024-05-25 19:11:23] [INFO ] Flatten gal took : 146 ms
[2024-05-25 19:11:23] [INFO ] Input system was already deterministic with 506 transitions.
Support contains 2456 out of 3736 places (down from 2457) after GAL structural reductions.
RANDOM walk for 40000 steps (1072 resets) in 4143 ms. (9 steps per ms) remains 16/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 143 ms. (27 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 200 ms. (19 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 111 ms. (35 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 16/16 properties
[2024-05-25 19:11:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2454 variables, 2112/2112 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2454 variables, 0/2112 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 97/2551 variables, 96/2208 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2551 variables, 0/2208 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem AtomicPropp15 is UNSAT
At refinement iteration 4 (OVERLAPS) 474/3025 variables, 2551/4759 constraints. Problems are: Problem set: 1 solved, 15 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3025/4242 variables, and 4759 constraints, problems are : Problem set: 1 solved, 15 unsolved in 5018 ms.
Refiners :[Generalized P Invariants (flows): 2208/3232 constraints, State Equation: 2551/3736 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2451 variables, 2112/2112 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2451 variables, 0/2112 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 98/2549 variables, 96/2208 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2549 variables, 0/2208 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 473/3022 variables, 2549/4757 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3022 variables, 6/4763 constraints. Problems are: Problem set: 1 solved, 15 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3022/4242 variables, and 4763 constraints, problems are : Problem set: 1 solved, 15 unsolved in 5020 ms.
Refiners :[Generalized P Invariants (flows): 2208/3232 constraints, State Equation: 2549/3736 constraints, PredecessorRefiner: 6/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 10273ms problems are : Problem set: 1 solved, 15 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2451 out of 3736 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 3702 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.21 ms
Discarding 34 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Applied a total of 1 rules in 173 ms. Remains 3702 /3736 variables (removed 34) and now considering 504/506 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 174 ms. Remains : 3702/3736 places, 504/506 transitions.
RANDOM walk for 40000 steps (1068 resets) in 1000 ms. (39 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 160 ms. (24 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 166 ms. (23 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 458197 steps, run timeout after 3001 ms. (steps per millisecond=152 ) properties seen :0 out of 15
Probabilistic random walk after 458197 steps, saw 57776 distinct states, run finished after 3006 ms. (steps per millisecond=152 ) properties seen :0
// Phase 1: matrix 504 rows 3702 cols
[2024-05-25 19:11:39] [INFO ] Computed 3200 invariants in 59 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2451 variables, 2112/2112 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2451 variables, 0/2112 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 65/2516 variables, 64/2176 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2516 variables, 0/2176 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 472/2988 variables, 2516/4692 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2988 variables, 0/4692 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp18 is UNSAT
At refinement iteration 6 (OVERLAPS) 1218/4206 variables, 1186/5878 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4206 variables, 1024/6902 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4206 variables, 0/6902 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 0/4206 variables, 0/6902 constraints. Problems are: Problem set: 1 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4206/4206 variables, and 6902 constraints, problems are : Problem set: 1 solved, 14 unsolved in 14857 ms.
Refiners :[Generalized P Invariants (flows): 3200/3200 constraints, State Equation: 3702/3702 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2450 variables, 2112/2112 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2450 variables, 0/2112 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 65/2515 variables, 64/2176 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2515 variables, 0/2176 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 472/2987 variables, 2515/4691 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2987 variables, 8/4699 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2987 variables, 0/4699 constraints. Problems are: Problem set: 1 solved, 14 unsolved
SMT process timed out in 60166ms, After SMT, problems are : Problem set: 1 solved, 14 unsolved
Fused 14 Parikh solutions to 5 different solutions.
Parikh walk visited 10 properties in 6580 ms.
Support contains 2279 out of 3702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3702/3702 places, 504/504 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 3702 transition count 498
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 8 place count 3700 transition count 498
Free-agglomeration rule (complex) applied 33 times.
Iterating global reduction 2 with 33 rules applied. Total rules applied 41 place count 3700 transition count 465
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 74 place count 3667 transition count 465
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 75 place count 3666 transition count 464
Applied a total of 75 rules in 527 ms. Remains 3666 /3702 variables (removed 36) and now considering 464/504 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 544 ms. Remains : 3666/3702 places, 464/504 transitions.
RANDOM walk for 40000 steps (1009 resets) in 897 ms. (44 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (24 resets) in 252 ms. (158 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (25 resets) in 1393 ms. (28 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (24 resets) in 1198 ms. (33 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (25 resets) in 121 ms. (327 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 589196 steps, run timeout after 3001 ms. (steps per millisecond=196 ) properties seen :0 out of 4
Probabilistic random walk after 589196 steps, saw 76408 distinct states, run finished after 3001 ms. (steps per millisecond=196 ) properties seen :0
// Phase 1: matrix 464 rows 3666 cols
[2024-05-25 19:12:50] [INFO ] Computed 3202 invariants in 20 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2279 variables, 2112/2112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2279 variables, 0/2112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 364/2643 variables, 2279/4391 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2643 variables, 0/4391 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 1352/3995 variables, 1253/5644 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3995 variables, 1024/6668 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3995 variables, 0/6668 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 134/4129 variables, 133/6801 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4129 variables, 65/6866 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4129 variables, 0/6866 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1/4130 variables, 1/6867 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4130 variables, 1/6868 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4130 variables, 0/6868 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/4130 variables, 0/6868 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4130/4130 variables, and 6868 constraints, problems are : Problem set: 0 solved, 4 unsolved in 6955 ms.
Refiners :[Generalized P Invariants (flows): 3202/3202 constraints, State Equation: 3666/3666 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/2279 variables, 2112/2112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2279 variables, 0/2112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 364/2643 variables, 2279/4391 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2643 variables, 2/4393 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2643 variables, 0/4393 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1352/3995 variables, 1253/5646 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3995 variables, 1024/6670 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3995 variables, 2/6672 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3995/4130 variables, and 6672 constraints, problems are : Problem set: 0 solved, 4 unsolved in 75022 ms.
Refiners :[Generalized P Invariants (flows): 3136/3202 constraints, State Equation: 3532/3666 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 82144ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2279 out of 3666 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3666/3666 places, 464/464 transitions.
Applied a total of 0 rules in 68 ms. Remains 3666 /3666 variables (removed 0) and now considering 464/464 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 3666/3666 places, 464/464 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3666/3666 places, 464/464 transitions.
Applied a total of 0 rules in 58 ms. Remains 3666 /3666 variables (removed 0) and now considering 464/464 (removed 0) transitions.
[2024-05-25 19:14:13] [INFO ] Invariant cache hit.
[2024-05-25 19:14:16] [INFO ] Implicit Places using invariants in 3195 ms returned [186, 212]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 3202 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 3664/3666 places, 464/464 transitions.
Applied a total of 0 rules in 58 ms. Remains 3664 /3664 variables (removed 0) and now considering 464/464 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3318 ms. Remains : 3664/3666 places, 464/464 transitions.
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3736 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3736 transition count 506
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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)&&F(G((p1||F(p2)))))))'
Support contains 68 out of 3736 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 3702 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.29 ms
Discarding 34 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 3700 transition count 502
Applied a total of 3 rules in 505 ms. Remains 3700 /3736 variables (removed 36) and now considering 502/506 (removed 4) transitions.
// Phase 1: matrix 502 rows 3700 cols
[2024-05-25 19:14:17] [INFO ] Computed 3200 invariants in 33 ms
[2024-05-25 19:14:24] [INFO ] Implicit Places using invariants in 7432 ms returned []
[2024-05-25 19:14:24] [INFO ] Invariant cache hit.
[2024-05-25 19:14:36] [INFO ] Implicit Places using invariants and state equation in 12139 ms returned [2279, 2280, 2281, 2282, 2283, 2284, 2285, 2286, 2291, 2292, 2295, 2296, 2297, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2310, 2319, 2320, 2321, 2322, 2323, 2324, 2325, 3343, 3344, 3345, 3346, 3347, 3348, 3349, 3350, 3673, 3676, 3677, 3678, 3679, 3680, 3681, 3682, 3683, 3684, 3685, 3686, 3687, 3688, 3689, 3690, 3691, 3692, 3693, 3694, 3695, 3696, 3697, 3698, 3699]
Discarding 66 places :
Implicit Place search using SMT with State Equation took 19591 ms to find 66 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3634/3736 places, 502/506 transitions.
Applied a total of 0 rules in 251 ms. Remains 3634 /3634 variables (removed 0) and now considering 502/502 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 20352 ms. Remains : 3634/3736 places, 502/506 transitions.
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-00
Product exploration explored 100000 steps with 2461 reset in 660 ms.
Product exploration explored 100000 steps with 2463 reset in 612 ms.
Computed a total of 3634 stabilizing places and 502 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3634 transition count 502
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (F (G p0)), (F (G p1)), (F (G p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 23 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-00 finished in 22594 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&&F(p1))) U X((F(p2) U (p3 U p1)))))'
Support contains 1222 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 99 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2024-05-25 19:14:39] [INFO ] Computed 3232 invariants in 39 ms
[2024-05-25 19:14:45] [INFO ] Implicit Places using invariants in 5784 ms returned []
[2024-05-25 19:14:45] [INFO ] Invariant cache hit.
[2024-05-25 19:14:55] [INFO ] Implicit Places using invariants and state equation in 9741 ms returned [2281, 2282, 2283, 2284, 2285, 2286, 2287, 2288, 2293, 2294, 2297, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2310, 2311, 2312, 2321, 2322, 2323, 2324, 2325, 2326, 2327]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 15532 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3736 places, 506/506 transitions.
Applied a total of 0 rules in 97 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 15729 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 262 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p1), (NOT p1), (OR (NOT p1) (AND p0 (NOT p2)))]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-01
Stuttering criterion allowed to conclude after 38 steps with 0 reset in 2 ms.
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-01 finished in 16044 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' '!((p0 U G((!p1&&X(!p1)))))'
Support contains 35 out of 3736 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 3702 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.15 ms
Discarding 34 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
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 0 with 2 rules applied. Total rules applied 3 place count 3700 transition count 502
Applied a total of 3 rules in 459 ms. Remains 3700 /3736 variables (removed 36) and now considering 502/506 (removed 4) transitions.
// Phase 1: matrix 502 rows 3700 cols
[2024-05-25 19:14:55] [INFO ] Computed 3200 invariants in 44 ms
[2024-05-25 19:15:03] [INFO ] Implicit Places using invariants in 7357 ms returned []
[2024-05-25 19:15:03] [INFO ] Invariant cache hit.
[2024-05-25 19:15:17] [INFO ] Implicit Places using invariants and state equation in 13888 ms returned [2279, 2280, 2281, 2282, 2283, 2284, 2285, 2286, 2291, 2292, 2295, 2296, 2297, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2310, 2319, 2320, 2321, 2322, 2323, 2324, 2325, 3343, 3344, 3345, 3346, 3347, 3348, 3349, 3350, 3673, 3676, 3677, 3678, 3679, 3680, 3681, 3682, 3683, 3684, 3685, 3686, 3687, 3688, 3689, 3690, 3691, 3692, 3693, 3694, 3695, 3696, 3697, 3698, 3699]
Discarding 66 places :
Implicit Place search using SMT with State Equation took 21249 ms to find 66 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3634/3736 places, 502/506 transitions.
Applied a total of 0 rules in 203 ms. Remains 3634 /3634 variables (removed 0) and now considering 502/502 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 21913 ms. Remains : 3634/3736 places, 502/506 transitions.
Stuttering acceptance computed with spot in 139 ms :[p1, true, p1, p1]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-02
Product exploration explored 100000 steps with 2461 reset in 783 ms.
Product exploration explored 100000 steps with 2458 reset in 757 ms.
Computed a total of 3634 stabilizing places and 502 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3634 transition count 502
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 234 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[true, p1]
RANDOM walk for 40000 steps (984 resets) in 324 ms. (123 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (23 resets) in 539 ms. (74 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1555781 steps, run timeout after 3001 ms. (steps per millisecond=518 ) properties seen :0 out of 1
Probabilistic random walk after 1555781 steps, saw 186355 distinct states, run finished after 3001 ms. (steps per millisecond=518 ) properties seen :0
// Phase 1: matrix 502 rows 3634 cols
[2024-05-25 19:15:23] [INFO ] Computed 3136 invariants in 695 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 297/331 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2574/2905 variables, 2376/2410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2905 variables, 2080/4490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2905 variables, 0/4490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1225/4130 variables, 1221/5711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4130 variables, 1056/6767 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4130 variables, 0/6767 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/4136 variables, 3/6770 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4136 variables, 0/6770 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/4136 variables, 0/6770 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4136/4136 variables, and 6770 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1586 ms.
Refiners :[Generalized P Invariants (flows): 3136/3136 constraints, State Equation: 3634/3634 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/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 297/331 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2574/2905 variables, 2376/2410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2905 variables, 2080/4490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2905 variables, 1/4491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2905 variables, 0/4491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1225/4130 variables, 1221/5712 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4130 variables, 1056/6768 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4130 variables, 0/6768 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/4136 variables, 3/6771 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4136 variables, 0/6771 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/4136 variables, 0/6771 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4136/4136 variables, and 6771 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2885 ms.
Refiners :[Generalized P Invariants (flows): 3136/3136 constraints, State Equation: 3634/3634 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 5220ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 71 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=23 )
Parikh walk visited 1 properties in 10 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p1)]
Property proved to be false thanks to negative knowledge :(F p1)
Knowledge based reduction with 15 factoid took 287 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-02 finished in 33334 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(X(X((X(G(p0))||(G(p1) U !p2))))))'
Support contains 3 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 234 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2024-05-25 19:15:29] [INFO ] Computed 3232 invariants in 37 ms
[2024-05-25 19:15:36] [INFO ] Implicit Places using invariants in 6963 ms returned []
[2024-05-25 19:15:36] [INFO ] Invariant cache hit.
[2024-05-25 19:15:50] [INFO ] Implicit Places using invariants and state equation in 14255 ms returned [2281, 2282, 2283, 2284, 2285, 2286, 2287, 2288, 2293, 2294, 2297, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2310, 2311, 2312, 2321, 2322, 2323, 2324, 2325, 2326, 2327]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 21221 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3736 places, 506/506 transitions.
Applied a total of 0 rules in 222 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 21677 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 384 ms :[true, (OR (NOT p1) p2), (AND (NOT p0) p2), (NOT p0), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p1), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-03
Entered a terminal (fully accepting) state of product in 12 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-03 finished in 22092 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&&F(p1)))))'
Support contains 101 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 219 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2024-05-25 19:15:51] [INFO ] Invariant cache hit.
[2024-05-25 19:15:57] [INFO ] Implicit Places using invariants in 6463 ms returned []
[2024-05-25 19:15:57] [INFO ] Invariant cache hit.
[2024-05-25 19:16:11] [INFO ] Implicit Places using invariants and state equation in 14119 ms returned [2281, 2282, 2283, 2284, 2285, 2286, 2287, 2288, 2293, 2294, 2297, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2310, 2311, 2312, 2321, 2322, 2323, 2324, 2325, 2326, 2327]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 20589 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3736 places, 506/506 transitions.
Applied a total of 0 rules in 229 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 21037 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-04
Stuttering criterion allowed to conclude after 37 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-04 finished in 21245 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 U p2) U !p0)))))'
Support contains 69 out of 3736 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 3702 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.14 ms
Discarding 34 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
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 0 with 2 rules applied. Total rules applied 3 place count 3700 transition count 502
Applied a total of 3 rules in 491 ms. Remains 3700 /3736 variables (removed 36) and now considering 502/506 (removed 4) transitions.
// Phase 1: matrix 502 rows 3700 cols
[2024-05-25 19:16:12] [INFO ] Computed 3200 invariants in 34 ms
[2024-05-25 19:16:19] [INFO ] Implicit Places using invariants in 7100 ms returned []
[2024-05-25 19:16:19] [INFO ] Invariant cache hit.
[2024-05-25 19:16:30] [INFO ] Implicit Places using invariants and state equation in 10781 ms returned [2279, 2280, 2281, 2282, 2283, 2284, 2285, 2286, 2291, 2292, 2295, 2296, 2297, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2310, 2319, 2320, 2321, 2322, 2323, 2324, 2325, 3343, 3344, 3345, 3346, 3347, 3348, 3349, 3350, 3673, 3676, 3677, 3678, 3679, 3680, 3681, 3682, 3683, 3684, 3685, 3686, 3687, 3688, 3689, 3690, 3691, 3692, 3693, 3694, 3695, 3696, 3697, 3698, 3699]
Discarding 66 places :
Implicit Place search using SMT with State Equation took 17885 ms to find 66 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3634/3736 places, 502/506 transitions.
Applied a total of 0 rules in 234 ms. Remains 3634 /3634 variables (removed 0) and now considering 502/502 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 18611 ms. Remains : 3634/3736 places, 502/506 transitions.
Stuttering acceptance computed with spot in 198 ms :[p0, p0, (AND p0 (NOT p2)), p0]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-06
Product exploration explored 100000 steps with 2464 reset in 393 ms.
Product exploration explored 100000 steps with 2460 reset in 412 ms.
Computed a total of 3634 stabilizing places and 502 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3634 transition count 502
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (OR (AND p0 p2) (AND p0 (NOT p1))))), (X (NOT p0)), (X p1), (X (OR (NOT p0) p2 (NOT p1))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (OR (AND p0 p2) (AND p0 (NOT p1)))))), (X (X (NOT p0))), (X (X p1)), (X (X (OR (NOT p0) p2 (NOT p1)))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 20 factoid took 22 ms. Reduced automaton from 4 states, 13 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-06 finished in 20315 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 1122 out of 3736 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 2582 are kept as prefixes of interest. Removing 1154 places using SCC suffix rule.12 ms
Discarding 1154 places :
Also discarding 33 output transitions
Drop transitions (Output transitions of discarded places.) removed 33 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 2581 transition count 442
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 65 place count 2547 transition count 374
Iterating global reduction 1 with 34 rules applied. Total rules applied 99 place count 2547 transition count 374
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 103 place count 2545 transition count 372
Applied a total of 103 rules in 396 ms. Remains 2545 /3736 variables (removed 1191) and now considering 372/506 (removed 134) transitions.
// Phase 1: matrix 372 rows 2545 cols
[2024-05-25 19:16:32] [INFO ] Computed 2176 invariants in 13 ms
[2024-05-25 19:16:34] [INFO ] Implicit Places using invariants in 2091 ms returned []
[2024-05-25 19:16:34] [INFO ] Invariant cache hit.
[2024-05-25 19:16:38] [INFO ] Implicit Places using invariants and state equation in 3343 ms returned [2188, 2189, 2190, 2191, 2192, 2193, 2194, 2195, 2518, 2521, 2522, 2523, 2524, 2525, 2526, 2527, 2528, 2529, 2530, 2531, 2532, 2533, 2534, 2535, 2536, 2537, 2538, 2539, 2540, 2541, 2542, 2543, 2544]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 5437 ms to find 33 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2512/3736 places, 372/506 transitions.
Applied a total of 0 rules in 97 ms. Remains 2512 /2512 variables (removed 0) and now considering 372/372 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5931 ms. Remains : 2512/3736 places, 372/506 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-07
Stuttering criterion allowed to conclude after 39 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-07 finished in 6027 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||X(p1))))'
Support contains 36 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 297 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2024-05-25 19:16:38] [INFO ] Computed 3232 invariants in 33 ms
[2024-05-25 19:16:45] [INFO ] Implicit Places using invariants in 7062 ms returned []
[2024-05-25 19:16:45] [INFO ] Invariant cache hit.
[2024-05-25 19:16:58] [INFO ] Implicit Places using invariants and state equation in 12225 ms returned [2281, 2282, 2283, 2284, 2285, 2286, 2287, 2288, 2293, 2294, 2297, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2310, 2311, 2312, 2321, 2322, 2323, 2324, 2325, 2326, 2327]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 19309 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3736 places, 506/506 transitions.
Applied a total of 0 rules in 223 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 19831 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-09
Stuttering criterion allowed to conclude after 38 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-09 finished in 19930 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((p0||X(p1)))))'
Support contains 36 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 238 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2024-05-25 19:16:58] [INFO ] Invariant cache hit.
[2024-05-25 19:17:05] [INFO ] Implicit Places using invariants in 6887 ms returned []
[2024-05-25 19:17:05] [INFO ] Invariant cache hit.
[2024-05-25 19:17:20] [INFO ] Implicit Places using invariants and state equation in 14443 ms returned [2281, 2282, 2283, 2284, 2285, 2286, 2287, 2288, 2293, 2294, 2297, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2310, 2311, 2312, 2321, 2322, 2323, 2324, 2325, 2326, 2327]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 21364 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3736 places, 506/506 transitions.
Applied a total of 0 rules in 255 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 21858 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-10
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-10 finished in 21979 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(X(G(p0)))&&F(!p1)))'
Support contains 3 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 239 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2024-05-25 19:17:20] [INFO ] Invariant cache hit.
[2024-05-25 19:17:27] [INFO ] Implicit Places using invariants in 6834 ms returned []
[2024-05-25 19:17:27] [INFO ] Invariant cache hit.
[2024-05-25 19:17:39] [INFO ] Implicit Places using invariants and state equation in 11662 ms returned [2281, 2282, 2283, 2284, 2285, 2286, 2287, 2288, 2293, 2294, 2297, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2310, 2311, 2312, 2321, 2322, 2323, 2324, 2325, 2326, 2327]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 18514 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3736 places, 506/506 transitions.
Applied a total of 0 rules in 217 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 18970 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p0) p1), (NOT p0), p1, (NOT p0), true]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-13
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-13 finished in 19158 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)))'
Support contains 1 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 237 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2024-05-25 19:17:39] [INFO ] Invariant cache hit.
[2024-05-25 19:17:46] [INFO ] Implicit Places using invariants in 6827 ms returned []
[2024-05-25 19:17:46] [INFO ] Invariant cache hit.
[2024-05-25 19:18:00] [INFO ] Implicit Places using invariants and state equation in 14278 ms returned [2281, 2282, 2283, 2284, 2285, 2286, 2287, 2288, 2293, 2294, 2297, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2310, 2311, 2312, 2321, 2322, 2323, 2324, 2325, 2326, 2327]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 21133 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3736 places, 506/506 transitions.
Applied a total of 0 rules in 246 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 21616 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-14
Entered a terminal (fully accepting) state of product in 20 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-14 finished in 21736 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(X((p0 U (p1||G(p0))))))'
Support contains 2 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 226 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2024-05-25 19:18:01] [INFO ] Invariant cache hit.
[2024-05-25 19:18:09] [INFO ] Implicit Places using invariants in 7483 ms returned []
[2024-05-25 19:18:09] [INFO ] Invariant cache hit.
[2024-05-25 19:18:22] [INFO ] Implicit Places using invariants and state equation in 13721 ms returned [2281, 2282, 2283, 2284, 2285, 2286, 2287, 2288, 2293, 2294, 2297, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2310, 2311, 2312, 2321, 2322, 2323, 2324, 2325, 2326, 2327]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 21222 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3736 places, 506/506 transitions.
Applied a total of 0 rules in 215 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 21663 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 146 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-15
Product exploration explored 100000 steps with 33333 reset in 638 ms.
Product exploration explored 100000 steps with 33333 reset in 624 ms.
Computed a total of 3703 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3703 transition count 506
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 25 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-15 finished in 23665 ms.
All properties solved by simple procedures.
Total runtime 492798 ms.
ITS solved all properties within timeout

BK_STOP 1716664705352

--------------------
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="QuasiCertifProtocol-PT-32"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is QuasiCertifProtocol-PT-32, 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 r311-tall-171662335900108"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-32.tgz
mv QuasiCertifProtocol-PT-32 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 ;