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.r520-tall-171662337800092.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 QuasiCertifProtocol-PT-22, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r520-tall-171662337800092
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.9M
-rw-r--r-- 1 mcc users 74K Apr 13 04:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 496K Apr 13 04:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 13 04:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 109K Apr 13 04:04 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 81K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 339K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 141K Apr 13 04:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 906K Apr 13 04:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 20K Apr 13 04:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 123K Apr 13 04:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 7.6K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 22K 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 503K 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-22-LTLFireability-00
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-01
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-02
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-03
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-04
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-05
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-06
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-07
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-08
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-09
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-10
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-11
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-12
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-13
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-14
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717220493200

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-22
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:41:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 05:41:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:41:34] [INFO ] Load time of PNML (sax parser for PT used): 118 ms
[2024-06-01 05:41:34] [INFO ] Transformed 1966 places.
[2024-06-01 05:41:34] [INFO ] Transformed 356 transitions.
[2024-06-01 05:41:34] [INFO ] Parsed PT model containing 1966 places and 356 transitions and 4323 arcs in 223 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 2 formulas.
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 792 out of 1966 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 1916 transition count 356
Applied a total of 50 rules in 149 ms. Remains 1916 /1966 variables (removed 50) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2024-06-01 05:41:35] [INFO ] Computed 1562 invariants in 78 ms
[2024-06-01 05:41:36] [INFO ] Implicit Places using invariants in 1831 ms returned []
[2024-06-01 05:41:36] [INFO ] Invariant cache hit.
[2024-06-01 05:41:39] [INFO ] Implicit Places using invariants and state equation in 2518 ms returned []
Implicit Place search using SMT with State Equation took 4403 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-06-01 05:41:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1915 variables, 1562/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1915 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2271 variables, 1915/3477 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2271/2272 variables, and 3477 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1915/1916 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1915 variables, 1562/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1915 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2271 variables, 1915/3477 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2271 variables, 332/3809 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2271/2272 variables, and 3809 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1915/1916 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
After SMT, in 60614ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60642ms
Starting structural reductions in LTL mode, iteration 1 : 1916/1966 places, 356/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65226 ms. Remains : 1916/1966 places, 356/356 transitions.
Support contains 792 out of 1916 places after structural reductions.
[2024-06-01 05:42:40] [INFO ] Flatten gal took : 155 ms
[2024-06-01 05:42:40] [INFO ] Flatten gal took : 93 ms
[2024-06-01 05:42:40] [INFO ] Input system was already deterministic with 356 transitions.
RANDOM walk for 40000 steps (1481 resets) in 1762 ms. (22 steps per ms) remains 17/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 127 ms. (31 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (9 resets) in 88 ms. (44 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (10 resets) in 302 ms. (13 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (9 resets) in 13 ms. (286 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4000 steps (10 resets) in 23 ms. (166 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (11 resets) in 36 ms. (108 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (9 resets) in 70 ms. (56 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (10 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (10 resets) in 68 ms. (58 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (10 resets) in 13 ms. (285 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (11 resets) in 21 ms. (181 steps per ms) remains 17/17 properties
[2024-06-01 05:42:41] [INFO ] Invariant cache hit.
Problem AtomicPropp3 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/723 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 125/848 variables, 638/638 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/848 variables, 0/638 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 956/1804 variables, 924/1562 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1804 variables, 0/1562 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 355/2159 variables, 1804/3366 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2159 variables, 0/3366 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 113/2272 variables, 112/3478 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2272 variables, 0/3478 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/2272 variables, 0/3478 constraints. Problems are: Problem set: 1 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2272/2272 variables, and 3478 constraints, problems are : Problem set: 1 solved, 16 unsolved in 4765 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1916/1916 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/722 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 125/847 variables, 638/638 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/847 variables, 0/638 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 956/1803 variables, 924/1562 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1803 variables, 0/1562 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 355/2158 variables, 1803/3365 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2158 variables, 9/3374 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2158 variables, 0/3374 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 114/2272 variables, 113/3487 constraints. Problems are: Problem set: 1 solved, 16 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2272/2272 variables, and 3494 constraints, problems are : Problem set: 1 solved, 16 unsolved in 5043 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1916/1916 constraints, PredecessorRefiner: 16/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 9912ms problems are : Problem set: 1 solved, 16 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 722 out of 1916 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1433 are kept as prefixes of interest. Removing 483 places using SCC suffix rule.8 ms
Discarding 483 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 1433 transition count 334
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 43 place count 1413 transition count 314
Iterating global reduction 1 with 20 rules applied. Total rules applied 63 place count 1413 transition count 314
Applied a total of 63 rules in 130 ms. Remains 1413 /1916 variables (removed 503) and now considering 314/356 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 1413/1916 places, 314/356 transitions.
RANDOM walk for 40000 steps (1484 resets) in 936 ms. (42 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 4002 steps (10 resets) in 117 ms. (33 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (9 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (11 resets) in 25 ms. (153 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (10 resets) in 21 ms. (181 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (9 resets) in 21 ms. (182 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 4004 steps (10 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (11 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (10 resets) in 9 ms. (400 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (9 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (10 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (9 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 500056 steps, run timeout after 3001 ms. (steps per millisecond=166 ) properties seen :0 out of 16
Probabilistic random walk after 500056 steps, saw 70500 distinct states, run finished after 3017 ms. (steps per millisecond=165 ) properties seen :0
// Phase 1: matrix 314 rows 1413 cols
[2024-06-01 05:42:55] [INFO ] Computed 1100 invariants in 35 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/722 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/722 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 100/822 variables, 594/616 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/822 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 498/1320 variables, 484/1100 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1320 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 314/1634 variables, 1320/2420 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1634 variables, 0/2420 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 93/1727 variables, 93/2513 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1727 variables, 0/2513 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 0/1727 variables, 0/2513 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1727/1727 variables, and 2513 constraints, problems are : Problem set: 0 solved, 16 unsolved in 4022 ms.
Refiners :[Generalized P Invariants (flows): 1100/1100 constraints, State Equation: 1413/1413 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/722 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/722 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 100/822 variables, 594/616 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/822 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 498/1320 variables, 484/1100 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1320 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 314/1634 variables, 1320/2420 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1634 variables, 9/2429 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1634 variables, 0/2429 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 93/1727 variables, 93/2522 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1727 variables, 7/2529 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1727 variables, 0/2529 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (OVERLAPS) 0/1727 variables, 0/2529 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1727/1727 variables, and 2529 constraints, problems are : Problem set: 0 solved, 16 unsolved in 13885 ms.
Refiners :[Generalized P Invariants (flows): 1100/1100 constraints, State Equation: 1413/1413 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 18025ms problems are : Problem set: 0 solved, 16 unsolved
Fused 16 Parikh solutions to 15 different solutions.
Finished Parikh walk after 168 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=56 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 16 properties in 464 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 1916 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1916 transition count 356
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' '!((X(!p0) U (X(G(!p0))||(X(!p0)&&(X(p1) U (X(G(p1))||(X(p1)&&G(p2))))))))'
Support contains 577 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 45 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2024-06-01 05:43:14] [INFO ] Computed 1562 invariants in 24 ms
[2024-06-01 05:43:16] [INFO ] Implicit Places using invariants in 1727 ms returned []
[2024-06-01 05:43:16] [INFO ] Invariant cache hit.
[2024-06-01 05:43:18] [INFO ] Implicit Places using invariants and state equation in 2687 ms returned []
Implicit Place search using SMT with State Equation took 4419 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-06-01 05:43:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1915 variables, 1562/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1915 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2271 variables, 1915/3477 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2271/2272 variables, and 3477 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1915/1916 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1915 variables, 1562/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1915 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2271 variables, 1915/3477 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2271 variables, 332/3809 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2271/2272 variables, and 3809 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1915/1916 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
After SMT, in 60486ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60496ms
Finished structural reductions in LTL mode , in 1 iterations and 64963 ms. Remains : 1916/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 633 ms :[true, p0, (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) (NOT p1)), (AND p0 (NOT p2)), (NOT p1), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, p0, (NOT p2)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-00
Product exploration explored 100000 steps with 3706 reset in 1245 ms.
Product exploration explored 100000 steps with 3715 reset in 1183 ms.
Computed a total of 1916 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1916 transition count 356
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 p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p0))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p0) p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 791 ms. Reduced automaton from 12 states, 53 edges and 3 AP (stutter sensitive) to 17 states, 82 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 693 ms :[true, (AND p0 (NOT p2)), (AND (NOT p2) p0 (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2)), p0, (AND p0 (NOT p1)), (NOT p1), (NOT p1), (NOT p1), p0, p0, p0, p0, p0, p0, (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (1485 resets) in 1485 ms. (26 steps per ms) remains 13/18 properties
BEST_FIRST walk for 40003 steps (84 resets) in 1586 ms. (25 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (67 resets) in 2221 ms. (18 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (116 resets) in 904 ms. (44 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (120 resets) in 900 ms. (44 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (45 resets) in 187 ms. (212 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (120 resets) in 831 ms. (48 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (46 resets) in 928 ms. (43 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (67 resets) in 747 ms. (53 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (51 resets) in 908 ms. (44 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (118 resets) in 723 ms. (55 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (47 resets) in 775 ms. (51 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (71 resets) in 213 ms. (186 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (50 resets) in 703 ms. (56 steps per ms) remains 13/13 properties
[2024-06-01 05:44:28] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/577 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 32/609 variables, 528/528 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/609 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 497/1106 variables, 484/1012 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1106 variables, 0/1012 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem apf11 is UNSAT
Problem apf13 is UNSAT
Problem apf14 is UNSAT
At refinement iteration 5 (OVERLAPS) 254/1360 variables, 1106/2118 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1360 variables, 0/2118 constraints. Problems are: Problem set: 3 solved, 10 unsolved
Problem apf3 is UNSAT
Problem apf5 is UNSAT
Problem apf8 is UNSAT
At refinement iteration 7 (OVERLAPS) 785/2145 variables, 691/2809 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2145 variables, 484/3293 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2145 variables, 0/3293 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 23/2168 variables, 22/3315 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2168 variables, 23/3338 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2168 variables, 0/3338 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 98/2266 variables, 93/3431 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2266 variables, 44/3475 constraints. Problems are: Problem set: 6 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2266/2272 variables, and 3475 constraints, problems are : Problem set: 6 solved, 7 unsolved in 5014 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1913/1916 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/577 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 32/609 variables, 528/528 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/609 variables, 0/528 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 497/1106 variables, 484/1012 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1106 variables, 0/1012 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 254/1360 variables, 1106/2118 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1360 variables, 0/2118 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 785/2145 variables, 691/2809 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2145 variables, 484/3293 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2145 variables, 7/3300 constraints. Problems are: Problem set: 6 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2145/2272 variables, and 3300 constraints, problems are : Problem set: 6 solved, 7 unsolved in 5009 ms.
Refiners :[Generalized P Invariants (flows): 1496/1562 constraints, State Equation: 1797/1916 constraints, PredecessorRefiner: 7/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 10880ms problems are : Problem set: 6 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 577 out of 1916 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1363 are kept as prefixes of interest. Removing 553 places using SCC suffix rule.4 ms
Discarding 553 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 27 transitions
Reduce isomorphic transitions removed 27 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 29 rules applied. Total rules applied 30 place count 1363 transition count 325
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 32 place count 1361 transition count 325
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 54 place count 1339 transition count 303
Iterating global reduction 2 with 22 rules applied. Total rules applied 76 place count 1339 transition count 303
Free-agglomeration rule (complex) applied 23 times.
Iterating global reduction 2 with 23 rules applied. Total rules applied 99 place count 1339 transition count 280
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 2 with 23 rules applied. Total rules applied 122 place count 1316 transition count 280
Applied a total of 122 rules in 189 ms. Remains 1316 /1916 variables (removed 600) and now considering 280/356 (removed 76) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 189 ms. Remains : 1316/1916 places, 280/356 transitions.
RANDOM walk for 40000 steps (1540 resets) in 1069 ms. (37 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (92 resets) in 640 ms. (62 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (74 resets) in 718 ms. (55 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (48 resets) in 168 ms. (236 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (48 resets) in 729 ms. (54 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (52 resets) in 741 ms. (53 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (70 resets) in 150 ms. (264 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (52 resets) in 657 ms. (60 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 396837 steps, run timeout after 3001 ms. (steps per millisecond=132 ) properties seen :0 out of 7
Probabilistic random walk after 396837 steps, saw 60870 distinct states, run finished after 3001 ms. (steps per millisecond=132 ) properties seen :0
// Phase 1: matrix 280 rows 1316 cols
[2024-06-01 05:44:43] [INFO ] Computed 1058 invariants in 7 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/577 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 31/608 variables, 528/528 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/608 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 498/1106 variables, 484/1012 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1106 variables, 0/1012 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 232/1338 variables, 1106/2118 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1338 variables, 0/2118 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 188/1526 variables, 140/2258 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1526 variables, 0/2258 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 23/1549 variables, 23/2281 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1549 variables, 23/2304 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1549 variables, 0/2304 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 47/1596 variables, 47/2351 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1596 variables, 23/2374 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1596 variables, 0/2374 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 0/1596 variables, 0/2374 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1596/1596 variables, and 2374 constraints, problems are : Problem set: 0 solved, 7 unsolved in 4470 ms.
Refiners :[Generalized P Invariants (flows): 1058/1058 constraints, State Equation: 1316/1316 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/577 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 31/608 variables, 528/528 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/608 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 498/1106 variables, 484/1012 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1106 variables, 0/1012 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 232/1338 variables, 1106/2118 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1338 variables, 1/2119 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1338 variables, 0/2119 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 188/1526 variables, 140/2259 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1526 variables, 6/2265 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1526 variables, 0/2265 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 23/1549 variables, 23/2288 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1549 variables, 23/2311 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1549 variables, 0/2311 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 47/1596 variables, 47/2358 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1596 variables, 23/2381 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1596 variables, 0/2381 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 0/1596 variables, 0/2381 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1596/1596 variables, and 2381 constraints, problems are : Problem set: 0 solved, 7 unsolved in 20040 ms.
Refiners :[Generalized P Invariants (flows): 1058/1058 constraints, State Equation: 1316/1316 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 24761ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 2 different solutions.
Finished Parikh walk after 96 steps, including 0 resets, run visited all 4 properties in 5 ms. (steps per millisecond=19 )
Parikh walk visited 7 properties in 292 ms.
Found 6 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p0))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1))), (G (OR (NOT p1) (NOT p2))), (G (OR p1 (NOT p2) (NOT p0))), (G (OR (NOT p1) p2 (NOT p0))), (G (OR (NOT p1) (NOT p2) (NOT p0))), (G (OR (NOT p1) (NOT p2) p0)), (G (OR (NOT p2) (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p0) p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p1 (NOT p0)))), (F (NOT (AND p1 (NOT p2)))), (F (NOT (AND p1 (NOT p2) (NOT p0)))), (F p0), (F (NOT (OR p1 p2 p0))), (F (NOT (OR p1 (NOT p2) p0))), (F p2), (F (NOT (OR p1 (NOT p2)))), (F (NOT (OR p2 (NOT p0)))), (F (NOT p1)), (F (NOT (OR p1 p2))), (F (NOT (OR p1 p2 (NOT p0))))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p1 (NOT p0))))
Knowledge based reduction with 23 factoid took 823 ms. Reduced automaton from 17 states, 82 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-00 finished in 115279 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))))'
Support contains 47 out of 1916 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1363 are kept as prefixes of interest. Removing 553 places using SCC suffix rule.21 ms
Discarding 553 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 46 place count 1317 transition count 263
Iterating global reduction 0 with 45 rules applied. Total rules applied 91 place count 1317 transition count 263
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 93 place count 1317 transition count 263
Applied a total of 93 rules in 180 ms. Remains 1317 /1916 variables (removed 599) and now considering 263/356 (removed 93) transitions.
// Phase 1: matrix 263 rows 1317 cols
[2024-06-01 05:45:09] [INFO ] Computed 1056 invariants in 6 ms
[2024-06-01 05:45:11] [INFO ] Implicit Places using invariants in 1485 ms returned []
[2024-06-01 05:45:11] [INFO ] Invariant cache hit.
[2024-06-01 05:45:17] [INFO ] Implicit Places using invariants and state equation in 5900 ms returned [580, 581, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 603, 606, 608, 609, 610, 611, 1276, 1280, 1281, 1282, 1283, 1284, 1285, 1286, 1287, 1288, 1289, 1290, 1291, 1292, 1293, 1294, 1295, 1296, 1297, 1298, 1299, 1300, 1301]
Discarding 46 places :
Implicit Place search using SMT with State Equation took 7391 ms to find 46 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1271/1916 places, 263/356 transitions.
Applied a total of 0 rules in 62 ms. Remains 1271 /1271 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7633 ms. Remains : 1271/1916 places, 263/356 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-01
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-01 finished in 7722 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(F((p0&&X(p1)))))))'
Support contains 70 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 65 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2024-06-01 05:45:17] [INFO ] Computed 1562 invariants in 23 ms
[2024-06-01 05:45:19] [INFO ] Implicit Places using invariants in 2434 ms returned []
[2024-06-01 05:45:19] [INFO ] Invariant cache hit.
[2024-06-01 05:45:23] [INFO ] Implicit Places using invariants and state equation in 3916 ms returned [1155, 1156, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1181, 1183, 1184, 1185, 1186]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 6361 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 65 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6491 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 217 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-02
Stuttering criterion allowed to conclude after 38 steps with 1 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-02 finished in 6727 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(F(!p0))))'
Support contains 46 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 69 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2024-06-01 05:45:24] [INFO ] Invariant cache hit.
[2024-06-01 05:45:26] [INFO ] Implicit Places using invariants in 2369 ms returned []
[2024-06-01 05:45:26] [INFO ] Invariant cache hit.
[2024-06-01 05:45:34] [INFO ] Implicit Places using invariants and state equation in 7666 ms returned [1155, 1156, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1181, 1183, 1184, 1185, 1186]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 10041 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 68 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 10179 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 178 ms :[p0, p0, p0]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-03
Product exploration explored 100000 steps with 33333 reset in 419 ms.
Product exploration explored 100000 steps with 33333 reset in 399 ms.
Computed a total of 1893 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1893 transition count 356
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 : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-03 finished in 11543 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) U (X(X(X(p1)))&&F(p2))))))'
Support contains 71 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 72 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2024-06-01 05:45:35] [INFO ] Invariant cache hit.
[2024-06-01 05:45:37] [INFO ] Implicit Places using invariants in 2327 ms returned []
[2024-06-01 05:45:37] [INFO ] Invariant cache hit.
[2024-06-01 05:45:42] [INFO ] Implicit Places using invariants and state equation in 4043 ms returned [1155, 1156, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1181, 1183, 1184, 1185, 1186]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 6377 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 64 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6514 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 691 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (NOT p1), (NOT p1), true, (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-04
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-04 finished in 7241 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 U X((F(!p1)&&X(X(G(!p2)))))))))'
Support contains 71 out of 1916 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1363 are kept as prefixes of interest. Removing 553 places using SCC suffix rule.10 ms
Discarding 553 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 46 place count 1318 transition count 264
Iterating global reduction 0 with 45 rules applied. Total rules applied 91 place count 1318 transition count 264
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 93 place count 1317 transition count 263
Applied a total of 93 rules in 143 ms. Remains 1317 /1916 variables (removed 599) and now considering 263/356 (removed 93) transitions.
// Phase 1: matrix 263 rows 1317 cols
[2024-06-01 05:45:42] [INFO ] Computed 1056 invariants in 11 ms
[2024-06-01 05:45:44] [INFO ] Implicit Places using invariants in 1637 ms returned []
[2024-06-01 05:45:44] [INFO ] Invariant cache hit.
[2024-06-01 05:45:56] [INFO ] Implicit Places using invariants and state equation in 12346 ms returned [579, 580, 587, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 605, 607, 608, 609, 610]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 13990 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1294/1916 places, 263/356 transitions.
Applied a total of 0 rules in 52 ms. Remains 1294 /1294 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 14185 ms. Remains : 1294/1916 places, 263/356 transitions.
Stuttering acceptance computed with spot in 731 ms :[(OR p1 p2), (OR p1 p2), (OR p1 p2), p2, p2, p1, p2, p2, p2, (AND p1 p2), p2, p2, p2, p2]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-05
Product exploration explored 100000 steps with 3712 reset in 501 ms.
Product exploration explored 100000 steps with 3710 reset in 570 ms.
Computed a total of 1294 stabilizing places and 263 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1294 transition count 263
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 p1) (NOT p2)), (X (NOT p1)), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 18 ms. Reduced automaton from 14 states, 61 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-05 finished in 16258 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)||G(F(p1)))))'
Support contains 47 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 68 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2024-06-01 05:45:59] [INFO ] Computed 1562 invariants in 22 ms
[2024-06-01 05:46:01] [INFO ] Implicit Places using invariants in 2587 ms returned []
[2024-06-01 05:46:01] [INFO ] Invariant cache hit.
[2024-06-01 05:46:09] [INFO ] Implicit Places using invariants and state equation in 7292 ms returned [1155, 1156, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1181, 1183, 1184, 1185, 1186]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 9883 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 66 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 10018 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-06
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-06 finished in 10213 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)))'
Support contains 46 out of 1916 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1363 are kept as prefixes of interest. Removing 553 places using SCC suffix rule.4 ms
Discarding 553 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 46 place count 1318 transition count 264
Iterating global reduction 0 with 45 rules applied. Total rules applied 91 place count 1318 transition count 264
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 95 place count 1316 transition count 262
Applied a total of 95 rules in 132 ms. Remains 1316 /1916 variables (removed 600) and now considering 262/356 (removed 94) transitions.
// Phase 1: matrix 262 rows 1316 cols
[2024-06-01 05:46:09] [INFO ] Computed 1056 invariants in 14 ms
[2024-06-01 05:46:10] [INFO ] Implicit Places using invariants in 1594 ms returned []
[2024-06-01 05:46:10] [INFO ] Invariant cache hit.
[2024-06-01 05:46:19] [INFO ] Implicit Places using invariants and state equation in 8082 ms returned [578, 579, 586, 587, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 604, 606, 607, 608, 609]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 9679 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1293/1916 places, 262/356 transitions.
Applied a total of 0 rules in 51 ms. Remains 1293 /1293 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9863 ms. Remains : 1293/1916 places, 262/356 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-07
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-07 finished in 9910 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 U p1)||F(p2)))))'
Support contains 3 out of 1916 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1363 are kept as prefixes of interest. Removing 553 places using SCC suffix rule.6 ms
Discarding 553 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 45 place count 1318 transition count 265
Iterating global reduction 0 with 44 rules applied. Total rules applied 89 place count 1318 transition count 265
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 91 place count 1317 transition count 264
Applied a total of 91 rules in 140 ms. Remains 1317 /1916 variables (removed 599) and now considering 264/356 (removed 92) transitions.
// Phase 1: matrix 264 rows 1317 cols
[2024-06-01 05:46:19] [INFO ] Computed 1056 invariants in 11 ms
[2024-06-01 05:46:20] [INFO ] Implicit Places using invariants in 1515 ms returned []
[2024-06-01 05:46:20] [INFO ] Invariant cache hit.
[2024-06-01 05:46:23] [INFO ] Implicit Places using invariants and state equation in 2681 ms returned [580, 581, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 603, 606, 608, 609, 610, 611, 1276, 1280, 1281, 1282, 1283, 1284, 1285, 1286, 1287, 1288, 1289, 1290, 1291, 1292, 1293, 1294, 1295, 1296, 1297, 1298, 1299, 1300, 1301]
Discarding 46 places :
Implicit Place search using SMT with State Equation took 4205 ms to find 46 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1271/1916 places, 264/356 transitions.
Applied a total of 0 rules in 52 ms. Remains 1271 /1271 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4398 ms. Remains : 1271/1916 places, 264/356 transitions.
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-08
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-08 finished in 4555 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)&&(p0||G(p1)||F(p2)))))'
Support contains 49 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 68 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2024-06-01 05:46:23] [INFO ] Computed 1562 invariants in 20 ms
[2024-06-01 05:46:26] [INFO ] Implicit Places using invariants in 2623 ms returned []
[2024-06-01 05:46:26] [INFO ] Invariant cache hit.
[2024-06-01 05:46:34] [INFO ] Implicit Places using invariants and state equation in 7614 ms returned [1155, 1156, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1181, 1183, 1184, 1185, 1186]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 10243 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 58 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 10370 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 205 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p2), (AND (NOT p2) (NOT p1)), true]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-10
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-10 finished in 10597 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((X(!p0)||F(!p1))))))'
Support contains 2 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 70 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2024-06-01 05:46:34] [INFO ] Invariant cache hit.
[2024-06-01 05:46:36] [INFO ] Implicit Places using invariants in 2381 ms returned []
[2024-06-01 05:46:36] [INFO ] Invariant cache hit.
[2024-06-01 05:46:43] [INFO ] Implicit Places using invariants and state equation in 7164 ms returned [1155, 1156, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1181, 1183, 1184, 1185, 1186]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 9548 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 63 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 9681 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 189 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-12
Product exploration explored 100000 steps with 20007 reset in 330 ms.
Product exploration explored 100000 steps with 20095 reset in 342 ms.
Computed a total of 1893 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1893 transition count 356
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 (NOT p0)), (X (X p1)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 99 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
RANDOM walk for 40000 steps (1487 resets) in 309 ms. (129 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (91 resets) in 43 ms. (909 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (90 resets) in 72 ms. (547 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (88 resets) in 39 ms. (1000 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1114857 steps, run timeout after 3001 ms. (steps per millisecond=371 ) properties seen :0 out of 3
Probabilistic random walk after 1114857 steps, saw 151841 distinct states, run finished after 3001 ms. (steps per millisecond=371 ) properties seen :0
// Phase 1: matrix 356 rows 1893 cols
[2024-06-01 05:46:48] [INFO ] Computed 1540 invariants in 206 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 121/128 variables, 71/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 22/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 23/151 variables, 22/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 23/140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 188/339 variables, 94/234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/339 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 23/362 variables, 22/256 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/362 variables, 23/279 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/362 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 139/501 variables, 24/303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/501 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 690/1191 variables, 598/901 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1191 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 30/1221 variables, 506/1407 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1221 variables, 30/1437 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1221 variables, 0/1437 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 499/1720 variables, 484/1921 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1720 variables, 499/2420 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1720 variables, 0/2420 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 529/2249 variables, 529/2949 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2249 variables, 484/3433 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2249 variables, 0/3433 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 0/2249 variables, 0/3433 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2249/2249 variables, and 3433 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1767 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1893/1893 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 121/128 variables, 71/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 22/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 3/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 23/151 variables, 22/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 23/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 188/339 variables, 94/237 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/339 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 23/362 variables, 22/259 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/362 variables, 23/282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/362 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 139/501 variables, 24/306 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/501 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 690/1191 variables, 598/904 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1191 variables, 0/904 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 30/1221 variables, 506/1410 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1221 variables, 30/1440 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1221 variables, 0/1440 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 499/1720 variables, 484/1924 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1720 variables, 499/2423 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1720 variables, 0/2423 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 529/2249 variables, 529/2952 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2249 variables, 484/3436 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2249 variables, 0/3436 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 0/2249 variables, 0/3436 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2249/2249 variables, and 3436 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1444 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1893/1893 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 3439ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 35 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=35 )
Parikh walk visited 3 properties in 14 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (X p1)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 4 factoid took 277 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
Stuttering acceptance computed with spot in 215 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
Support contains 2 out of 1893 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1893/1893 places, 356/356 transitions.
Applied a total of 0 rules in 72 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2024-06-01 05:46:52] [INFO ] Invariant cache hit.
[2024-06-01 05:46:55] [INFO ] Implicit Places using invariants in 2302 ms returned []
[2024-06-01 05:46:55] [INFO ] Invariant cache hit.
[2024-06-01 05:47:05] [INFO ] Implicit Places using invariants and state equation in 10107 ms returned []
Implicit Place search using SMT with State Equation took 12417 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-06-01 05:47:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1892 variables, 1540/1540 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1892 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2248 variables, 1892/3432 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2248/2249 variables, and 3432 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1892/1893 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1892 variables, 1540/1540 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1892 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2248 variables, 1892/3432 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2248 variables, 332/3764 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 1)
(s142 1)
(s143 1)
(s144 0)
(s145 0)
(s146 1)
(s147 1)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 1)
(s153 0)
(s154 1)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 1)
(s162 0)
(s163 1)
(s164 0)
(s165 1)
(s166 0)
(s167 1)
(s168 0)
(s169 1)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 0)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 0)
(s538 0)
(s539 0)
(s540 0)
(s541 0)
(s542 0)
(s543 0)
(s544 0)
(s545 0)
(s546 0)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 0)
(s552 0)
(s553 0)
(s554 0)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 0)
(s562 0)
(s563 0)
(s564 0)
(s565 0)
(s566 0)
(s567 0)
(s568 0)
(s569 0)
(s570 0)
(s571 0)
(s572 0)
(s573 0)
(s574 0)
(s575 0)
(s576 0)
(s577 0)
(s578 0)
(s579 0)
(s580 0)
(s581 0)
(s582 0)
(s583 0)
(s584 0)
(s585 0)
(s586 0)
(s587 0)
(s588 0)
(s589 0)
(s590 0)
(s591 0)
(s592 0)
(s593 0)
(s594 0)
(s595 0)
(s596 0)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 0)
(s602 0)
(s603 0)
(s604 0)
(s605 0)
(s606 0)
(s607 0)
(s608 0)
(s609 0)
(s610 0)
(s611 0)
(s612 0)
(s613 0)
(s614 0)
(s615 0)
(s616 0)
(s617 0)
(s618 0)
(s619 0)
(s620 0)
(s621 0)
(s622 0)
(s623 0)
(s624 0)
(s625 0)
(s626 0)
(s627 0)
(s628 0)
(s629 0)
(s630 0)
(s631 0)
(s632 0)
(s633 0)
(s634 0)
(s635 0)
(s636 0)
(s637 0)
(s638 0)
(s639 0)
(s640 0)
(s641 0)
(s642 0)
(s643 0)
(s644 0)
(s645 0)
(s646 0)
(s647 0)
(s648 0)
(s649 0)
(s650 0)
(s651 0)
(s652 0)
(s653 0)
(s654 0)
(s655 0)
(s656 0)
(s657 0)
(s658 0)
(s659 0)
(s660 0)
(s661 0)
(s662 0)
(s663 0)
(s664 0)
(s665 0)
(s666 0)
(s667 0)
(s668 0)
(s669 0)
(s670 0)
(s671 0)
(s672 0)
(s673 0)
(s674 0)
(s675 0)
(s676 0)
(s677 0)
(s678 0)
(s679 0)
(s680 0)
(s681 0)
(s682 0)
(s683 0)
(s684 0)
(s685 0)
(s686 0)
(s687 0)
(s688 0)
(s689 0)
(s690 0)
(s691 0)
(s692 0)
(s693 0)
(s694 0)
(s695 0)
(s696 0)
(s697 0)
(s698 0)
(s699 0)
(s700 0)
(s701 0)
(s702 0)
(s703 0)
(s704 0)
(s705 0)
(s706 0)
(s707 0)
(s708 0)
(s709 0)
(s710 0)
(s711 0)
(s712 0)
(s713 0)
(s714 0)
(s715 0)
(s716 0)
(s717 0)
(s718 0)
(s719 0)
(s720 0)
(s721 0)
(s722 0)
(s723 0)
(s724 0)
(s725 0)
(s726 0)
(s727 0)
(s728 0)
(s729 0)
(s730 0)
(s731 0)
(s732 0)
(s733 0)
(s734 0)
(s735 0)
(s736 0)
(s737 0)
(s738 0)
(s739 0)
(s740 0)
(s741 0)
(s742 0)
(s743 0)
(s744 0)
(s745 0)
(s746 0)
(s747 0)
(s748 0)
(s749 0)
(s750 0)
(s751 0)
(s752 0)
(s753 0)
(s754 0)
(s755 0)
(s756 0)
(s757 0)
(s758 0)
(s759 0)
(s760 0)
(s761 0)
(s762 0)
(s763 0)
(s764 0)
(s765 0)
(s766 0)
(s767 0)
(s768 0)
(s769 0)
(s770 0)
(s771 0)
(s772 0)
(s773 0)
(s774 0)
(s775 0)
(s776 0)
(s777 0)
(s778 0)
(s779 0)
(s780 0)
(s781 0)
(s782 0)
(s783 0)
(s784 0)
(s785 0)
(s786 0)
(s787 0)
(s788 0)
(s789 0)
(s790 0)
(s791 0)
(s792 0)
(s793 0)
(s794 0)
(s795 0)
(s796 0)
(s797 0)
(s798 0)
(s799 0)
(s800 0)
(s801 0)
(s802 0)
(s803 0)
(s804 0)
(s805 0)
(s806 0)
(s807 0)
(s808 0)
(s809 0)
(s810 0)
(s811 0)
(s812 0)
(s813 0)
(s814 0)
(s815 0)
(s816 0)
(s817 0)
(s818 0)
(s819 0)
(s820 0)
(s821 0)
(s822 0)
(s823 0)
(s824 0)
(s825 0)
(s826 0)
(s827 0)
(s828 0)
(s829 0)
(s830 0)
(s831 0)
(s832 0)
(s833 0)
(s834 0)
(s835 0)
(s836 0)
(s837 0)
(s838 0)
(s839 0)
(s840 0)
(s841 0)
(s842 0)
(s843 0)
(s844 0)
(s845 0)
(s846 0)
(s847 0)
(s848 0)
(s849 0)
(s850 0)
(s851 0)
(s852 0)
(s853 0)
(s854 0)
(s855 0)
(s856 0)
(s857 0)
(s858 0)
(s859 0)
(s860 0)
(s861 0)
(s862 0)
(s863 0)
(s864 0)
(s865 0)
(s866 0)
(s867 0)
(s868 0)
(s869 0)
(s870 0)
(s871 0)
(s872 0)
(s873 0)
(s874 0)
(s875 0)
(s876 0)
(s877 0)
(s878 0)
(s879 0)
(s880 0)
(s881 0)
(s882 0)
(s883 0)
(s884 0)
(s885 0)
(s886 0)
(s887 0)
(s888 0)
(s889 0)
(s890 0)
(s891 0)
(s892 0)
(s893 0)
(s894 0)
(s895 0)
(s896 0)
(s897 0)
(s898 0)
(s899 0)
(s900 0)
(s901 0)
(s902 0)
(s903 0)
(s904 0)
(s905 0)
(s906 0)
(s907 0)
(s908 0)
(s909 0)
(s910 0)
(s911 0)
(s912 0)
(s913 0)
(s914 0)
(s915 0)
(s916 0)
(s917 0)
(s918 0)
(s919 0)
(s920 0)
(s921 0)
(s922 0)
(s923 0)
(s924 0)
(s925 0)
(s926 0)
(s927 0)
(s928 0)
(s929 0)
(s930 0)
(s931 0)
(s932 0)
(s933 0)
(s934 0)
(s935 0)
(s936 0)
(s937 0)
(s938 0)
(s939 0)
(s940 0)
(s941 0)
(s942 0)
(s943 0)
(s944 0)
(s945 0)
(s946 0)
(s947 0)
(s948 0)
(s949 0)
(s950 0)
(s951 0)
(s952 0)
(s953 0)
(s954 0)
(s955 0)
(s956 0)
(s957 0)
(s958 0)
(s959 0)
(s960 0)
(s961 0)
(s962 0)
(s963 0)
(s964 0)
(s965 0)
(s966 0)
(s967 0)
(s968 0)
(s969 0)
(s970 0)
(s971 0)
(s972 0)
(s973 0)
(s974 0)
(s975 0)
(s976 0)
(s977 0)
(s978 0)
(s979 0)
(s980 0)
(s981 0)
(s982 0)
(s983 0)
(s984 0)
(s985 0)
(s986 0)
(s987 0)
(s988 0)
(s989 0)
(s990 0)
(s991 0)
(s992 0)
(s993 0)
(s994 0)
(s995 0)
(s996 0)
(s997 0)
(s998 0)
(s999 0)
(s1000 0)
(s1001 0)
(s1002 0)
(s1003 0)
(s1004 0)
(s1005 0)
(s1006 0)
(s1007 0)
(s1008 0)
(s1009 0)
(s1010 0)
(s1011 0)
(s1012 0)
(s1013 0)
(s1014 0)
(s1015 0)
(s1016 0)
(s1017 0)
(s1018 0)
(s1019 0)
(s1020 0)
(s1021 0)
(s1022 0)
(s1023 0)
(s1024 0)
(s1025 0)
(s1026 0)
(s1027 0)
(s1028 0)
(s1029 0)
(s1030 0)
(s1031 0)
(s1032 0)
(s1033 0)
(s1034 0)
(s1035 0)
(s1036 0)
(s1037 0)
(s1038 0)
(s1039 0)
(s1040 0)
(s1041 0)
(s1042 0)
(s1043 0)
(s1044 0)
(s1045 0)
(s1046 0)
(s1047 0)
(s1048 0)
(s1049 0)
(s1050 0)
(s1051 0)
(s1052 0)
(s1053 0)
(s1054 0)
(s1055 0)
(s1056 0)
(s1057 0)
(s1058 0)
(s1059 0)
(s1060 0)
(s1061 0)
(s1062 0)
(s1063 0)
(s1064 0)
(s1065 0)
(s1066 0)
(s1067 0)
(s1068 0)
(s1069 0)
(s1070 0)
(s1071 0)
(s1072 0)
(s1073 0)
(s1074 0)
(s1075 0)
(s1076 0)
(s1077 0)
(s1078 0)
(s1079 0)
(s1080 0)
(s1081 0)
(s1082 0)
(s1083 0)
(s1084 0)
(s1085 0)
(s1086 0)
(s1087 0)
(s1088 0)
(s1089 0)
(s1090 0)
(s1091 0)
(s1092 0)
(s1093 0)
(s1094 0)
(s1095 0)
(s1096 0)
(s1097 0)
(s1098 0)
(s1099 0)
(s1100 0)
(s1101 0)
(s1102 0)
(s1103 0)
(s1104 0)
(s1105 0)
(s1106 0)
(s1107 0)
(s1108 0)
(s1109 0)
(s1110 0)
(s1111 0)
(s1112 0)
(s1113 0)
(s1114 0)
(s1115 0)
(s1116 0)
(s1117 0)
(s1118 0)
(s1119 0)
(s1120 0)
(s1121 0)
(s1122 0)
(s1123 0)
(s1124 0)
(s1125 0)
(s1126 0)
(s1127 0)
(s1128 0)
(s1129 0)
(s1130 0)
(s1131 0)
(s1132 0)
(s1133 0)
(s1134 0)
(s1135 0)
(s1136 0)
(s1137 0)
(s1138 0)
(s1139 0)
(s1140 0)
(s1141 0)
(s1142 0)
(s1143 0)
(s1144 0)
(s1145 0)
(s1146 0)
(s1147 0)
(s1148 0)
(s1149 0)
(s1150 0)
(s1151 0)
(s1152 0)
(s1153 0)
(s1154 0)
(s1155 0)
(s1156 0)
(s1157 0)
(s1158 0)
(s1159 0)
(s1160 0)
(s1161 0)
(s1162 0)
(s1163 0)
(s1164 0)
(s1165 0)
(s1166 0)
(s1167 0)
(s1168 0)
(s1169 0)
(s1170 0)
(s1171 0)
(s1172 0)
(s1173 0)
(s1174 0)
(s1175 0)
(s1176 0)
(s1177 0)
(s1178 0)
(s1179 0)
(s1180 0)
(s1181 0)
(s1182 0)
(s1183 0)
(s1184 0)
(s1185 0)
(s1186 0)
(s1187 0)
(s1188 0)
(s1189 0)
(s1190 0)
(s1191 0)
(s1192 0)
(s1193 0)
(s1194 0)
(s1195 0)
(s1196 0)
(s1197 0)
(s1198 0)
(s1199 0)
(s1200 0)
(s1201 0)
(s1202 0)
(s1203 0)
(s1204 0)
(s1205 0)
(s1206 0)
(s1207 0)
(s1208 0)
(s1209 0)
(s1210 0)
(s1211 0)
(s1212 0)
(s1213 0)
(s1214 0)
(s1215 0)
(s1216 0)
(s1217 0)
(s1218 0)
(s1219 0)
(s1220 0)
(s1221 0)
(s1222 0)
(s1223 0)
(s1224 0)
(s1225 0)
(s1226 0)
(s1227 0)
(s1228 0)
(s1229 0)
(s1230 0)
(s1231 0)
(s1232 0)
(s1233 0)
(s1234 0)
(s1235 0)
(s1236 0)
(s1237 0)
(s1238 0)
(s1239 0)
(s1240 0)
(s1241 0)
(s1242 0)
(s1243 0)
(s1244 0)
(s1245 0)
(s1246 0)
(s1247 0)
(s1248 0)
(s1249 0)
(s1250 0)
(s1251 0)
(s1252 0)
(s1253 0)
(s1254 0)
(s1255 0)
(s1256 0)
(s1257 0)
(s1258 0)
(s1259 0)
(s1260 0)
(s1261 0)
(s1262 0)
(s1263 0)
(s1264 0)
(s1265 0)
(s1266 0)
(s1267 0)
(s1268 0)
(s1269 0)
(s1270 0)
(s1271 0)
(s1272 0)
(s1273 0)
(s1274 0)
(s1275 0)
(s1276 0)
(s1277 0)
(s1278 0)
(s1279 0)
(s1280 0)
(s1281 0)
(s1282 0)
(s1283 0)
(s1284 0)
(s1285 0)
(s1286 0)
(s1287 0)
(s1288 0)
(s1289 0)
(s1290 0)
(s1291 0)
(s1292 0)
(s1293 0)
(s1294 0)
(s1295 0)
(s1296 0)
(s1297 0)
(s1298 0)
(s1299 0)
(s1300 0)
(s1301 0)
(s1302 0)
(s1303 0)
(s1304 0)
(s1305 0)
(s1306 0)
(s1307 0)
(s1308 0)
(s1309 0)
(s1310 0)
(s1311 0)
(s1312 0)
(s1313 0)
(s1314 0)
(s1315 0)
(s1316 0)
(s1317 0)
(s1318 0)
(s1319 0)
(s1320 0)
(s1321 0)
(s1322 0)
(s1323 0)
(s1324 0)
(s1325 0)
(s1326 0)
(s1327 0)
(s1328 0)
(s1329 0)
(s1330 0)
(s1331 0)
(s1332 0)
(s1333 0)
(s1334 0)
(s1335 0)
(s1336 0)
(s1337 0)
(s1338 0)
(s1339 0)
(s1340 0)
(s1341 0)
(s1342 0)
(s1343 0)
(s1344 0)
(s1345 0)
(s1346 0)
(s1347 0)
(s1348 0)
(s1349 0)
(s1350 0)
(s1351 0)
(s1352 0)
(s1353 0)
(s1354 0)
(s1355 0)
(s1356 0)
(s1357 0)
(s1358 0)
(s1359 0)
(s1360 0)
(s1361 0)
(s1362 0)
(s1363 0)
(s1364 0)
(s1365 0)
(s1366 0)
(s1367 0)
(s1368 0)
(s1369 0)
(s1370 0)
(s1371 0)
(s1372 0)
(s1373 0)
(s1374 0)
(s1375 0)
(s1376 0)
(s1377 0)
(s1378 0)
(s1379 0)
(s1380 0)
(s1381 0)
(s1382 0)
(s1383 0)
(s1384 0)
(s1385 0)
(s1386 0)
(s1387 0)
(s1388 0)
(s1389 0)
(s1390 0)
(s1391 0)
(s1392 0)
(s1393 0)
(s1394 0)
(s1395 0)
(s1396 0)
(s1397 0)
(s1398 0)
(s1399 0)
(s1400 0)
(s1401 0)
(s1402 0)
(s1403 0)
(s1404 0)
(s1405 0)
(s1406 0)
(s1407 0)
(s1408 0)
(s1409 0)
(s1410 0)
(s1411 0)
(s1412 0)
(s1413 0)
(s1414 0)
(s1415 0)
(s1416 0)
(s1417 0)
(s1418 0)
(s1419 0)
(s1420 0)
(s1421 0)
(s1422 0)
(s1423 0)
(s1424 0)
(s1425 0)
(s1426 0)
(s1427 0)
(s1428 0)
(s1429 0)
(s1430 0)
(s1431 0)
(s1432 0)
(s1433 0)
(s1434 0)
(s1435 0)
(s1436 0)
(s1437 0)
(s1438 0)
(s1439 0)
(s1440 0)
(s1441 0)
(s1442 0)
(s1443 0)
(s1444 0)
(s1445 0)
(s1446 0)
(s1447 0)
(s1448 0)
(s1449 0)
(s1450 0)
(s1451 0)
(s1452 0)
(s1453 0)
(s1454 0)
(s1455 0)
(s1456 0)
(s1457 0)
(s1458 0)
(s1459 0)
(s1460 0)
(s1461 0)
(s1462 0)
(s1463 0)
(s1464 0)
(s1465 0)
(s1466 0)
(s1467 0)
(s1468 0)
(s1469 0)
(s1470 0)
(s1471 0)
(s1472 0)
(s1473 0)
(s1474 0)
(s1475 0)
(s1476 0)
(s1477 0)
(s1478 0)
(s1479 0)
(s1480 0)
(s1481 0)
(s1482 0)
(s1483 0)
(s1484 0)
(s1485 0)
(s1486 0)
(s1487 0)
(s1488 0)
(s1489 0)
(s1490 0)
(s1491 0)
(s1492 0)
(s1493 0)
(s1494 0)
(s1495 0)
(s1496 0)
(s1497 0)
(s1498 0)
(s1499 0)
(s1500 0)
(s1501 0)
(s1502 0)
(s1503 0)
(s1504 0)
(s1505 0)
(s1506 0)
(s1507 0)
(s1508 0)
(s1509 0)
(s1510 0)
(s1511 0)
(s1512 0)
(s1513 0)
(s1514 0)
(s1515 0)
(s1516 0)
(s1517 0)
(s1518 0)
(s1519 0)
(s1520 0)
(s1521 0)
(s1522 0)
(s1523 0)
(s1524 0)
(s1525 0)
(s1526 0)
(s1527 0)
(s1528 0)
(s1529 0)
(s1530 0)
(s1531 0)
(s1532 0)
(s1533 0)
(s1534 0)
(s1535 0)
(s1536 0)
(s1537 0)
(s1538 0)
(s1539 0)
(s1540 0)
(s1541 0)
(s1542 0)
(s1543 0)
(s1544 0)
(s1545 0)
(s1546 0)
(s1547 0)
(s1548 0)
(s1549 0)
(s1550 0)
(s1551 0)
(s1552 0)
(s1553 0)
(s1554 0)
(s1555 0)
(s1556 0)
(s1557 0)
(s1558 0)
(s1559 0)
(s1560 0)
(s1561 0)
(s1562 0)
(s1563 0)
(s1564 0)
(s1565 0)
(s1566 0)
(s1567 0)
(s1568 0)
(s1569 0)
(s1570 0)
(s1571 0)
(s1572 0)
(s1573 0)
(s1574 0)
(s1575 0)
(s1576 0)
(s1577 0)
(s1578 0)
(s1579 0)
(s1580 0)
(s1581 0)
(s1582 0)
(s1583 0)
(s1584 0)
(s1585 0)
(s1586 0)
(s1587 0)
(s1588 0)
(s1589 0)
(s1590 0)
(s1591 0)
(s1592 0)
(s1593 0)
(s1594 0)
(s1595 0)
(s1596 0)
(s1597 0)
(s1598 0)
(s1599 0)
(s1600 0)
(s1601 0)
(s1602 0)
(s1603 0)
(s1604 0)
(s1605 0)
(s1606 0)
(s1607 0)
(s1608 0)
(s1609 0)
(s1610 0)
(s1611 0)
(s1612 0)
(s1613 0)
(s1614 0)
(s1615 0)
(s1616 0)
(s1617 0)
(s1618 0)
(s1619 0)
(s1620 0)
(s1621 0)
(s1622 0)
(s1623 0)
(s1624 0)
(s1625 0)
(s1626 0)
(s1627 0)
(s1628 0)
(s1629 0)
(s1630 0)
(s1631 0)
(s1632 0)
(s1633 0)
(s1634 0)
(s1635 0)
(s1636 0)
(s1637 0)
(s1638 0)
(s1639 0)
(s1640 0)
(s1641 0)
(s1642 0)
(s1643 0)
(s1644 0)
(s1645 0)
(s1646 0)
(s1647 0)
(s1648 0)
(s1649 0)
(s1650 0)
(s1651 0)
(s1652 0)
(s1653 0)
(s1654 0)
(s1655 0)
(s1656 0)
(s1657 0)
(s1658 0)
(s1659 0)
(s1660 0)
(s1661 0)
(s1662 0)
(s1663 0)
(s1664 0)
(s1665 0)
(s1666 0)
(s1667 0)
(s1668 0)
(s1669 0)
(s1670 0)
(s1671 0)
(s1672 0)
(s1673 0)
(s1674 0)
(s1675 0)
(s1676 0)
(s1677 0)
(s1678 0)
(s1679 0)
(s1680 0)
(s1681 0)
(s1682 0)
(s1683 0)
(s1684 0)
(s1685 0)
(s1686 0)
(s1687 0)
(s1688 0)
(s1689 0)
(s1690 0)
(s1691 0)
(s1692 0)
(s1693 0)
(s1694 0)
(s1695 0)
(s1696 0)
(s1697 0)
(s1698 0)
(s1699 0)
(s1700 0)
(s1701 0)
(s1702 0)
(s1703 0)
(s1704 0)
(s1705 0)
(s1706 0)
(s1707 0)
(s1708 0)
(s1709 0)
(s1710 0)
(s1711 0)
(s1712 0)
(s1713 0)
(s1714 0)
(s1715 0)
(s1716 0)
(s1717 0)
(s1718 0)
(s1719 0)
(s1720 0)
(s1721 0)
(s1722 0)
(s1723 0)
(s1724 0)
(s1725 0)
(s1726 0)
(s1727 0)
(s1728 0)
(s1729 0)
(s1730 0)
(s1731 0)
(s1732 0)
(s1733 0)
(s1734 0)
(s1735 0)
(s1736 0)
(s1737 0)
(s1738 0)
(s1739 0)
(s1740 0)
(s1741 0)
(s1742 0)
(s1743 0)
(s1744 0)
(s1745 0)
(s1746 0)
(s1747 0)
(s1748 0)
(s1749 0)
(s1750 0)
(s1751 0)
(s1752 0)
(s1753 0)
(s1754 0)
(s1755 0)
(s1756 0)
(s1757 0)
(s1758 0)
(s1759 0)
(s1760 0)
(s1761 0)
(s1762 0)
(s1763 0)
(s1764 0)
(s1765 0)
(s1766 0)
(s1767 0)
(s1768 0)
(s1769 0)
(s1770 0)
(s1771 0)
(s1772 0)
(s1773 0)
(s1774 0)
(s1775 0)
(s1776 0)
(s1777 0)
(s1778 0)
(s1779 0)
(s1780 0)
(s1781 0)
(s1782 0)
(s1783 0)
(s1784 0)
(s1785 0)
(s1786 0)
(s1787 0)
(s1788 0)
(s1789 0)
(s1790 0)
(s1791 0)
(s1792 0)
(s1793 0)
(s1794 0)
(s1795 0)
(s1796 0)
(s1797 0)
(s1798 0)
(s1799 0)
(s1800 0)
(s1801 0)
(s1802 0)
(s1803 0)
(s1804 0)
(s1805 0)
(s1806 0)
(s1807 0)
(s1808 0)
(s1809 0)
(s1810 0)
(s1811 0)
(s1812 0)
(s1813 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2248/2249 variables, and 3764 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1892/1893 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
After SMT, in 60391ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60396ms
Finished structural reductions in LTL mode , in 1 iterations and 72887 ms. Remains : 1893/1893 places, 356/356 transitions.
Computed a total of 1893 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1893 transition count 356
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 (NOT p0)), (X (X p1)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 89 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
RANDOM walk for 40000 steps (1487 resets) in 262 ms. (152 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (87 resets) in 36 ms. (1081 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (89 resets) in 37 ms. (1052 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (85 resets) in 32 ms. (1212 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 636386 steps, run timeout after 3001 ms. (steps per millisecond=212 ) properties seen :0 out of 3
Probabilistic random walk after 636386 steps, saw 90217 distinct states, run finished after 3001 ms. (steps per millisecond=212 ) properties seen :0
[2024-06-01 05:48:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 121/128 variables, 71/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 22/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 23/151 variables, 22/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 23/140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 188/339 variables, 94/234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/339 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 23/362 variables, 22/256 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/362 variables, 23/279 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/362 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 139/501 variables, 24/303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/501 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 690/1191 variables, 598/901 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1191 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 30/1221 variables, 506/1407 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1221 variables, 30/1437 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1221 variables, 0/1437 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 499/1720 variables, 484/1921 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1720 variables, 499/2420 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1720 variables, 0/2420 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 529/2249 variables, 529/2949 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2249 variables, 484/3433 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2249 variables, 0/3433 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 0/2249 variables, 0/3433 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2249/2249 variables, and 3433 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2011 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1893/1893 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 121/128 variables, 71/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 22/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 3/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 23/151 variables, 22/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 23/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 188/339 variables, 94/237 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/339 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 23/362 variables, 22/259 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/362 variables, 23/282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/362 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 139/501 variables, 24/306 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/501 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 690/1191 variables, 598/904 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1191 variables, 0/904 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 30/1221 variables, 506/1410 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1221 variables, 30/1440 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1221 variables, 0/1440 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 499/1720 variables, 484/1924 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1720 variables, 499/2423 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1720 variables, 0/2423 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 529/2249 variables, 529/2952 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2249 variables, 484/3436 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2249 variables, 0/3436 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 0/2249 variables, 0/3436 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2249/2249 variables, and 3436 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1378 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1893/1893 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 3432ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 1122 steps, including 31 resets, run visited all 3 properties in 5 ms. (steps per millisecond=224 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 5 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (X p1)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 4 factoid took 193 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
Stuttering acceptance computed with spot in 161 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
Stuttering acceptance computed with spot in 164 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
Product exploration explored 100000 steps with 19993 reset in 317 ms.
Product exploration explored 100000 steps with 19979 reset in 333 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 181 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
Support contains 2 out of 1893 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1893/1893 places, 356/356 transitions.
Graph (complete) has 14725 edges and 1893 vertex of which 1340 are kept as prefixes of interest. Removing 553 places using SCC suffix rule.3 ms
Discarding 553 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 46 place count 1295 transition count 264
Iterating global reduction 0 with 45 rules applied. Total rules applied 91 place count 1295 transition count 264
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 1295 transition count 265
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 92 rules in 424 ms. Remains 1295 /1893 variables (removed 598) and now considering 265/356 (removed 91) transitions.
[2024-06-01 05:48:15] [INFO ] Redundant transitions in 59 ms returned []
Running 241 sub problems to find dead transitions.
// Phase 1: matrix 265 rows 1295 cols
[2024-06-01 05:48:15] [INFO ] Computed 1034 invariants in 8 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1294 variables, 1034/1034 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1294 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 241 unsolved
Problem TDEAD185 is UNSAT
Problem TDEAD246 is UNSAT
At refinement iteration 2 (OVERLAPS) 265/1559 variables, 1294/2328 constraints. Problems are: Problem set: 2 solved, 239 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1559 variables, 0/2328 constraints. Problems are: Problem set: 2 solved, 239 unsolved
At refinement iteration 4 (OVERLAPS) 1/1560 variables, 1/2329 constraints. Problems are: Problem set: 2 solved, 239 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1560/1560 variables, and 2329 constraints, problems are : Problem set: 2 solved, 239 unsolved in 30011 ms.
Refiners :[Generalized P Invariants (flows): 1034/1034 constraints, State Equation: 1295/1295 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 239 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1293 variables, 1034/1034 constraints. Problems are: Problem set: 2 solved, 239 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1293 variables, 0/1034 constraints. Problems are: Problem set: 2 solved, 239 unsolved
At refinement iteration 2 (OVERLAPS) 264/1557 variables, 1293/2327 constraints. Problems are: Problem set: 2 solved, 239 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1557 variables, 239/2566 constraints. Problems are: Problem set: 2 solved, 239 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1557/1560 variables, and 2566 constraints, problems are : Problem set: 2 solved, 239 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 1034/1034 constraints, State Equation: 1293/1295 constraints, PredecessorRefiner: 239/241 constraints, Known Traps: 0/0 constraints]
After SMT, in 60252ms problems are : Problem set: 2 solved, 239 unsolved
Search for dead transitions found 2 dead transitions in 60255ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 1295/1893 places, 263/356 transitions.
Graph (complete) has 14654 edges and 1295 vertex of which 1294 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 49 ms. Remains 1294 /1295 variables (removed 1) and now considering 263/263 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 1294/1893 places, 263/356 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60811 ms. Remains : 1294/1893 places, 263/356 transitions.
Support contains 2 out of 1893 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1893/1893 places, 356/356 transitions.
Applied a total of 0 rules in 58 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1893 cols
[2024-06-01 05:49:15] [INFO ] Computed 1540 invariants in 194 ms
[2024-06-01 05:49:17] [INFO ] Implicit Places using invariants in 2472 ms returned []
[2024-06-01 05:49:17] [INFO ] Invariant cache hit.
[2024-06-01 05:49:27] [INFO ] Implicit Places using invariants and state equation in 9849 ms returned []
Implicit Place search using SMT with State Equation took 12341 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-06-01 05:49:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1892 variables, 1540/1540 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1892 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2248 variables, 1892/3432 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2248/2249 variables, and 3432 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1892/1893 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1892 variables, 1540/1540 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1892 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2248 variables, 1892/3432 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2248 variables, 332/3764 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2248/2249 variables, and 3764 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1892/1893 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
After SMT, in 60391ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60394ms
Finished structural reductions in LTL mode , in 1 iterations and 72798 ms. Remains : 1893/1893 places, 356/356 transitions.
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-12 finished in 234074 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((p0 U G(p1))))'
Support contains 3 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 62 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2024-06-01 05:50:28] [INFO ] Computed 1562 invariants in 19 ms
[2024-06-01 05:50:30] [INFO ] Implicit Places using invariants in 2244 ms returned []
[2024-06-01 05:50:30] [INFO ] Invariant cache hit.
[2024-06-01 05:50:34] [INFO ] Implicit Places using invariants and state equation in 3643 ms returned [1155, 1156, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1181, 1183, 1184, 1185, 1186]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 5891 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 61 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6014 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-13 finished in 6160 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)))'
Support contains 25 out of 1916 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1386 are kept as prefixes of interest. Removing 530 places using SCC suffix rule.5 ms
Discarding 530 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 22 place count 1364 transition count 311
Iterating global reduction 0 with 21 rules applied. Total rules applied 43 place count 1364 transition count 311
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 47 place count 1362 transition count 309
Applied a total of 47 rules in 119 ms. Remains 1362 /1916 variables (removed 554) and now considering 309/356 (removed 47) transitions.
// Phase 1: matrix 309 rows 1362 cols
[2024-06-01 05:50:34] [INFO ] Computed 1056 invariants in 12 ms
[2024-06-01 05:50:36] [INFO ] Implicit Places using invariants in 1423 ms returned []
[2024-06-01 05:50:36] [INFO ] Invariant cache hit.
[2024-06-01 05:50:39] [INFO ] Implicit Places using invariants and state equation in 3025 ms returned [625, 626, 633, 634, 635, 636, 637, 638, 639, 640, 641, 642, 643, 644, 645, 646, 647, 648, 651, 653, 654, 655, 656, 1321, 1325, 1326, 1327, 1328, 1329, 1330, 1331, 1332, 1333, 1334, 1335, 1336, 1337, 1338, 1339, 1340, 1341, 1342, 1343, 1344, 1345, 1346]
Discarding 46 places :
Implicit Place search using SMT with State Equation took 4464 ms to find 46 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1316/1916 places, 309/356 transitions.
Applied a total of 0 rules in 37 ms. Remains 1316 /1316 variables (removed 0) and now considering 309/309 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4621 ms. Remains : 1316/1916 places, 309/356 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-14
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-14 finished in 4672 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((X(!p0)||F(!p1))))))'
Found a Lengthening insensitive property : QuasiCertifProtocol-PT-22-LTLFireability-12
Stuttering acceptance computed with spot in 192 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
Support contains 2 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1363 are kept as prefixes of interest. Removing 553 places using SCC suffix rule.8 ms
Discarding 553 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 46 place count 1317 transition count 263
Iterating global reduction 0 with 45 rules applied. Total rules applied 91 place count 1317 transition count 263
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 93 place count 1316 transition count 262
Applied a total of 93 rules in 131 ms. Remains 1316 /1916 variables (removed 600) and now considering 262/356 (removed 94) transitions.
// Phase 1: matrix 262 rows 1316 cols
[2024-06-01 05:50:39] [INFO ] Computed 1056 invariants in 12 ms
[2024-06-01 05:50:41] [INFO ] Implicit Places using invariants in 1491 ms returned []
[2024-06-01 05:50:41] [INFO ] Invariant cache hit.
[2024-06-01 05:50:52] [INFO ] Implicit Places using invariants and state equation in 11180 ms returned [579, 580, 587, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 605, 607, 608, 609, 610, 1275, 1279, 1280, 1281, 1282, 1283, 1284, 1285, 1286, 1287, 1288, 1289, 1290, 1291, 1292, 1293, 1294, 1295, 1296, 1297, 1298, 1299, 1300]
Discarding 46 places :
Implicit Place search using SMT with State Equation took 12677 ms to find 46 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1270/1916 places, 262/356 transitions.
Applied a total of 0 rules in 45 ms. Remains 1270 /1270 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 12853 ms. Remains : 1270/1916 places, 262/356 transitions.
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-12
Product exploration explored 100000 steps with 19981 reset in 351 ms.
Product exploration explored 100000 steps with 20009 reset in 366 ms.
Computed a total of 1270 stabilizing places and 262 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1270 transition count 262
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 (NOT p0)), (X (X p1)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 117 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
RANDOM walk for 40000 steps (1387 resets) in 382 ms. (104 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (51 resets) in 55 ms. (714 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (50 resets) in 45 ms. (869 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (51 resets) in 46 ms. (851 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1107172 steps, run timeout after 3001 ms. (steps per millisecond=368 ) properties seen :0 out of 3
Probabilistic random walk after 1107172 steps, saw 152044 distinct states, run finished after 3001 ms. (steps per millisecond=368 ) properties seen :0
// Phase 1: matrix 262 rows 1270 cols
[2024-06-01 05:50:56] [INFO ] Computed 1012 invariants in 11 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 163/171 variables, 93/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 22/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 207/378 variables, 92/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 623/1001 variables, 553/762 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1001 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 34/1035 variables, 506/1268 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1035 variables, 34/1302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1035 variables, 0/1302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 495/1530 variables, 484/1786 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1530 variables, 495/2281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1530 variables, 0/2281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 2/1532 variables, 1/2282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1532 variables, 0/2282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/1532 variables, 0/2282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1532/1532 variables, and 2282 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1216 ms.
Refiners :[Generalized P Invariants (flows): 1012/1012 constraints, State Equation: 1270/1270 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 163/171 variables, 93/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 22/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 3/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 207/378 variables, 92/212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 623/1001 variables, 553/765 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1001 variables, 0/765 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 34/1035 variables, 506/1271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1035 variables, 34/1305 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1035 variables, 0/1305 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 495/1530 variables, 484/1789 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1530 variables, 495/2284 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1530 variables, 0/2284 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 2/1532 variables, 1/2285 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1532 variables, 0/2285 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/1532 variables, 0/2285 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1532/1532 variables, and 2285 constraints, problems are : Problem set: 0 solved, 3 unsolved in 970 ms.
Refiners :[Generalized P Invariants (flows): 1012/1012 constraints, State Equation: 1270/1270 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 2209ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 3609 steps, including 94 resets, run visited all 3 properties in 17 ms. (steps per millisecond=212 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 17 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (X p1)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 4 factoid took 198 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
Stuttering acceptance computed with spot in 202 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
Support contains 2 out of 1270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1270/1270 places, 262/262 transitions.
Applied a total of 0 rules in 30 ms. Remains 1270 /1270 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2024-06-01 05:50:59] [INFO ] Invariant cache hit.
[2024-06-01 05:51:01] [INFO ] Implicit Places using invariants in 1323 ms returned []
[2024-06-01 05:51:01] [INFO ] Invariant cache hit.
[2024-06-01 05:51:08] [INFO ] Implicit Places using invariants and state equation in 7300 ms returned []
Implicit Place search using SMT with State Equation took 8625 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2024-06-01 05:51:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1247 variables, 1012/1012 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1247 variables, 0/1012 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 262/1509 variables, 1247/2259 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1509 variables, 0/2259 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 23/1532 variables, 23/2282 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1532 variables, 0/2282 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1532/1532 variables, and 2282 constraints, problems are : Problem set: 0 solved, 215 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 1012/1012 constraints, State Equation: 1270/1270 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1247 variables, 1012/1012 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1247 variables, 0/1012 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 262/1509 variables, 1247/2259 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1509 variables, 215/2474 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1509 variables, 0/2474 constraints. Problems are: Problem set: 0 solved, 215 unsolved
SMT process timed out in 60207ms, After SMT, problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 60220ms
Finished structural reductions in LTL mode , in 1 iterations and 68877 ms. Remains : 1270/1270 places, 262/262 transitions.
Computed a total of 1270 stabilizing places and 262 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1270 transition count 262
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 (NOT p0)), (X (X p1)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 107 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
RANDOM walk for 40000 steps (1387 resets) in 223 ms. (178 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (52 resets) in 39 ms. (1000 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (51 resets) in 44 ms. (888 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (53 resets) in 28 ms. (1379 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1110339 steps, run timeout after 3001 ms. (steps per millisecond=369 ) properties seen :0 out of 3
Probabilistic random walk after 1110339 steps, saw 152514 distinct states, run finished after 3001 ms. (steps per millisecond=369 ) properties seen :0
[2024-06-01 05:52:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 163/171 variables, 93/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 22/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 207/378 variables, 92/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 623/1001 variables, 553/762 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1001 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 34/1035 variables, 506/1268 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1035 variables, 34/1302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1035 variables, 0/1302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 495/1530 variables, 484/1786 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1530 variables, 495/2281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1530 variables, 0/2281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 2/1532 variables, 1/2282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1532 variables, 0/2282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/1532 variables, 0/2282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1532/1532 variables, and 2282 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1167 ms.
Refiners :[Generalized P Invariants (flows): 1012/1012 constraints, State Equation: 1270/1270 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 163/171 variables, 93/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 22/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 3/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 207/378 variables, 92/212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 623/1001 variables, 553/765 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1001 variables, 0/765 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 34/1035 variables, 506/1271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1035 variables, 34/1305 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1035 variables, 0/1305 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 495/1530 variables, 484/1789 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1530 variables, 495/2284 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1530 variables, 0/2284 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 2/1532 variables, 1/2285 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1532 variables, 0/2285 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/1532 variables, 0/2285 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1532/1532 variables, and 2285 constraints, problems are : Problem set: 0 solved, 3 unsolved in 947 ms.
Refiners :[Generalized P Invariants (flows): 1012/1012 constraints, State Equation: 1270/1270 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 2124ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 1102 steps, including 28 resets, run visited all 3 properties in 6 ms. (steps per millisecond=183 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 7 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (X p1)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 4 factoid took 191 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
Stuttering acceptance computed with spot in 200 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
Stuttering acceptance computed with spot in 201 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
Product exploration explored 100000 steps with 20005 reset in 353 ms.
Product exploration explored 100000 steps with 20007 reset in 381 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 211 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
Support contains 2 out of 1270 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1270/1270 places, 262/262 transitions.
Applied a total of 0 rules in 46 ms. Remains 1270 /1270 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2024-06-01 05:52:16] [INFO ] Redundant transitions in 22 ms returned []
Running 215 sub problems to find dead transitions.
[2024-06-01 05:52:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1247 variables, 1012/1012 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1247 variables, 0/1012 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 262/1509 variables, 1247/2259 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1509 variables, 0/2259 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 23/1532 variables, 23/2282 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1532/1532 variables, and 2282 constraints, problems are : Problem set: 0 solved, 215 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 1012/1012 constraints, State Equation: 1270/1270 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1247 variables, 1012/1012 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1247 variables, 0/1012 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 262/1509 variables, 1247/2259 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1509 variables, 215/2474 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1509 variables, 0/2474 constraints. Problems are: Problem set: 0 solved, 215 unsolved
SMT process timed out in 60213ms, After SMT, problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 60215ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60294 ms. Remains : 1270/1270 places, 262/262 transitions.
Support contains 2 out of 1270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1270/1270 places, 262/262 transitions.
Applied a total of 0 rules in 35 ms. Remains 1270 /1270 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2024-06-01 05:53:16] [INFO ] Invariant cache hit.
[2024-06-01 05:53:17] [INFO ] Implicit Places using invariants in 1362 ms returned []
[2024-06-01 05:53:17] [INFO ] Invariant cache hit.
[2024-06-01 05:53:24] [INFO ] Implicit Places using invariants and state equation in 6693 ms returned []
Implicit Place search using SMT with State Equation took 8059 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2024-06-01 05:53:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1247 variables, 1012/1012 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1247 variables, 0/1012 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 262/1509 variables, 1247/2259 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1509 variables, 0/2259 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 23/1532 variables, 23/2282 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1532/1532 variables, and 2282 constraints, problems are : Problem set: 0 solved, 215 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 1012/1012 constraints, State Equation: 1270/1270 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1247 variables, 1012/1012 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1247 variables, 0/1012 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 262/1509 variables, 1247/2259 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1509 variables, 215/2474 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1509 variables, 0/2474 constraints. Problems are: Problem set: 0 solved, 215 unsolved
SMT process timed out in 60221ms, After SMT, problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 60223ms
Finished structural reductions in LTL mode , in 1 iterations and 68319 ms. Remains : 1270/1270 places, 262/262 transitions.
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-12 finished in 225667 ms.
[2024-06-01 05:54:24] [INFO ] Flatten gal took : 57 ms
[2024-06-01 05:54:24] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 05:54:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1916 places, 356 transitions and 4110 arcs took 8 ms.
Total runtime 770614 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-12 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717222080751

--------------------
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
mcc2024
ltl formula name QuasiCertifProtocol-PT-22-LTLFireability-12
ltl formula formula --ltl=/tmp/1717/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1916 places, 356 transitions and 4110 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.020 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1717/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1717/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1717/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1717/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1918 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1917, there are 362 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~29 levels ~10000 states ~38712 transitions
pnml2lts-mc( 3/ 4): ~29 levels ~20000 states ~77440 transitions
pnml2lts-mc( 3/ 4): ~29 levels ~40000 states ~169752 transitions
pnml2lts-mc( 3/ 4): ~29 levels ~80000 states ~383216 transitions
pnml2lts-mc( 3/ 4): ~29 levels ~160000 states ~773272 transitions
pnml2lts-mc( 3/ 4): ~30 levels ~320000 states ~1572912 transitions
pnml2lts-mc( 3/ 4): ~30 levels ~640000 states ~3527872 transitions
pnml2lts-mc( 1/ 4): ~31 levels ~1280000 states ~7865656 transitions
pnml2lts-mc( 3/ 4): ~31 levels ~2560000 states ~15377624 transitions
pnml2lts-mc( 3/ 4): ~31 levels ~5120000 states ~33757176 transitions
pnml2lts-mc( 3/ 4): ~31 levels ~10240000 states ~70117784 transitions
pnml2lts-mc( 3/ 4): ~32 levels ~20480000 states ~146018280 transitions
pnml2lts-mc( 1/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33551330
pnml2lts-mc( 0/ 4): unique states count: 33551422
pnml2lts-mc( 0/ 4): unique transitions count: 260715861
pnml2lts-mc( 0/ 4): - self-loop count: 55487
pnml2lts-mc( 0/ 4): - claim dead count: 227105933
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33551426
pnml2lts-mc( 0/ 4): - cum. max stack depth: 121
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33551426 states 260715958 transitions, fanout: 7.771
pnml2lts-mc( 0/ 4): Total exploration time 814.560 sec (814.470 sec minimum, 814.505 sec on average)
pnml2lts-mc( 0/ 4): States per second: 41190, Transitions per second: 320070
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 293.9MB, 9.2 B/state, compr.: 0.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/59.0%
pnml2lts-mc( 0/ 4): Stored 359 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 293.9MB (~256.0MB paged-in)

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-22"
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 QuasiCertifProtocol-PT-22, 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 r520-tall-171662337800092"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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