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.r544-smll-171701111300324.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 ViralEpidemic-PT-S03D1C1A04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r544-smll-171701111300324
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 844K
-rw-r--r-- 1 mcc users 9.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K May 19 07:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 19 07:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 04:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Apr 12 04:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 12 04:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 116K Apr 12 04:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 08:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 08:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 11 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 325K 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 ViralEpidemic-PT-S03D1C1A04-LTLFireability-00
FORMULA_NAME ViralEpidemic-PT-S03D1C1A04-LTLFireability-01
FORMULA_NAME ViralEpidemic-PT-S03D1C1A04-LTLFireability-02
FORMULA_NAME ViralEpidemic-PT-S03D1C1A04-LTLFireability-03
FORMULA_NAME ViralEpidemic-PT-S03D1C1A04-LTLFireability-04
FORMULA_NAME ViralEpidemic-PT-S03D1C1A04-LTLFireability-05
FORMULA_NAME ViralEpidemic-PT-S03D1C1A04-LTLFireability-06
FORMULA_NAME ViralEpidemic-PT-S03D1C1A04-LTLFireability-07
FORMULA_NAME ViralEpidemic-PT-S03D1C1A04-LTLFireability-08
FORMULA_NAME ViralEpidemic-PT-S03D1C1A04-LTLFireability-09
FORMULA_NAME ViralEpidemic-PT-S03D1C1A04-LTLFireability-10
FORMULA_NAME ViralEpidemic-PT-S03D1C1A04-LTLFireability-11
FORMULA_NAME ViralEpidemic-PT-S03D1C1A04-LTLFireability-12
FORMULA_NAME ViralEpidemic-PT-S03D1C1A04-LTLFireability-13
FORMULA_NAME ViralEpidemic-PT-S03D1C1A04-LTLFireability-14
FORMULA_NAME ViralEpidemic-PT-S03D1C1A04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717296160987

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ViralEpidemic-PT-S03D1C1A04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 02:42:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 02:42:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 02:42:43] [INFO ] Load time of PNML (sax parser for PT used): 318 ms
[2024-06-02 02:42:43] [INFO ] Transformed 606 places.
[2024-06-02 02:42:43] [INFO ] Transformed 847 transitions.
[2024-06-02 02:42:43] [INFO ] Found NUPN structural information;
[2024-06-02 02:42:43] [INFO ] Parsed PT model containing 606 places and 847 transitions and 1936 arcs in 566 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 124 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ViralEpidemic-PT-S03D1C1A04-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S03D1C1A04-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S03D1C1A04-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 out of 606 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 606/606 places, 847/847 transitions.
Discarding 242 places :
Symmetric choice reduction at 0 with 242 rule applications. Total rules 242 place count 364 transition count 390
Iterating global reduction 0 with 242 rules applied. Total rules applied 484 place count 364 transition count 390
Applied a total of 484 rules in 125 ms. Remains 364 /606 variables (removed 242) and now considering 390/847 (removed 457) transitions.
// Phase 1: matrix 390 rows 364 cols
[2024-06-02 02:42:44] [INFO ] Invariants computation overflowed in 63 ms
[2024-06-02 02:42:44] [INFO ] Implicit Places using invariants in 730 ms returned []
// Phase 1: matrix 390 rows 364 cols
[2024-06-02 02:42:44] [INFO ] Invariants computation overflowed in 13 ms
[2024-06-02 02:42:45] [INFO ] Implicit Places using invariants and state equation in 668 ms returned []
Implicit Place search using SMT with State Equation took 1451 ms to find 0 implicit places.
Running 389 sub problems to find dead transitions.
// Phase 1: matrix 390 rows 364 cols
[2024-06-02 02:42:45] [INFO ] Invariants computation overflowed in 13 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (OVERLAPS) 390/753 variables, 363/363 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/753 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 389 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/754 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/754 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (OVERLAPS) 0/754 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 389 unsolved
No progress, stopping.
After SMT solving in domain Real declared 754/754 variables, and 364 constraints, problems are : Problem set: 0 solved, 389 unsolved in 22421 ms.
Refiners :[State Equation: 364/364 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 389 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (OVERLAPS) 390/753 variables, 363/363 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/753 variables, 389/752 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/753 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (OVERLAPS) 1/754 variables, 1/753 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/754 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 389 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 754/754 variables, and 753 constraints, problems are : Problem set: 0 solved, 389 unsolved in 30042 ms.
Refiners :[State Equation: 364/364 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 0/0 constraints]
After SMT, in 52663ms problems are : Problem set: 0 solved, 389 unsolved
Search for dead transitions found 0 dead transitions in 52696ms
Starting structural reductions in LTL mode, iteration 1 : 364/606 places, 390/847 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54328 ms. Remains : 364/606 places, 390/847 transitions.
Support contains 49 out of 364 places after structural reductions.
[2024-06-02 02:43:38] [INFO ] Flatten gal took : 84 ms
[2024-06-02 02:43:38] [INFO ] Flatten gal took : 41 ms
[2024-06-02 02:43:38] [INFO ] Input system was already deterministic with 390 transitions.
Support contains 47 out of 364 places (down from 49) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 29 to 28
RANDOM walk for 34850 steps (708 resets) in 1623 ms. (21 steps per ms) remains 0/28 properties
Computed a total of 364 stabilizing places and 390 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 364 transition count 390
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(X(G((G(p3)||p2)))&&p1)))))'
Support contains 5 out of 364 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 364/364 places, 390/390 transitions.
Graph (complete) has 220 edges and 364 vertex of which 39 are kept as prefixes of interest. Removing 325 places using SCC suffix rule.2 ms
Discarding 325 places :
Also discarding 331 output transitions
Drop transitions (Output transitions of discarded places.) removed 331 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 33 transition count 47
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 33 transition count 47
Applied a total of 11 rules in 27 ms. Remains 33 /364 variables (removed 331) and now considering 47/390 (removed 343) transitions.
// Phase 1: matrix 47 rows 33 cols
[2024-06-02 02:43:39] [INFO ] Computed 0 invariants in 1 ms
[2024-06-02 02:43:39] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-02 02:43:39] [INFO ] Invariant cache hit.
[2024-06-02 02:43:39] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2024-06-02 02:43:40] [INFO ] Redundant transitions in 18 ms returned [18, 38]
Found 2 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 2 transitions
Redundant transitions reduction (with SMT) removed 2 transitions.
Running 36 sub problems to find dead transitions.
// Phase 1: matrix 45 rows 33 cols
[2024-06-02 02:43:40] [INFO ] Computed 0 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 41/70 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 4/74 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (OVERLAPS) 2/76 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (OVERLAPS) 2/78 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/78 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 9 (OVERLAPS) 0/78 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/78 variables, and 33 constraints, problems are : Problem set: 0 solved, 36 unsolved in 774 ms.
Refiners :[State Equation: 33/33 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 41/70 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 36/65 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 4/74 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (OVERLAPS) 2/76 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (OVERLAPS) 2/78 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/78 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 10 (OVERLAPS) 0/78 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/78 variables, and 69 constraints, problems are : Problem set: 0 solved, 36 unsolved in 774 ms.
Refiners :[State Equation: 33/33 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
After SMT, in 1562ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 1565ms
Starting structural reductions in SI_LTL mode, iteration 1 : 33/364 places, 45/390 transitions.
Graph (complete) has 18 edges and 33 vertex of which 31 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Applied a total of 1 rules in 3 ms. Remains 31 /33 variables (removed 2) and now considering 43/45 (removed 2) transitions.
// Phase 1: matrix 43 rows 31 cols
[2024-06-02 02:43:41] [INFO ] Computed 0 invariants in 0 ms
[2024-06-02 02:43:41] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-06-02 02:43:41] [INFO ] Invariant cache hit.
[2024-06-02 02:43:41] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 31/364 places, 43/390 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1839 ms. Remains : 31/364 places, 43/390 transitions.
Stuttering acceptance computed with spot in 522 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A04-LTLFireability-00
Product exploration explored 100000 steps with 6376 reset in 467 ms.
Product exploration explored 100000 steps with 6395 reset in 306 ms.
Computed a total of 31 stabilizing places and 43 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 31 transition count 43
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0 p2 p3), (X p2), (X p3), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) p3))), (X (NOT (AND p1 (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0) (NOT p2) p3))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p3)))), (X p0), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT (AND p1 (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2) p3)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) p3)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) p2 p3)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) p3)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X p0)), (X (X p1)), (F (G p1)), (F (G p0)), (F (G p2)), (F (G p3))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 33 factoid took 32 ms. Reduced automaton from 5 states, 20 edges and 4 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S03D1C1A04-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S03D1C1A04-LTLFireability-00 finished in 3322 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(p1)))'
Support contains 4 out of 364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 364/364 places, 390/390 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 327 transition count 328
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 327 transition count 328
Applied a total of 74 rules in 14 ms. Remains 327 /364 variables (removed 37) and now considering 328/390 (removed 62) transitions.
// Phase 1: matrix 328 rows 327 cols
[2024-06-02 02:43:43] [INFO ] Invariants computation overflowed in 5 ms
[2024-06-02 02:43:43] [INFO ] Implicit Places using invariants in 202 ms returned []
// Phase 1: matrix 328 rows 327 cols
[2024-06-02 02:43:43] [INFO ] Invariants computation overflowed in 6 ms
[2024-06-02 02:43:43] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 595 ms to find 0 implicit places.
Running 327 sub problems to find dead transitions.
// Phase 1: matrix 328 rows 327 cols
[2024-06-02 02:43:43] [INFO ] Invariants computation overflowed in 9 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/326 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 1 (OVERLAPS) 328/654 variables, 326/326 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/654 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 327 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/655 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/655 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 5 (OVERLAPS) 0/655 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 327 unsolved
No progress, stopping.
After SMT solving in domain Real declared 655/655 variables, and 327 constraints, problems are : Problem set: 0 solved, 327 unsolved in 17136 ms.
Refiners :[State Equation: 327/327 constraints, PredecessorRefiner: 327/327 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 327 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/326 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 1 (OVERLAPS) 328/654 variables, 326/326 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/654 variables, 327/653 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/654 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 4 (OVERLAPS) 1/655 variables, 1/654 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/655 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 6 (OVERLAPS) 0/655 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 327 unsolved
No progress, stopping.
After SMT solving in domain Int declared 655/655 variables, and 654 constraints, problems are : Problem set: 0 solved, 327 unsolved in 23553 ms.
Refiners :[State Equation: 327/327 constraints, PredecessorRefiner: 327/327 constraints, Known Traps: 0/0 constraints]
After SMT, in 40759ms problems are : Problem set: 0 solved, 327 unsolved
Search for dead transitions found 0 dead transitions in 40766ms
Starting structural reductions in LTL mode, iteration 1 : 327/364 places, 328/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41376 ms. Remains : 327/364 places, 328/390 transitions.
Stuttering acceptance computed with spot in 213 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A04-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ViralEpidemic-PT-S03D1C1A04-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S03D1C1A04-LTLFireability-01 finished in 41612 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(p2)&&p1))))'
Support contains 4 out of 364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 364/364 places, 390/390 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 327 transition count 328
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 327 transition count 328
Applied a total of 74 rules in 19 ms. Remains 327 /364 variables (removed 37) and now considering 328/390 (removed 62) transitions.
// Phase 1: matrix 328 rows 327 cols
[2024-06-02 02:44:24] [INFO ] Invariants computation overflowed in 7 ms
[2024-06-02 02:44:25] [INFO ] Implicit Places using invariants in 253 ms returned []
// Phase 1: matrix 328 rows 327 cols
[2024-06-02 02:44:25] [INFO ] Invariants computation overflowed in 7 ms
[2024-06-02 02:44:25] [INFO ] Implicit Places using invariants and state equation in 477 ms returned []
Implicit Place search using SMT with State Equation took 732 ms to find 0 implicit places.
Running 327 sub problems to find dead transitions.
// Phase 1: matrix 328 rows 327 cols
[2024-06-02 02:44:25] [INFO ] Invariants computation overflowed in 7 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/326 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 1 (OVERLAPS) 328/654 variables, 326/326 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/654 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 327 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/655 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/655 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 5 (OVERLAPS) 0/655 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 327 unsolved
No progress, stopping.
After SMT solving in domain Real declared 655/655 variables, and 327 constraints, problems are : Problem set: 0 solved, 327 unsolved in 17436 ms.
Refiners :[State Equation: 327/327 constraints, PredecessorRefiner: 327/327 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 327 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/326 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 1 (OVERLAPS) 328/654 variables, 326/326 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/654 variables, 327/653 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/654 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 4 (OVERLAPS) 1/655 variables, 1/654 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/655 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 6 (OVERLAPS) 0/655 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 327 unsolved
No progress, stopping.
After SMT solving in domain Int declared 655/655 variables, and 654 constraints, problems are : Problem set: 0 solved, 327 unsolved in 24854 ms.
Refiners :[State Equation: 327/327 constraints, PredecessorRefiner: 327/327 constraints, Known Traps: 0/0 constraints]
After SMT, in 42358ms problems are : Problem set: 0 solved, 327 unsolved
Search for dead transitions found 0 dead transitions in 42364ms
Starting structural reductions in LTL mode, iteration 1 : 327/364 places, 328/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43117 ms. Remains : 327/364 places, 328/390 transitions.
Stuttering acceptance computed with spot in 274 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), p0, (NOT p2), true]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A04-LTLFireability-02
Entered a terminal (fully accepting) state of product in 809 steps with 19 reset in 6 ms.
FORMULA ViralEpidemic-PT-S03D1C1A04-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S03D1C1A04-LTLFireability-02 finished in 43422 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((p0||G(p1)))&&G(F(p2)))))'
Support contains 6 out of 364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 364/364 places, 390/390 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 329 transition count 331
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 329 transition count 331
Applied a total of 70 rules in 13 ms. Remains 329 /364 variables (removed 35) and now considering 331/390 (removed 59) transitions.
// Phase 1: matrix 331 rows 329 cols
[2024-06-02 02:45:08] [INFO ] Invariants computation overflowed in 5 ms
[2024-06-02 02:45:08] [INFO ] Implicit Places using invariants in 237 ms returned []
// Phase 1: matrix 331 rows 329 cols
[2024-06-02 02:45:08] [INFO ] Invariants computation overflowed in 5 ms
[2024-06-02 02:45:09] [INFO ] Implicit Places using invariants and state equation in 710 ms returned []
Implicit Place search using SMT with State Equation took 950 ms to find 0 implicit places.
Running 330 sub problems to find dead transitions.
// Phase 1: matrix 331 rows 329 cols
[2024-06-02 02:45:09] [INFO ] Invariants computation overflowed in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/328 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (OVERLAPS) 331/659 variables, 328/328 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/659 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 330 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/660 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/660 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 5 (OVERLAPS) 0/660 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 330 unsolved
No progress, stopping.
After SMT solving in domain Real declared 660/660 variables, and 329 constraints, problems are : Problem set: 0 solved, 330 unsolved in 17448 ms.
Refiners :[State Equation: 329/329 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 330 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/328 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (OVERLAPS) 331/659 variables, 328/328 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/659 variables, 330/658 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/659 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (OVERLAPS) 1/660 variables, 1/659 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/660 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 6 (OVERLAPS) 0/660 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 330 unsolved
No progress, stopping.
After SMT solving in domain Int declared 660/660 variables, and 659 constraints, problems are : Problem set: 0 solved, 330 unsolved in 22684 ms.
Refiners :[State Equation: 329/329 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 0/0 constraints]
After SMT, in 40198ms problems are : Problem set: 0 solved, 330 unsolved
Search for dead transitions found 0 dead transitions in 40202ms
Starting structural reductions in LTL mode, iteration 1 : 329/364 places, 331/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41166 ms. Remains : 329/364 places, 331/390 transitions.
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p2)]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A04-LTLFireability-04
Stuttering criterion allowed to conclude after 150 steps with 2 reset in 2 ms.
FORMULA ViralEpidemic-PT-S03D1C1A04-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S03D1C1A04-LTLFireability-04 finished in 41449 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||(G(p0) U X(G(!p1))))))'
Support contains 4 out of 364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 364/364 places, 390/390 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 326 transition count 328
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 326 transition count 328
Applied a total of 76 rules in 15 ms. Remains 326 /364 variables (removed 38) and now considering 328/390 (removed 62) transitions.
// Phase 1: matrix 328 rows 326 cols
[2024-06-02 02:45:49] [INFO ] Invariants computation overflowed in 5 ms
[2024-06-02 02:45:49] [INFO ] Implicit Places using invariants in 263 ms returned []
// Phase 1: matrix 328 rows 326 cols
[2024-06-02 02:45:49] [INFO ] Invariants computation overflowed in 5 ms
[2024-06-02 02:45:50] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 678 ms to find 0 implicit places.
Running 327 sub problems to find dead transitions.
// Phase 1: matrix 328 rows 326 cols
[2024-06-02 02:45:50] [INFO ] Invariants computation overflowed in 5 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 1 (OVERLAPS) 328/653 variables, 325/325 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/653 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 327 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/654 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/654 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 5 (OVERLAPS) 0/654 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 327 unsolved
No progress, stopping.
After SMT solving in domain Real declared 654/654 variables, and 326 constraints, problems are : Problem set: 0 solved, 327 unsolved in 16832 ms.
Refiners :[State Equation: 326/326 constraints, PredecessorRefiner: 327/327 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 327 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 1 (OVERLAPS) 328/653 variables, 325/325 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/653 variables, 327/652 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/653 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 4 (OVERLAPS) 1/654 variables, 1/653 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/654 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 6 (OVERLAPS) 0/654 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 327 unsolved
No progress, stopping.
After SMT solving in domain Int declared 654/654 variables, and 653 constraints, problems are : Problem set: 0 solved, 327 unsolved in 21196 ms.
Refiners :[State Equation: 326/326 constraints, PredecessorRefiner: 327/327 constraints, Known Traps: 0/0 constraints]
After SMT, in 38080ms problems are : Problem set: 0 solved, 327 unsolved
Search for dead transitions found 0 dead transitions in 38084ms
Starting structural reductions in LTL mode, iteration 1 : 326/364 places, 328/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38781 ms. Remains : 326/364 places, 328/390 transitions.
Stuttering acceptance computed with spot in 184 ms :[true, (AND (NOT p0) p1), (AND (NOT p0) p1), p1]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A04-LTLFireability-05
Entered a terminal (fully accepting) state of product in 104 steps with 1 reset in 1 ms.
FORMULA ViralEpidemic-PT-S03D1C1A04-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S03D1C1A04-LTLFireability-05 finished in 38987 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 4 out of 364 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 364/364 places, 390/390 transitions.
Graph (complete) has 220 edges and 364 vertex of which 35 are kept as prefixes of interest. Removing 329 places using SCC suffix rule.4 ms
Discarding 329 places :
Also discarding 341 output transitions
Drop transitions (Output transitions of discarded places.) removed 341 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 34 transition count 47
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 7 place count 29 transition count 37
Iterating global reduction 1 with 5 rules applied. Total rules applied 12 place count 29 transition count 37
Applied a total of 12 rules in 21 ms. Remains 29 /364 variables (removed 335) and now considering 37/390 (removed 353) transitions.
// Phase 1: matrix 37 rows 29 cols
[2024-06-02 02:46:28] [INFO ] Computed 0 invariants in 0 ms
[2024-06-02 02:46:28] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 02:46:28] [INFO ] Invariant cache hit.
[2024-06-02 02:46:28] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2024-06-02 02:46:28] [INFO ] Redundant transitions in 1 ms returned []
Running 30 sub problems to find dead transitions.
[2024-06-02 02:46:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 33/58 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 4/62 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 2/64 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 2/66 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/66 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (OVERLAPS) 0/66 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 66/66 variables, and 29 constraints, problems are : Problem set: 0 solved, 30 unsolved in 638 ms.
Refiners :[State Equation: 29/29 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 33/58 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 30/55 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 4/62 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 2/64 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 2/66 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/66 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (OVERLAPS) 0/66 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 66/66 variables, and 59 constraints, problems are : Problem set: 0 solved, 30 unsolved in 763 ms.
Refiners :[State Equation: 29/29 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
After SMT, in 1410ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 1411ms
Starting structural reductions in SI_LTL mode, iteration 1 : 29/364 places, 37/390 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1570 ms. Remains : 29/364 places, 37/390 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A04-LTLFireability-07
Product exploration explored 100000 steps with 8403 reset in 338 ms.
Product exploration explored 100000 steps with 8352 reset in 292 ms.
Computed a total of 29 stabilizing places and 37 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 29 transition count 37
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 : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 29 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S03D1C1A04-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S03D1C1A04-LTLFireability-07 finished in 2343 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((p1&&G(p2)))))'
Support contains 5 out of 364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 364/364 places, 390/390 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 327 transition count 328
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 327 transition count 328
Applied a total of 74 rules in 9 ms. Remains 327 /364 variables (removed 37) and now considering 328/390 (removed 62) transitions.
// Phase 1: matrix 328 rows 327 cols
[2024-06-02 02:46:30] [INFO ] Invariants computation overflowed in 5 ms
[2024-06-02 02:46:31] [INFO ] Implicit Places using invariants in 271 ms returned []
// Phase 1: matrix 328 rows 327 cols
[2024-06-02 02:46:31] [INFO ] Invariants computation overflowed in 5 ms
[2024-06-02 02:46:31] [INFO ] Implicit Places using invariants and state equation in 466 ms returned []
Implicit Place search using SMT with State Equation took 739 ms to find 0 implicit places.
Running 327 sub problems to find dead transitions.
// Phase 1: matrix 328 rows 327 cols
[2024-06-02 02:46:31] [INFO ] Invariants computation overflowed in 5 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/326 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 1 (OVERLAPS) 328/654 variables, 326/326 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/654 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 327 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/655 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/655 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 5 (OVERLAPS) 0/655 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 327 unsolved
No progress, stopping.
After SMT solving in domain Real declared 655/655 variables, and 327 constraints, problems are : Problem set: 0 solved, 327 unsolved in 17456 ms.
Refiners :[State Equation: 327/327 constraints, PredecessorRefiner: 327/327 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 327 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/326 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 1 (OVERLAPS) 328/654 variables, 326/326 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/654 variables, 327/653 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/654 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 4 (OVERLAPS) 1/655 variables, 1/654 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/655 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 6 (OVERLAPS) 0/655 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 327 unsolved
No progress, stopping.
After SMT solving in domain Int declared 655/655 variables, and 654 constraints, problems are : Problem set: 0 solved, 327 unsolved in 25318 ms.
Refiners :[State Equation: 327/327 constraints, PredecessorRefiner: 327/327 constraints, Known Traps: 0/0 constraints]
After SMT, in 42820ms problems are : Problem set: 0 solved, 327 unsolved
Search for dead transitions found 0 dead transitions in 42824ms
Starting structural reductions in LTL mode, iteration 1 : 327/364 places, 328/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43574 ms. Remains : 327/364 places, 328/390 transitions.
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A04-LTLFireability-08
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 0 ms.
FORMULA ViralEpidemic-PT-S03D1C1A04-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S03D1C1A04-LTLFireability-08 finished in 43813 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(G((p0||X(p1)))))))'
Support contains 3 out of 364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 364/364 places, 390/390 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 325 transition count 325
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 325 transition count 325
Applied a total of 78 rules in 11 ms. Remains 325 /364 variables (removed 39) and now considering 325/390 (removed 65) transitions.
// Phase 1: matrix 325 rows 325 cols
[2024-06-02 02:47:14] [INFO ] Invariants computation overflowed in 4 ms
[2024-06-02 02:47:15] [INFO ] Implicit Places using invariants in 269 ms returned []
// Phase 1: matrix 325 rows 325 cols
[2024-06-02 02:47:15] [INFO ] Invariants computation overflowed in 4 ms
[2024-06-02 02:47:15] [INFO ] Implicit Places using invariants and state equation in 507 ms returned []
Implicit Place search using SMT with State Equation took 779 ms to find 0 implicit places.
Running 324 sub problems to find dead transitions.
// Phase 1: matrix 325 rows 325 cols
[2024-06-02 02:47:15] [INFO ] Invariants computation overflowed in 7 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/324 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 325/649 variables, 324/324 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/649 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 324 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/650 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (OVERLAPS) 0/650 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Real declared 650/650 variables, and 325 constraints, problems are : Problem set: 0 solved, 324 unsolved in 18484 ms.
Refiners :[State Equation: 325/325 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 324 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/324 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 325/649 variables, 324/324 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/649 variables, 324/648 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/649 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (OVERLAPS) 1/650 variables, 1/649 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 6 (OVERLAPS) 0/650 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Int declared 650/650 variables, and 649 constraints, problems are : Problem set: 0 solved, 324 unsolved in 21307 ms.
Refiners :[State Equation: 325/325 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints]
After SMT, in 39842ms problems are : Problem set: 0 solved, 324 unsolved
Search for dead transitions found 0 dead transitions in 39847ms
Starting structural reductions in LTL mode, iteration 1 : 325/364 places, 325/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40639 ms. Remains : 325/364 places, 325/390 transitions.
Stuttering acceptance computed with spot in 248 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A04-LTLFireability-09
Entered a terminal (fully accepting) state of product in 28645 steps with 623 reset in 148 ms.
FORMULA ViralEpidemic-PT-S03D1C1A04-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S03D1C1A04-LTLFireability-09 finished in 41057 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 4 out of 364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 364/364 places, 390/390 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 327 transition count 328
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 327 transition count 328
Applied a total of 74 rules in 9 ms. Remains 327 /364 variables (removed 37) and now considering 328/390 (removed 62) transitions.
// Phase 1: matrix 328 rows 327 cols
[2024-06-02 02:47:55] [INFO ] Invariants computation overflowed in 5 ms
[2024-06-02 02:47:56] [INFO ] Implicit Places using invariants in 247 ms returned []
// Phase 1: matrix 328 rows 327 cols
[2024-06-02 02:47:56] [INFO ] Invariants computation overflowed in 5 ms
[2024-06-02 02:47:56] [INFO ] Implicit Places using invariants and state equation in 511 ms returned []
Implicit Place search using SMT with State Equation took 766 ms to find 0 implicit places.
Running 327 sub problems to find dead transitions.
// Phase 1: matrix 328 rows 327 cols
[2024-06-02 02:47:56] [INFO ] Invariants computation overflowed in 5 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/326 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 1 (OVERLAPS) 328/654 variables, 326/326 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/654 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 327 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/655 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/655 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 5 (OVERLAPS) 0/655 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 327 unsolved
No progress, stopping.
After SMT solving in domain Real declared 655/655 variables, and 327 constraints, problems are : Problem set: 0 solved, 327 unsolved in 21080 ms.
Refiners :[State Equation: 327/327 constraints, PredecessorRefiner: 327/327 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 327 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/326 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 1 (OVERLAPS) 328/654 variables, 326/326 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/654 variables, 327/653 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/654 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 4 (OVERLAPS) 1/655 variables, 1/654 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/655 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 6 (OVERLAPS) 0/655 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 327 unsolved
No progress, stopping.
After SMT solving in domain Int declared 655/655 variables, and 654 constraints, problems are : Problem set: 0 solved, 327 unsolved in 21544 ms.
Refiners :[State Equation: 327/327 constraints, PredecessorRefiner: 327/327 constraints, Known Traps: 0/0 constraints]
After SMT, in 42670ms problems are : Problem set: 0 solved, 327 unsolved
Search for dead transitions found 0 dead transitions in 42674ms
Starting structural reductions in LTL mode, iteration 1 : 327/364 places, 328/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43451 ms. Remains : 327/364 places, 328/390 transitions.
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A04-LTLFireability-10
Stuttering criterion allowed to conclude after 33 steps with 0 reset in 1 ms.
FORMULA ViralEpidemic-PT-S03D1C1A04-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S03D1C1A04-LTLFireability-10 finished in 43696 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 364 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 364/364 places, 390/390 transitions.
Graph (complete) has 220 edges and 364 vertex of which 29 are kept as prefixes of interest. Removing 335 places using SCC suffix rule.2 ms
Discarding 335 places :
Also discarding 343 output transitions
Drop transitions (Output transitions of discarded places.) removed 343 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 28 transition count 44
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 8 place count 23 transition count 32
Iterating global reduction 1 with 5 rules applied. Total rules applied 13 place count 23 transition count 32
Applied a total of 13 rules in 6 ms. Remains 23 /364 variables (removed 341) and now considering 32/390 (removed 358) transitions.
// Phase 1: matrix 32 rows 23 cols
[2024-06-02 02:48:39] [INFO ] Computed 0 invariants in 1 ms
[2024-06-02 02:48:39] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-02 02:48:39] [INFO ] Invariant cache hit.
[2024-06-02 02:48:39] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2024-06-02 02:48:39] [INFO ] Redundant transitions in 15 ms returned [9]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 23 sub problems to find dead transitions.
// Phase 1: matrix 31 rows 23 cols
[2024-06-02 02:48:39] [INFO ] Computed 0 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 28/48 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 4/52 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 2/54 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 0/54 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 54/54 variables, and 23 constraints, problems are : Problem set: 0 solved, 23 unsolved in 362 ms.
Refiners :[State Equation: 23/23 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 28/48 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 23/43 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 4/52 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 2/54 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 0/54 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 54/54 variables, and 46 constraints, problems are : Problem set: 0 solved, 23 unsolved in 367 ms.
Refiners :[State Equation: 23/23 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
After SMT, in 734ms problems are : Problem set: 0 solved, 23 unsolved
Search for dead transitions found 0 dead transitions in 734ms
Starting structural reductions in SI_LTL mode, iteration 1 : 23/364 places, 31/390 transitions.
Graph (complete) has 12 edges and 23 vertex of which 22 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Applied a total of 1 rules in 2 ms. Remains 22 /23 variables (removed 1) and now considering 30/31 (removed 1) transitions.
// Phase 1: matrix 30 rows 22 cols
[2024-06-02 02:48:40] [INFO ] Computed 0 invariants in 0 ms
[2024-06-02 02:48:40] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-02 02:48:40] [INFO ] Invariant cache hit.
[2024-06-02 02:48:40] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 22/364 places, 30/390 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 904 ms. Remains : 22/364 places, 30/390 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A04-LTLFireability-11
Product exploration explored 100000 steps with 6493 reset in 122 ms.
Product exploration explored 100000 steps with 6444 reset in 139 ms.
Computed a total of 22 stabilizing places and 30 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 30
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 : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 17 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S03D1C1A04-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S03D1C1A04-LTLFireability-11 finished in 1315 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 364 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 364/364 places, 390/390 transitions.
Graph (complete) has 220 edges and 364 vertex of which 13 are kept as prefixes of interest. Removing 351 places using SCC suffix rule.1 ms
Discarding 351 places :
Also discarding 369 output transitions
Drop transitions (Output transitions of discarded places.) removed 369 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 12 transition count 18
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 10 transition count 14
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 10 transition count 14
Applied a total of 7 rules in 4 ms. Remains 10 /364 variables (removed 354) and now considering 14/390 (removed 376) transitions.
// Phase 1: matrix 14 rows 10 cols
[2024-06-02 02:48:40] [INFO ] Computed 0 invariants in 0 ms
[2024-06-02 02:48:40] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-02 02:48:40] [INFO ] Invariant cache hit.
[2024-06-02 02:48:40] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-06-02 02:48:40] [INFO ] Redundant transitions in 1 ms returned []
Running 10 sub problems to find dead transitions.
[2024-06-02 02:48:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 12/20 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 2/22 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 2/24 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/24 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 10 constraints, problems are : Problem set: 0 solved, 10 unsolved in 132 ms.
Refiners :[State Equation: 10/10 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 12/20 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 2/22 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 2/24 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 0/24 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 20 constraints, problems are : Problem set: 0 solved, 10 unsolved in 143 ms.
Refiners :[State Equation: 10/10 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 278ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 278ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10/364 places, 14/390 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 336 ms. Remains : 10/364 places, 14/390 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A04-LTLFireability-12
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA ViralEpidemic-PT-S03D1C1A04-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S03D1C1A04-LTLFireability-12 finished in 439 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 2 out of 364 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 364/364 places, 390/390 transitions.
Graph (complete) has 220 edges and 364 vertex of which 18 are kept as prefixes of interest. Removing 346 places using SCC suffix rule.2 ms
Discarding 346 places :
Also discarding 364 output transitions
Drop transitions (Output transitions of discarded places.) removed 364 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 17 transition count 24
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 4 place count 15 transition count 20
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 15 transition count 20
Applied a total of 6 rules in 5 ms. Remains 15 /364 variables (removed 349) and now considering 20/390 (removed 370) transitions.
// Phase 1: matrix 20 rows 15 cols
[2024-06-02 02:48:41] [INFO ] Computed 0 invariants in 0 ms
[2024-06-02 02:48:41] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-02 02:48:41] [INFO ] Invariant cache hit.
[2024-06-02 02:48:41] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2024-06-02 02:48:41] [INFO ] Redundant transitions in 14 ms returned [5]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 15 sub problems to find dead transitions.
// Phase 1: matrix 19 rows 15 cols
[2024-06-02 02:48:41] [INFO ] Computed 0 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 17/30 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 2/32 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 2/34 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/34 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/34 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 34/34 variables, and 15 constraints, problems are : Problem set: 0 solved, 15 unsolved in 251 ms.
Refiners :[State Equation: 15/15 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 17/30 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 15/28 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 2/32 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 2/34 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/34 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 0/34 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 34/34 variables, and 30 constraints, problems are : Problem set: 0 solved, 15 unsolved in 257 ms.
Refiners :[State Equation: 15/15 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 513ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 513ms
Starting structural reductions in SI_LTL mode, iteration 1 : 15/364 places, 19/390 transitions.
Graph (complete) has 8 edges and 15 vertex of which 14 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Applied a total of 1 rules in 2 ms. Remains 14 /15 variables (removed 1) and now considering 18/19 (removed 1) transitions.
// Phase 1: matrix 18 rows 14 cols
[2024-06-02 02:48:41] [INFO ] Computed 0 invariants in 0 ms
[2024-06-02 02:48:41] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-02 02:48:41] [INFO ] Invariant cache hit.
[2024-06-02 02:48:41] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/364 places, 18/390 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 670 ms. Remains : 14/364 places, 18/390 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A04-LTLFireability-13
Product exploration explored 100000 steps with 12780 reset in 101 ms.
Product exploration explored 100000 steps with 12897 reset in 110 ms.
Computed a total of 14 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 14 transition count 18
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 : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 19 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S03D1C1A04-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S03D1C1A04-LTLFireability-13 finished in 991 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)||F((G(!p1)||(X(F(!p2))&&(!p3||G(!p1)))||G(!p3))))))'
Support contains 6 out of 364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 364/364 places, 390/390 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 328 transition count 331
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 328 transition count 331
Applied a total of 72 rules in 11 ms. Remains 328 /364 variables (removed 36) and now considering 331/390 (removed 59) transitions.
// Phase 1: matrix 331 rows 328 cols
[2024-06-02 02:48:42] [INFO ] Invariants computation overflowed in 6 ms
[2024-06-02 02:48:42] [INFO ] Implicit Places using invariants in 255 ms returned []
// Phase 1: matrix 331 rows 328 cols
[2024-06-02 02:48:42] [INFO ] Invariants computation overflowed in 8 ms
[2024-06-02 02:48:43] [INFO ] Implicit Places using invariants and state equation in 506 ms returned []
Implicit Place search using SMT with State Equation took 774 ms to find 0 implicit places.
Running 330 sub problems to find dead transitions.
// Phase 1: matrix 331 rows 328 cols
[2024-06-02 02:48:43] [INFO ] Invariants computation overflowed in 6 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/327 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (OVERLAPS) 331/658 variables, 327/327 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/658 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 330 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/659 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/659 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 5 (OVERLAPS) 0/659 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 330 unsolved
No progress, stopping.
After SMT solving in domain Real declared 659/659 variables, and 328 constraints, problems are : Problem set: 0 solved, 330 unsolved in 16858 ms.
Refiners :[State Equation: 328/328 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 330 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/327 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (OVERLAPS) 331/658 variables, 327/327 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/658 variables, 330/657 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/658 variables, 0/657 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (OVERLAPS) 1/659 variables, 1/658 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/659 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 6 (OVERLAPS) 0/659 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 330 unsolved
No progress, stopping.
After SMT solving in domain Int declared 659/659 variables, and 658 constraints, problems are : Problem set: 0 solved, 330 unsolved in 22718 ms.
Refiners :[State Equation: 328/328 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 0/0 constraints]
After SMT, in 39626ms problems are : Problem set: 0 solved, 330 unsolved
Search for dead transitions found 0 dead transitions in 39631ms
Starting structural reductions in LTL mode, iteration 1 : 328/364 places, 331/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40418 ms. Remains : 328/364 places, 331/390 transitions.
Stuttering acceptance computed with spot in 314 ms :[(AND (NOT p0) p1 p3), (AND (NOT p0) p1 p3), (AND (NOT p0) p2 p3 p1), (AND (NOT p0) p1 p3), (AND p3 p2 p1), (AND p1 p3)]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A04-LTLFireability-14
Product exploration explored 100000 steps with 33333 reset in 485 ms.
Product exploration explored 100000 steps with 33333 reset in 555 ms.
Computed a total of 328 stabilizing places and 331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 328 transition count 331
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 p3) p0 (NOT p2) (NOT p1)), (X (NOT p3)), (X (X (NOT p2))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (F (G (NOT p3))), (F (G p0)), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 18 ms. Reduced automaton from 6 states, 13 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S03D1C1A04-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S03D1C1A04-LTLFireability-14 finished in 41982 ms.
All properties solved by simple procedures.
Total runtime 401187 ms.
ITS solved all properties within timeout

BK_STOP 1717296564585

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ViralEpidemic-PT-S03D1C1A04"
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 ViralEpidemic-PT-S03D1C1A04, 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 r544-smll-171701111300324"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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