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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 111K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K 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 3.8K May 19 07:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 23 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 04:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Apr 12 04:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 04:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 12 04:01 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 34K 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-S03D1C1A02-LTLFireability-00
FORMULA_NAME ViralEpidemic-PT-S03D1C1A02-LTLFireability-01
FORMULA_NAME ViralEpidemic-PT-S03D1C1A02-LTLFireability-02
FORMULA_NAME ViralEpidemic-PT-S03D1C1A02-LTLFireability-03
FORMULA_NAME ViralEpidemic-PT-S03D1C1A02-LTLFireability-04
FORMULA_NAME ViralEpidemic-PT-S03D1C1A02-LTLFireability-05
FORMULA_NAME ViralEpidemic-PT-S03D1C1A02-LTLFireability-06
FORMULA_NAME ViralEpidemic-PT-S03D1C1A02-LTLFireability-07
FORMULA_NAME ViralEpidemic-PT-S03D1C1A02-LTLFireability-08
FORMULA_NAME ViralEpidemic-PT-S03D1C1A02-LTLFireability-09
FORMULA_NAME ViralEpidemic-PT-S03D1C1A02-LTLFireability-10
FORMULA_NAME ViralEpidemic-PT-S03D1C1A02-LTLFireability-11
FORMULA_NAME ViralEpidemic-PT-S03D1C1A02-LTLFireability-12
FORMULA_NAME ViralEpidemic-PT-S03D1C1A02-LTLFireability-13
FORMULA_NAME ViralEpidemic-PT-S03D1C1A02-LTLFireability-14
FORMULA_NAME ViralEpidemic-PT-S03D1C1A02-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717295732052

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-S03D1C1A02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 02:35:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 02:35:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 02:35:34] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2024-06-02 02:35:34] [INFO ] Transformed 66 places.
[2024-06-02 02:35:34] [INFO ] Transformed 91 transitions.
[2024-06-02 02:35:34] [INFO ] Found NUPN structural information;
[2024-06-02 02:35:34] [INFO ] Parsed PT model containing 66 places and 91 transitions and 208 arcs in 314 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ViralEpidemic-PT-S03D1C1A02-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S03D1C1A02-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S03D1C1A02-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 91/91 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 59 transition count 79
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 59 transition count 79
Applied a total of 14 rules in 34 ms. Remains 59 /66 variables (removed 7) and now considering 79/91 (removed 12) transitions.
// Phase 1: matrix 79 rows 59 cols
[2024-06-02 02:35:34] [INFO ] Computed 1 invariants in 32 ms
[2024-06-02 02:35:34] [INFO ] Implicit Places using invariants in 375 ms returned []
[2024-06-02 02:35:34] [INFO ] Invariant cache hit.
[2024-06-02 02:35:35] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 564 ms to find 0 implicit places.
Running 78 sub problems to find dead transitions.
[2024-06-02 02:35:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (OVERLAPS) 79/138 variables, 59/60 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (OVERLAPS) 0/138 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 60 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1471 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (OVERLAPS) 79/138 variables, 59/60 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 78/138 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 0/138 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 138 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1636 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints]
After SMT, in 3209ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 3230ms
Starting structural reductions in LTL mode, iteration 1 : 59/66 places, 79/91 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3859 ms. Remains : 59/66 places, 79/91 transitions.
Support contains 39 out of 59 places after structural reductions.
[2024-06-02 02:35:38] [INFO ] Flatten gal took : 42 ms
[2024-06-02 02:35:38] [INFO ] Flatten gal took : 17 ms
[2024-06-02 02:35:38] [INFO ] Input system was already deterministic with 79 transitions.
Reduction of identical properties reduced properties to check from 32 to 30
RANDOM walk for 40000 steps (2914 resets) in 1042 ms. (38 steps per ms) remains 1/30 properties
BEST_FIRST walk for 40001 steps (332 resets) in 213 ms. (186 steps per ms) remains 1/1 properties
[2024-06-02 02:35:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp4 is UNSAT
After SMT solving in domain Real declared 138/138 variables, and 60 constraints, problems are : Problem set: 1 solved, 0 unsolved in 85 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 97ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 59 stabilizing places and 79 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 59 transition count 79
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(!p0)) U (X(G(!p2))&&p1)))'
Support contains 4 out of 59 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 59/59 places, 79/79 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 38 transition count 40
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 38 transition count 40
Applied a total of 42 rules in 5 ms. Remains 38 /59 variables (removed 21) and now considering 40/79 (removed 39) transitions.
// Phase 1: matrix 40 rows 38 cols
[2024-06-02 02:35:39] [INFO ] Computed 1 invariants in 2 ms
[2024-06-02 02:35:39] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-06-02 02:35:39] [INFO ] Invariant cache hit.
[2024-06-02 02:35:39] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Running 39 sub problems to find dead transitions.
[2024-06-02 02:35:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 1/38 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 40/78 variables, 38/39 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (OVERLAPS) 0/78 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/78 variables, and 39 constraints, problems are : Problem set: 0 solved, 39 unsolved in 497 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 38/38 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 1/38 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 40/78 variables, 38/39 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 39/78 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 0/78 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/78 variables, and 78 constraints, problems are : Problem set: 0 solved, 39 unsolved in 654 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 38/38 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 0/0 constraints]
After SMT, in 1167ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 1169ms
Starting structural reductions in LTL mode, iteration 1 : 38/59 places, 40/79 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1302 ms. Remains : 38/59 places, 40/79 transitions.
Stuttering acceptance computed with spot in 353 ms :[(OR (NOT p1) p2), p0, p2]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A02-LTLFireability-00
Product exploration explored 100000 steps with 12662 reset in 527 ms.
Product exploration explored 100000 steps with 12713 reset in 351 ms.
Computed a total of 38 stabilizing places and 40 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 38 transition count 40
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X p2), (X (AND p1 p2)), (X (NOT (AND (NOT p1) p2))), (X p1), (X (NOT (OR (AND (NOT p1) p2) (AND p0 p2)))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p1) p2) (AND p0 p2))))), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1))), (X (X p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 1013 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(OR (NOT p1) p2), p2]
Reduction of identical properties reduced properties to check from 4 to 2
RANDOM walk for 40000 steps (2537 resets) in 214 ms. (186 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (417 resets) in 258 ms. (154 steps per ms) remains 1/1 properties
[2024-06-02 02:35:43] [INFO ] Invariant cache hit.
Problem apf2 is UNSAT
After SMT solving in domain Real declared 2/78 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 20 ms.
Refiners :[Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 24ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X p2), (X (AND p1 p2)), (X (NOT (AND (NOT p1) p2))), (X p1), (X (NOT (OR (AND (NOT p1) p2) (AND p0 p2)))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p1) p2) (AND p0 p2))))), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0))), (F (G (NOT p2))), (G (OR p1 (NOT p2)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1))), (X (X p1)), (F p1), (F p2), (F (NOT (OR (NOT p1) (NOT p2))))]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 483 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S03D1C1A02-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S03D1C1A02-LTLFireability-00 finished in 4573 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 79/79 transitions.
Graph (complete) has 34 edges and 59 vertex of which 9 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.1 ms
Discarding 50 places :
Also discarding 62 output transitions
Drop transitions (Output transitions of discarded places.) removed 62 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 8 transition count 14
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 6 transition count 9
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 6 transition count 9
Applied a total of 7 rules in 25 ms. Remains 6 /59 variables (removed 53) and now considering 9/79 (removed 70) transitions.
// Phase 1: matrix 9 rows 6 cols
[2024-06-02 02:35:44] [INFO ] Computed 0 invariants in 1 ms
[2024-06-02 02:35:44] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-02 02:35:44] [INFO ] Invariant cache hit.
[2024-06-02 02:35:44] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-06-02 02:35:44] [INFO ] Redundant transitions in 1 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-02 02:35:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2/13 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 2/15 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/15 variables, and 6 constraints, problems are : Problem set: 0 solved, 6 unsolved in 107 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 2/13 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 2/15 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/15 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/15 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/15 variables, and 12 constraints, problems are : Problem set: 0 solved, 6 unsolved in 94 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 206ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 207ms
Starting structural reductions in SI_LTL mode, iteration 1 : 6/59 places, 9/79 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 286 ms. Remains : 6/59 places, 9/79 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A02-LTLFireability-02
Stuttering criterion allowed to conclude after 8 steps with 1 reset in 0 ms.
FORMULA ViralEpidemic-PT-S03D1C1A02-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S03D1C1A02-LTLFireability-02 finished in 382 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 59/59 places, 79/79 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 37 transition count 37
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 37 transition count 37
Applied a total of 44 rules in 3 ms. Remains 37 /59 variables (removed 22) and now considering 37/79 (removed 42) transitions.
// Phase 1: matrix 37 rows 37 cols
[2024-06-02 02:35:44] [INFO ] Computed 1 invariants in 2 ms
[2024-06-02 02:35:44] [INFO ] Implicit Places using invariants in 231 ms returned []
[2024-06-02 02:35:44] [INFO ] Invariant cache hit.
[2024-06-02 02:35:44] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
Running 36 sub problems to find dead transitions.
[2024-06-02 02:35:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 1/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 37/74 variables, 37/38 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (OVERLAPS) 0/74 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 74/74 variables, and 38 constraints, problems are : Problem set: 0 solved, 36 unsolved in 464 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 37/37 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/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 1/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 37/74 variables, 37/38 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 36/74 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (OVERLAPS) 0/74 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 74/74 variables, and 74 constraints, problems are : Problem set: 0 solved, 36 unsolved in 526 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
After SMT, in 1002ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 1004ms
Starting structural reductions in LTL mode, iteration 1 : 37/59 places, 37/79 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1321 ms. Remains : 37/59 places, 37/79 transitions.
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A02-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ViralEpidemic-PT-S03D1C1A02-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S03D1C1A02-LTLFireability-03 finished in 1431 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 59/59 places, 79/79 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 37 transition count 37
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 37 transition count 37
Applied a total of 44 rules in 3 ms. Remains 37 /59 variables (removed 22) and now considering 37/79 (removed 42) transitions.
// Phase 1: matrix 37 rows 37 cols
[2024-06-02 02:35:46] [INFO ] Computed 1 invariants in 2 ms
[2024-06-02 02:35:46] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 02:35:46] [INFO ] Invariant cache hit.
[2024-06-02 02:35:46] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Running 36 sub problems to find dead transitions.
[2024-06-02 02:35:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 1/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 37/74 variables, 37/38 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (OVERLAPS) 0/74 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 74/74 variables, and 38 constraints, problems are : Problem set: 0 solved, 36 unsolved in 427 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 37/37 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/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 1/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 37/74 variables, 37/38 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 36/74 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (OVERLAPS) 0/74 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 74/74 variables, and 74 constraints, problems are : Problem set: 0 solved, 36 unsolved in 512 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
After SMT, in 954ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 956ms
Starting structural reductions in LTL mode, iteration 1 : 37/59 places, 37/79 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1076 ms. Remains : 37/59 places, 37/79 transitions.
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A02-LTLFireability-04
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA ViralEpidemic-PT-S03D1C1A02-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S03D1C1A02-LTLFireability-04 finished in 1224 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((X(p1) U (X(p1)&&p2))))))'
Support contains 3 out of 59 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 59/59 places, 79/79 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 37 transition count 37
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 37 transition count 37
Applied a total of 44 rules in 3 ms. Remains 37 /59 variables (removed 22) and now considering 37/79 (removed 42) transitions.
// Phase 1: matrix 37 rows 37 cols
[2024-06-02 02:35:47] [INFO ] Computed 1 invariants in 2 ms
[2024-06-02 02:35:47] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-02 02:35:47] [INFO ] Invariant cache hit.
[2024-06-02 02:35:47] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Running 36 sub problems to find dead transitions.
[2024-06-02 02:35:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 1/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 37/74 variables, 37/38 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (OVERLAPS) 0/74 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 74/74 variables, and 38 constraints, problems are : Problem set: 0 solved, 36 unsolved in 481 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 37/37 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/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 1/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 37/74 variables, 37/38 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 36/74 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (OVERLAPS) 0/74 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 74/74 variables, and 74 constraints, problems are : Problem set: 0 solved, 36 unsolved in 509 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
After SMT, in 1000ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 1001ms
Starting structural reductions in LTL mode, iteration 1 : 37/59 places, 37/79 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1136 ms. Remains : 37/59 places, 37/79 transitions.
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A02-LTLFireability-05
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 1 ms.
FORMULA ViralEpidemic-PT-S03D1C1A02-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S03D1C1A02-LTLFireability-05 finished in 1300 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 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 79/79 transitions.
Graph (complete) has 34 edges and 59 vertex of which 14 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.0 ms
Discarding 45 places :
Also discarding 56 output transitions
Drop transitions (Output transitions of discarded places.) removed 56 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 10 transition count 14
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 10 transition count 14
Applied a total of 7 rules in 5 ms. Remains 10 /59 variables (removed 49) and now considering 14/79 (removed 65) transitions.
// Phase 1: matrix 14 rows 10 cols
[2024-06-02 02:35:48] [INFO ] Computed 0 invariants in 0 ms
[2024-06-02 02:35:48] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-02 02:35:48] [INFO ] Invariant cache hit.
[2024-06-02 02:35:48] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2024-06-02 02:35:48] [INFO ] Redundant transitions in 15 ms returned [2, 6]
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 7 sub problems to find dead transitions.
// Phase 1: matrix 12 rows 10 cols
[2024-06-02 02:35:48] [INFO ] Computed 0 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 9/16 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 2/18 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 2/20 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/22 variables, and 9 constraints, problems are : Problem set: 0 solved, 7 unsolved in 109 ms.
Refiners :[State Equation: 9/10 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 9/16 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 2/18 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 2/20 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/20 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 0/20 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/22 variables, and 16 constraints, problems are : Problem set: 0 solved, 7 unsolved in 120 ms.
Refiners :[State Equation: 9/10 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 236ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 236ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10/59 places, 12/79 transitions.
Graph (complete) has 4 edges and 10 vertex of which 8 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 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 2 ms. Remains 8 /10 variables (removed 2) and now considering 10/12 (removed 2) transitions.
// Phase 1: matrix 10 rows 8 cols
[2024-06-02 02:35:48] [INFO ] Computed 0 invariants in 0 ms
[2024-06-02 02:35:48] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-02 02:35:48] [INFO ] Invariant cache hit.
[2024-06-02 02:35:48] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/59 places, 10/79 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 364 ms. Remains : 8/59 places, 10/79 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A02-LTLFireability-06
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA ViralEpidemic-PT-S03D1C1A02-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S03D1C1A02-LTLFireability-06 finished in 418 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U p1))||(G(p2)&&F(p1))))'
Support contains 6 out of 59 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 59/59 places, 79/79 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 40 transition count 43
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 40 transition count 43
Applied a total of 38 rules in 3 ms. Remains 40 /59 variables (removed 19) and now considering 43/79 (removed 36) transitions.
// Phase 1: matrix 43 rows 40 cols
[2024-06-02 02:35:48] [INFO ] Computed 1 invariants in 1 ms
[2024-06-02 02:35:49] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-06-02 02:35:49] [INFO ] Invariant cache hit.
[2024-06-02 02:35:49] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Running 42 sub problems to find dead transitions.
[2024-06-02 02:35:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 1/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 43/83 variables, 40/41 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (OVERLAPS) 0/83 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 83/83 variables, and 41 constraints, problems are : Problem set: 0 solved, 42 unsolved in 596 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 1/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 43/83 variables, 40/41 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 42/83 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (OVERLAPS) 0/83 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 83/83 variables, and 83 constraints, problems are : Problem set: 0 solved, 42 unsolved in 616 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
After SMT, in 1222ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 1223ms
Starting structural reductions in LTL mode, iteration 1 : 40/59 places, 43/79 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1335 ms. Remains : 40/59 places, 43/79 transitions.
Stuttering acceptance computed with spot in 232 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), true, (NOT p2)]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A02-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ViralEpidemic-PT-S03D1C1A02-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S03D1C1A02-LTLFireability-07 finished in 1585 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)))))'
Support contains 4 out of 59 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 59/59 places, 79/79 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 38 transition count 40
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 38 transition count 40
Applied a total of 42 rules in 2 ms. Remains 38 /59 variables (removed 21) and now considering 40/79 (removed 39) transitions.
// Phase 1: matrix 40 rows 38 cols
[2024-06-02 02:35:50] [INFO ] Computed 1 invariants in 2 ms
[2024-06-02 02:35:50] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 02:35:50] [INFO ] Invariant cache hit.
[2024-06-02 02:35:50] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Running 39 sub problems to find dead transitions.
[2024-06-02 02:35:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 1/38 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 40/78 variables, 38/39 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (OVERLAPS) 0/78 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/78 variables, and 39 constraints, problems are : Problem set: 0 solved, 39 unsolved in 465 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 38/38 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 1/38 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 40/78 variables, 38/39 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 39/78 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 0/78 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/78 variables, and 78 constraints, problems are : Problem set: 0 solved, 39 unsolved in 604 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 38/38 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 0/0 constraints]
After SMT, in 1077ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 1078ms
Starting structural reductions in LTL mode, iteration 1 : 38/59 places, 40/79 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1193 ms. Remains : 38/59 places, 40/79 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A02-LTLFireability-08
Stuttering criterion allowed to conclude after 107 steps with 16 reset in 1 ms.
FORMULA ViralEpidemic-PT-S03D1C1A02-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S03D1C1A02-LTLFireability-08 finished in 1372 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)||G(p1)||F(p2)))'
Support contains 5 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 79/79 transitions.
Graph (complete) has 34 edges and 59 vertex of which 17 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.1 ms
Discarding 42 places :
Also discarding 50 output transitions
Drop transitions (Output transitions of discarded places.) removed 50 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 16 transition count 26
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 14 transition count 21
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 14 transition count 21
Applied a total of 7 rules in 4 ms. Remains 14 /59 variables (removed 45) and now considering 21/79 (removed 58) transitions.
// Phase 1: matrix 21 rows 14 cols
[2024-06-02 02:35:51] [INFO ] Computed 0 invariants in 1 ms
[2024-06-02 02:35:51] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-02 02:35:51] [INFO ] Invariant cache hit.
[2024-06-02 02:35:52] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-06-02 02:35:52] [INFO ] Redundant transitions in 0 ms returned []
Running 15 sub problems to find dead transitions.
[2024-06-02 02:35:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 18/29 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 4/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 2/35 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/35 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 35/35 variables, and 14 constraints, problems are : Problem set: 0 solved, 15 unsolved in 242 ms.
Refiners :[State Equation: 14/14 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/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 18/29 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 15/26 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 4/33 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 2/35 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/35 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 0/35 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 35/35 variables, and 29 constraints, problems are : Problem set: 0 solved, 15 unsolved in 235 ms.
Refiners :[State Equation: 14/14 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 481ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 481ms
Starting structural reductions in SI_LTL mode, iteration 1 : 14/59 places, 21/79 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 554 ms. Remains : 14/59 places, 21/79 transitions.
Stuttering acceptance computed with spot in 171 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A02-LTLFireability-10
Stuttering criterion allowed to conclude after 31 steps with 3 reset in 1 ms.
FORMULA ViralEpidemic-PT-S03D1C1A02-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S03D1C1A02-LTLFireability-10 finished in 744 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((((p0 U p1) U G(!p2)) U p0))))'
Support contains 5 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 79/79 transitions.
Graph (complete) has 34 edges and 59 vertex of which 15 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.0 ms
Discarding 44 places :
Also discarding 55 output transitions
Drop transitions (Output transitions of discarded places.) removed 55 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 12 transition count 18
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 12 transition count 18
Applied a total of 5 rules in 2 ms. Remains 12 /59 variables (removed 47) and now considering 18/79 (removed 61) transitions.
// Phase 1: matrix 18 rows 12 cols
[2024-06-02 02:35:52] [INFO ] Computed 0 invariants in 0 ms
[2024-06-02 02:35:52] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-02 02:35:52] [INFO ] Invariant cache hit.
[2024-06-02 02:35:52] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2024-06-02 02:35:52] [INFO ] Redundant transitions in 14 ms returned [2]
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 13 sub problems to find dead transitions.
// Phase 1: matrix 17 rows 12 cols
[2024-06-02 02:35:52] [INFO ] Computed 0 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 14/23 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 2/25 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 2/27 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 0/27 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 27/29 variables, and 11 constraints, problems are : Problem set: 0 solved, 13 unsolved in 160 ms.
Refiners :[State Equation: 11/12 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 14/23 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 13/22 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 2/25 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 2/27 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 0/27 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 27/29 variables, and 24 constraints, problems are : Problem set: 0 solved, 13 unsolved in 175 ms.
Refiners :[State Equation: 11/12 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 341ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 341ms
Starting structural reductions in SI_LTL mode, iteration 1 : 12/59 places, 17/79 transitions.
Graph (complete) has 5 edges and 12 vertex of which 11 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 1 ms. Remains 11 /12 variables (removed 1) and now considering 16/17 (removed 1) transitions.
// Phase 1: matrix 16 rows 11 cols
[2024-06-02 02:35:53] [INFO ] Computed 0 invariants in 0 ms
[2024-06-02 02:35:53] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-02 02:35:53] [INFO ] Invariant cache hit.
[2024-06-02 02:35:53] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 11/59 places, 16/79 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 482 ms. Remains : 11/59 places, 16/79 transitions.
Stuttering acceptance computed with spot in 299 ms :[(NOT p0), (AND (NOT p0) p2), (NOT p0), (AND (NOT p0) p2), (AND (NOT p0) p2 p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A02-LTLFireability-11
Stuttering criterion allowed to conclude after 18 steps with 4 reset in 1 ms.
FORMULA ViralEpidemic-PT-S03D1C1A02-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S03D1C1A02-LTLFireability-11 finished in 807 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!G(F(!p0))) U (X((X(p1)||p0)) U p2)))'
Support contains 6 out of 59 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 59/59 places, 79/79 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 40 transition count 43
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 40 transition count 43
Applied a total of 38 rules in 2 ms. Remains 40 /59 variables (removed 19) and now considering 43/79 (removed 36) transitions.
// Phase 1: matrix 43 rows 40 cols
[2024-06-02 02:35:53] [INFO ] Computed 1 invariants in 4 ms
[2024-06-02 02:35:53] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-06-02 02:35:53] [INFO ] Invariant cache hit.
[2024-06-02 02:35:53] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Running 42 sub problems to find dead transitions.
[2024-06-02 02:35:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 1/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 43/83 variables, 40/41 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (OVERLAPS) 0/83 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 83/83 variables, and 41 constraints, problems are : Problem set: 0 solved, 42 unsolved in 581 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 1/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 43/83 variables, 40/41 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 42/83 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (OVERLAPS) 0/83 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 83/83 variables, and 83 constraints, problems are : Problem set: 0 solved, 42 unsolved in 629 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
After SMT, in 1218ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 1219ms
Starting structural reductions in LTL mode, iteration 1 : 40/59 places, 43/79 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1324 ms. Remains : 40/59 places, 43/79 transitions.
Stuttering acceptance computed with spot in 171 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A02-LTLFireability-13
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 0 ms.
FORMULA ViralEpidemic-PT-S03D1C1A02-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S03D1C1A02-LTLFireability-13 finished in 1521 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||(G(!p1) U (p2 U p3))))'
Support contains 8 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 79/79 transitions.
Graph (complete) has 34 edges and 59 vertex of which 29 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 35 output transitions
Drop transitions (Output transitions of discarded places.) removed 35 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 23 transition count 31
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 23 transition count 31
Applied a total of 11 rules in 5 ms. Remains 23 /59 variables (removed 36) and now considering 31/79 (removed 48) transitions.
// Phase 1: matrix 31 rows 23 cols
[2024-06-02 02:35:55] [INFO ] Computed 0 invariants in 1 ms
[2024-06-02 02:35:55] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-02 02:35:55] [INFO ] Invariant cache hit.
[2024-06-02 02:35:55] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2024-06-02 02:35:55] [INFO ] Redundant transitions in 13 ms returned [6]
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 24 sub problems to find dead transitions.
// Phase 1: matrix 30 rows 23 cols
[2024-06-02 02:35:55] [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, 24 unsolved
At refinement iteration 1 (OVERLAPS) 27/47 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 4/51 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 2/53 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 0/53 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 53/53 variables, and 23 constraints, problems are : Problem set: 0 solved, 24 unsolved in 346 ms.
Refiners :[State Equation: 23/23 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 27/47 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 24/44 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 4/51 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 2/53 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 0/53 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 53/53 variables, and 47 constraints, problems are : Problem set: 0 solved, 24 unsolved in 421 ms.
Refiners :[State Equation: 23/23 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
After SMT, in 772ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 773ms
Starting structural reductions in SI_LTL mode, iteration 1 : 23/59 places, 30/79 transitions.
Graph (complete) has 11 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 29/30 (removed 1) transitions.
// Phase 1: matrix 29 rows 22 cols
[2024-06-02 02:35:55] [INFO ] Computed 0 invariants in 0 ms
[2024-06-02 02:35:55] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-02 02:35:55] [INFO ] Invariant cache hit.
[2024-06-02 02:35:55] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 22/59 places, 29/79 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 944 ms. Remains : 22/59 places, 29/79 transitions.
Stuttering acceptance computed with spot in 253 ms :[(AND (NOT p0) (NOT p3)), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A02-LTLFireability-14
Stuttering criterion allowed to conclude after 68 steps with 12 reset in 0 ms.
FORMULA ViralEpidemic-PT-S03D1C1A02-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S03D1C1A02-LTLFireability-14 finished in 1215 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||F(p1))&&(F(p1)||(!p3 U (p4||G(!p3)))||p2)))))'
Support contains 6 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 79/79 transitions.
Graph (complete) has 34 edges and 59 vertex of which 30 are kept as prefixes of interest. Removing 29 places using SCC suffix rule.0 ms
Discarding 29 places :
Also discarding 34 output transitions
Drop transitions (Output transitions of discarded places.) removed 34 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 23 transition count 29
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 23 transition count 29
Applied a total of 13 rules in 3 ms. Remains 23 /59 variables (removed 36) and now considering 29/79 (removed 50) transitions.
// Phase 1: matrix 29 rows 23 cols
[2024-06-02 02:35:56] [INFO ] Computed 0 invariants in 1 ms
[2024-06-02 02:35:56] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-06-02 02:35:56] [INFO ] Invariant cache hit.
[2024-06-02 02:35:56] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2024-06-02 02:35:56] [INFO ] Redundant transitions in 13 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 21 sub problems to find dead transitions.
// Phase 1: matrix 28 rows 23 cols
[2024-06-02 02:35:56] [INFO ] Computed 0 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 24/43 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 4/47 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 2/49 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 2/51 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/51 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (OVERLAPS) 0/51 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/51 variables, and 23 constraints, problems are : Problem set: 0 solved, 21 unsolved in 430 ms.
Refiners :[State Equation: 23/23 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 24/43 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 21/40 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (OVERLAPS) 4/47 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 2/49 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/49 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 2/51 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/51 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (OVERLAPS) 0/51 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/51 variables, and 44 constraints, problems are : Problem set: 0 solved, 21 unsolved in 410 ms.
Refiners :[State Equation: 23/23 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
After SMT, in 846ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 847ms
Starting structural reductions in SI_LTL mode, iteration 1 : 23/59 places, 28/79 transitions.
Graph (complete) has 11 edges and 23 vertex of which 22 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 1 ms. Remains 22 /23 variables (removed 1) and now considering 27/28 (removed 1) transitions.
// Phase 1: matrix 27 rows 22 cols
[2024-06-02 02:35:57] [INFO ] Computed 0 invariants in 0 ms
[2024-06-02 02:35:57] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-02 02:35:57] [INFO ] Invariant cache hit.
[2024-06-02 02:35:57] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 22/59 places, 27/79 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1018 ms. Remains : 22/59 places, 27/79 transitions.
Stuttering acceptance computed with spot in 172 ms :[(OR (AND (NOT p1) (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1) p3 (NOT p4)) (AND (NOT p1) (NOT p2) p3 (NOT p4)))]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A02-LTLFireability-15
Product exploration explored 100000 steps with 10874 reset in 399 ms.
Product exploration explored 100000 steps with 10807 reset in 303 ms.
Computed a total of 22 stabilizing places and 27 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 27
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1 p2 p4 (NOT p3)), (X (NOT (OR (AND p0 (NOT p1) p2) (AND p0 (NOT p1) p4) (AND p0 (NOT p1) (NOT p3))))), (X p2), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2) (NOT p4) p3)))), (X (NOT p3)), (X p4), (X (NOT (AND p0 (NOT p1) p2 (NOT p4) p3))), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p4) p3) (AND (NOT p1) (NOT p2) (NOT p4) p3)))), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p4) (NOT p3)))), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p4) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p4) (NOT p3))))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1) p2 (NOT p4) (NOT p3)))), (X p1), (X (X (NOT (OR (AND p0 (NOT p1) p2) (AND p0 (NOT p1) p4) (AND p0 (NOT p1) (NOT p3)))))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p4) p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p4) (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p4) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p4) (NOT p3)))))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p4) (NOT p3))))), (F (G (NOT p0))), (F (G p1)), (F (G p2)), (F (G p4)), (F (G (NOT p3)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2) (NOT p4) p3)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2) (NOT p4) p3))))), (X (X p3)), (X (X (NOT p3))), (X (X p4)), (X (X (NOT p4))), (X (X (OR (AND (NOT p0) (NOT p1) (NOT p4) p3) (AND (NOT p1) (NOT p2) (NOT p4) p3)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p4) p3) (AND (NOT p1) (NOT p2) (NOT p4) p3))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 23 factoid took 23 ms. Reduced automaton from 3 states, 10 edges and 5 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S03D1C1A02-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S03D1C1A02-LTLFireability-15 finished in 1983 ms.
All properties solved by simple procedures.
Total runtime 24363 ms.
ITS solved all properties within timeout

BK_STOP 1717295758591

--------------------
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-S03D1C1A02"
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-S03D1C1A02, 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-171701111300316"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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