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.r356-tall-171683762301011.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 itstools
Input is ShieldRVt-PT-040A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683762301011
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 9.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 115K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K 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.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 23:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Apr 11 23:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 11 22:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 11 22:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 109K 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 ShieldRVt-PT-040A-LTLCardinality-00
FORMULA_NAME ShieldRVt-PT-040A-LTLCardinality-01
FORMULA_NAME ShieldRVt-PT-040A-LTLCardinality-02
FORMULA_NAME ShieldRVt-PT-040A-LTLCardinality-03
FORMULA_NAME ShieldRVt-PT-040A-LTLCardinality-04
FORMULA_NAME ShieldRVt-PT-040A-LTLCardinality-05
FORMULA_NAME ShieldRVt-PT-040A-LTLCardinality-06
FORMULA_NAME ShieldRVt-PT-040A-LTLCardinality-07
FORMULA_NAME ShieldRVt-PT-040A-LTLCardinality-08
FORMULA_NAME ShieldRVt-PT-040A-LTLCardinality-09
FORMULA_NAME ShieldRVt-PT-040A-LTLCardinality-10
FORMULA_NAME ShieldRVt-PT-040A-LTLCardinality-11
FORMULA_NAME ShieldRVt-PT-040A-LTLCardinality-12
FORMULA_NAME ShieldRVt-PT-040A-LTLCardinality-13
FORMULA_NAME ShieldRVt-PT-040A-LTLCardinality-14
FORMULA_NAME ShieldRVt-PT-040A-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717084405176

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-040A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-30 15:53:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 15:53:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 15:53:26] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2024-05-30 15:53:26] [INFO ] Transformed 323 places.
[2024-05-30 15:53:26] [INFO ] Transformed 323 transitions.
[2024-05-30 15:53:26] [INFO ] Found NUPN structural information;
[2024-05-30 15:53:26] [INFO ] Parsed PT model containing 323 places and 323 transitions and 1366 arcs in 205 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldRVt-PT-040A-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040A-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040A-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040A-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040A-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040A-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040A-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 40 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
// Phase 1: matrix 322 rows 323 cols
[2024-05-30 15:53:26] [INFO ] Computed 161 invariants in 21 ms
[2024-05-30 15:53:27] [INFO ] Implicit Places using invariants in 358 ms returned []
[2024-05-30 15:53:27] [INFO ] Invariant cache hit.
[2024-05-30 15:53:27] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 679 ms to find 0 implicit places.
Running 321 sub problems to find dead transitions.
[2024-05-30 15:53:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 322/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/323 variables, 161/483 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (OVERLAPS) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Real declared 645/645 variables, and 807 constraints, problems are : Problem set: 0 solved, 321 unsolved in 14857 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 321 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 322/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/323 variables, 161/483 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 321/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/645 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 8 (OVERLAPS) 0/645 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Int declared 645/645 variables, and 1128 constraints, problems are : Problem set: 0 solved, 321 unsolved in 16457 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
After SMT, in 31447ms problems are : Problem set: 0 solved, 321 unsolved
Search for dead transitions found 0 dead transitions in 31467ms
Finished structural reductions in LTL mode , in 1 iterations and 32217 ms. Remains : 323/323 places, 322/322 transitions.
Support contains 33 out of 323 places after structural reductions.
[2024-05-30 15:53:59] [INFO ] Flatten gal took : 65 ms
[2024-05-30 15:53:59] [INFO ] Flatten gal took : 29 ms
[2024-05-30 15:53:59] [INFO ] Input system was already deterministic with 322 transitions.
RANDOM walk for 40000 steps (8 resets) in 2439 ms. (16 steps per ms) remains 12/19 properties
BEST_FIRST walk for 40003 steps (8 resets) in 364 ms. (109 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 338 ms. (118 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 255 ms. (156 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 202 ms. (197 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 198 ms. (201 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 247 ms. (161 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 209 ms. (190 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 110 ms. (360 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 121 ms. (327 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 11/11 properties
[2024-05-30 15:54:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem AtomicPropp11 is UNSAT
At refinement iteration 2 (OVERLAPS) 19/39 variables, 19/39 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 19/58 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 284/323 variables, 142/200 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 284/484 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/645 variables, 0/807 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 0/645 variables, 0/807 constraints. Problems are: Problem set: 1 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 645/645 variables, and 807 constraints, problems are : Problem set: 1 solved, 10 unsolved in 667 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 18/18 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 19/37 variables, 18/36 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 19/55 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/55 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 286/323 variables, 143/198 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 286/484 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/645 variables, 10/817 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/645 variables, 0/817 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 0/645 variables, 0/817 constraints. Problems are: Problem set: 1 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 645/645 variables, and 817 constraints, problems are : Problem set: 1 solved, 10 unsolved in 649 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 10/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 1337ms problems are : Problem set: 1 solved, 10 unsolved
Finished Parikh walk after 42070 steps, including 808 resets, run visited all 1 properties in 196 ms. (steps per millisecond=214 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 10 properties in 2003 ms.
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 322 transition count 321
Applied a total of 2 rules in 43 ms. Remains 322 /323 variables (removed 1) and now considering 321/322 (removed 1) transitions.
// Phase 1: matrix 321 rows 322 cols
[2024-05-30 15:54:04] [INFO ] Computed 161 invariants in 2 ms
[2024-05-30 15:54:04] [INFO ] Implicit Places using invariants in 148 ms returned [315]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 152 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 321/323 places, 321/322 transitions.
Applied a total of 0 rules in 18 ms. Remains 321 /321 variables (removed 0) and now considering 321/321 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 214 ms. Remains : 321/323 places, 321/322 transitions.
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040A-LTLCardinality-02
Product exploration explored 100000 steps with 2 reset in 493 ms.
Product exploration explored 100000 steps with 2 reset in 519 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 372 ms. (107 steps per ms) remains 1/1 properties
BEST_FIRST walk for 30901 steps (6 resets) in 149 ms. (206 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 places, 321/321 transitions.
Applied a total of 0 rules in 22 ms. Remains 321 /321 variables (removed 0) and now considering 321/321 (removed 0) transitions.
// Phase 1: matrix 321 rows 321 cols
[2024-05-30 15:54:06] [INFO ] Computed 160 invariants in 6 ms
[2024-05-30 15:54:06] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-30 15:54:06] [INFO ] Invariant cache hit.
[2024-05-30 15:54:06] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
[2024-05-30 15:54:06] [INFO ] Redundant transitions in 15 ms returned []
Running 320 sub problems to find dead transitions.
[2024-05-30 15:54:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/320 variables, 320/320 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/320 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (OVERLAPS) 1/321 variables, 160/480 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/321 variables, 1/481 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (OVERLAPS) 321/642 variables, 321/802 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 7 (OVERLAPS) 0/642 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 320 unsolved
No progress, stopping.
After SMT solving in domain Real declared 642/642 variables, and 802 constraints, problems are : Problem set: 0 solved, 320 unsolved in 14048 ms.
Refiners :[Domain max(s): 321/321 constraints, Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 321/321 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 320 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/320 variables, 320/320 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/320 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (OVERLAPS) 1/321 variables, 160/480 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/321 variables, 1/481 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (OVERLAPS) 321/642 variables, 321/802 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 320/1122 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/642 variables, 0/1122 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 8 (OVERLAPS) 0/642 variables, 0/1122 constraints. Problems are: Problem set: 0 solved, 320 unsolved
No progress, stopping.
After SMT solving in domain Int declared 642/642 variables, and 1122 constraints, problems are : Problem set: 0 solved, 320 unsolved in 15433 ms.
Refiners :[Domain max(s): 321/321 constraints, Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 321/321 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 0/0 constraints]
After SMT, in 29553ms problems are : Problem set: 0 solved, 320 unsolved
Search for dead transitions found 0 dead transitions in 29557ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 30025 ms. Remains : 321/321 places, 321/321 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 263 ms. (151 steps per ms) remains 1/1 properties
BEST_FIRST walk for 38696 steps (8 resets) in 173 ms. (222 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1 reset in 399 ms.
Product exploration explored 100000 steps with 1 reset in 469 ms.
Built C files in :
/tmp/ltsmin2098861037726321603
[2024-05-30 15:54:38] [INFO ] Computing symmetric may disable matrix : 321 transitions.
[2024-05-30 15:54:38] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 15:54:38] [INFO ] Computing symmetric may enable matrix : 321 transitions.
[2024-05-30 15:54:38] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 15:54:38] [INFO ] Computing Do-Not-Accords matrix : 321 transitions.
[2024-05-30 15:54:38] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 15:54:38] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2098861037726321603
Running compilation step : cd /tmp/ltsmin2098861037726321603;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 885 ms.
Running link step : cd /tmp/ltsmin2098861037726321603;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin2098861037726321603;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4665311948278761587.hoa' '--buchi-type=spotba'
LTSmin run took 1493 ms.
FORMULA ShieldRVt-PT-040A-LTLCardinality-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVt-PT-040A-LTLCardinality-02 finished in 36173 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U X(G(p0))))'
Support contains 2 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 320 transition count 320
Applied a total of 3 rules in 24 ms. Remains 320 /323 variables (removed 3) and now considering 320/322 (removed 2) transitions.
// Phase 1: matrix 320 rows 320 cols
[2024-05-30 15:54:40] [INFO ] Computed 160 invariants in 3 ms
[2024-05-30 15:54:40] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-30 15:54:40] [INFO ] Invariant cache hit.
[2024-05-30 15:54:40] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
[2024-05-30 15:54:40] [INFO ] Redundant transitions in 9 ms returned []
Running 319 sub problems to find dead transitions.
[2024-05-30 15:54:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/320 variables, 320/320 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/320 variables, 160/480 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 3 (OVERLAPS) 320/640 variables, 320/800 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/640 variables, 0/800 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 5 (OVERLAPS) 0/640 variables, 0/800 constraints. Problems are: Problem set: 0 solved, 319 unsolved
No progress, stopping.
After SMT solving in domain Real declared 640/640 variables, and 800 constraints, problems are : Problem set: 0 solved, 319 unsolved in 11018 ms.
Refiners :[Domain max(s): 320/320 constraints, Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 319/319 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 319 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/320 variables, 320/320 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/320 variables, 160/480 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 3 (OVERLAPS) 320/640 variables, 320/800 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/640 variables, 319/1119 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/640 variables, 0/1119 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 6 (OVERLAPS) 0/640 variables, 0/1119 constraints. Problems are: Problem set: 0 solved, 319 unsolved
No progress, stopping.
After SMT solving in domain Int declared 640/640 variables, and 1119 constraints, problems are : Problem set: 0 solved, 319 unsolved in 13097 ms.
Refiners :[Domain max(s): 320/320 constraints, Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 319/319 constraints, Known Traps: 0/0 constraints]
After SMT, in 24169ms problems are : Problem set: 0 solved, 319 unsolved
Search for dead transitions found 0 dead transitions in 24172ms
Starting structural reductions in SI_LTL mode, iteration 1 : 320/323 places, 320/322 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 24614 ms. Remains : 320/323 places, 320/322 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), true, (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040A-LTLCardinality-03
Product exploration explored 100000 steps with 0 reset in 397 ms.
Product exploration explored 100000 steps with 0 reset in 490 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 202 ms. (197 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1809 steps, run visited all 1 properties in 20 ms. (steps per millisecond=90 )
Probabilistic random walk after 1809 steps, saw 1717 distinct states, run finished after 24 ms. (steps per millisecond=75 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-040A-LTLCardinality-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-040A-LTLCardinality-03 finished in 26016 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 2 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 7 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
// Phase 1: matrix 322 rows 323 cols
[2024-05-30 15:55:06] [INFO ] Computed 161 invariants in 2 ms
[2024-05-30 15:55:06] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-30 15:55:06] [INFO ] Invariant cache hit.
[2024-05-30 15:55:06] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
Running 321 sub problems to find dead transitions.
[2024-05-30 15:55:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 322/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/323 variables, 161/483 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (OVERLAPS) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Real declared 645/645 variables, and 807 constraints, problems are : Problem set: 0 solved, 321 unsolved in 14249 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 321 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 322/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/323 variables, 161/483 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 321/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/645 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 8 (OVERLAPS) 0/645 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Int declared 645/645 variables, and 1128 constraints, problems are : Problem set: 0 solved, 321 unsolved in 16404 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
After SMT, in 30714ms problems are : Problem set: 0 solved, 321 unsolved
Search for dead transitions found 0 dead transitions in 30717ms
Finished structural reductions in LTL mode , in 1 iterations and 31125 ms. Remains : 323/323 places, 322/322 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040A-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-040A-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040A-LTLCardinality-05 finished in 31276 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((X(p1)||p0))||G(p2))))'
Support contains 5 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 7 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
[2024-05-30 15:55:37] [INFO ] Invariant cache hit.
[2024-05-30 15:55:37] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-05-30 15:55:37] [INFO ] Invariant cache hit.
[2024-05-30 15:55:38] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 412 ms to find 0 implicit places.
Running 321 sub problems to find dead transitions.
[2024-05-30 15:55:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 322/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/323 variables, 161/483 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (OVERLAPS) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Real declared 645/645 variables, and 807 constraints, problems are : Problem set: 0 solved, 321 unsolved in 14550 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 321 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 322/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/323 variables, 161/483 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 321/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/645 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 8 (OVERLAPS) 0/645 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Int declared 645/645 variables, and 1128 constraints, problems are : Problem set: 0 solved, 321 unsolved in 16220 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
After SMT, in 30838ms problems are : Problem set: 0 solved, 321 unsolved
Search for dead transitions found 0 dead transitions in 30842ms
Finished structural reductions in LTL mode , in 1 iterations and 31262 ms. Remains : 323/323 places, 322/322 transitions.
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVt-PT-040A-LTLCardinality-07
Product exploration explored 100000 steps with 50000 reset in 893 ms.
Product exploration explored 100000 steps with 50000 reset in 932 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p2), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 18 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-040A-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-040A-LTLCardinality-07 finished in 33286 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) U p1))'
Support contains 2 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 320 transition count 320
Applied a total of 3 rules in 17 ms. Remains 320 /323 variables (removed 3) and now considering 320/322 (removed 2) transitions.
// Phase 1: matrix 320 rows 320 cols
[2024-05-30 15:56:11] [INFO ] Computed 160 invariants in 3 ms
[2024-05-30 15:56:11] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-30 15:56:11] [INFO ] Invariant cache hit.
[2024-05-30 15:56:11] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
[2024-05-30 15:56:11] [INFO ] Redundant transitions in 3 ms returned []
Running 319 sub problems to find dead transitions.
[2024-05-30 15:56:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/320 variables, 320/320 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/320 variables, 160/480 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 3 (OVERLAPS) 320/640 variables, 320/800 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/640 variables, 0/800 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 5 (OVERLAPS) 0/640 variables, 0/800 constraints. Problems are: Problem set: 0 solved, 319 unsolved
No progress, stopping.
After SMT solving in domain Real declared 640/640 variables, and 800 constraints, problems are : Problem set: 0 solved, 319 unsolved in 11373 ms.
Refiners :[Domain max(s): 320/320 constraints, Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 319/319 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 319 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/320 variables, 320/320 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/320 variables, 160/480 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 3 (OVERLAPS) 320/640 variables, 320/800 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/640 variables, 319/1119 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/640 variables, 0/1119 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 6 (OVERLAPS) 0/640 variables, 0/1119 constraints. Problems are: Problem set: 0 solved, 319 unsolved
No progress, stopping.
After SMT solving in domain Int declared 640/640 variables, and 1119 constraints, problems are : Problem set: 0 solved, 319 unsolved in 13089 ms.
Refiners :[Domain max(s): 320/320 constraints, Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 319/319 constraints, Known Traps: 0/0 constraints]
After SMT, in 24509ms problems are : Problem set: 0 solved, 319 unsolved
Search for dead transitions found 0 dead transitions in 24512ms
Starting structural reductions in SI_LTL mode, iteration 1 : 320/323 places, 320/322 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 24927 ms. Remains : 320/323 places, 320/322 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040A-LTLCardinality-09
Product exploration explored 100000 steps with 0 reset in 389 ms.
Stack based approach found an accepted trace after 32 steps with 0 reset with depth 33 and stack size 33 in 0 ms.
FORMULA ShieldRVt-PT-040A-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-040A-LTLCardinality-09 finished in 25413 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 U p1)))'
Support contains 4 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 322 transition count 321
Applied a total of 2 rules in 13 ms. Remains 322 /323 variables (removed 1) and now considering 321/322 (removed 1) transitions.
// Phase 1: matrix 321 rows 322 cols
[2024-05-30 15:56:36] [INFO ] Computed 161 invariants in 2 ms
[2024-05-30 15:56:36] [INFO ] Implicit Places using invariants in 222 ms returned [315]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 236 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 321/323 places, 321/322 transitions.
Applied a total of 0 rules in 8 ms. Remains 321 /321 variables (removed 0) and now considering 321/321 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 260 ms. Remains : 321/323 places, 321/322 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-040A-LTLCardinality-10
Product exploration explored 100000 steps with 0 reset in 410 ms.
Product exploration explored 100000 steps with 0 reset in 491 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X (OR p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 119 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), true, (NOT p1)]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (8 resets) in 473 ms. (84 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 287 ms. (138 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 143 ms. (277 steps per ms) remains 3/3 properties
// Phase 1: matrix 321 rows 321 cols
[2024-05-30 15:56:38] [INFO ] Computed 160 invariants in 2 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 5/9 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 312/321 variables, 156/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 312/481 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 321/642 variables, 321/802 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/642 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/642 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 642/642 variables, and 802 constraints, problems are : Problem set: 0 solved, 3 unsolved in 232 ms.
Refiners :[Domain max(s): 321/321 constraints, Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 321/321 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 5/9 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 312/321 variables, 156/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 312/481 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 321/642 variables, 321/802 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/642 variables, 3/805 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/642 variables, 0/805 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/642 variables, 0/805 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 642/642 variables, and 805 constraints, problems are : Problem set: 0 solved, 3 unsolved in 319 ms.
Refiners :[Domain max(s): 321/321 constraints, Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 321/321 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 561ms problems are : Problem set: 0 solved, 3 unsolved
Finished Parikh walk after 24645 steps, including 799 resets, run visited all 3 properties in 518 ms. (steps per millisecond=47 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 518 ms.
Knowledge obtained : [(AND p1 p0), (X (OR p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1)))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p0 p1)))
Knowledge based reduction with 11 factoid took 257 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-040A-LTLCardinality-10 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-040A-LTLCardinality-10 finished in 3147 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 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 322 transition count 321
Applied a total of 2 rules in 20 ms. Remains 322 /323 variables (removed 1) and now considering 321/322 (removed 1) transitions.
// Phase 1: matrix 321 rows 322 cols
[2024-05-30 15:56:39] [INFO ] Computed 161 invariants in 3 ms
[2024-05-30 15:56:39] [INFO ] Implicit Places using invariants in 154 ms returned [315]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 155 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 321/323 places, 321/322 transitions.
Applied a total of 0 rules in 8 ms. Remains 321 /321 variables (removed 0) and now considering 321/321 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 184 ms. Remains : 321/323 places, 321/322 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040A-LTLCardinality-11
Product exploration explored 100000 steps with 0 reset in 391 ms.
Product exploration explored 100000 steps with 0 reset in 468 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 188 ms. (211 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4403 steps, run visited all 1 properties in 38 ms. (steps per millisecond=115 )
Probabilistic random walk after 4403 steps, saw 4255 distinct states, run finished after 39 ms. (steps per millisecond=112 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Support contains 2 out of 321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 places, 321/321 transitions.
Applied a total of 0 rules in 20 ms. Remains 321 /321 variables (removed 0) and now considering 321/321 (removed 0) transitions.
// Phase 1: matrix 321 rows 321 cols
[2024-05-30 15:56:41] [INFO ] Computed 160 invariants in 3 ms
[2024-05-30 15:56:41] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-30 15:56:41] [INFO ] Invariant cache hit.
[2024-05-30 15:56:41] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
[2024-05-30 15:56:41] [INFO ] Redundant transitions in 4 ms returned []
Running 320 sub problems to find dead transitions.
[2024-05-30 15:56:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/320 variables, 320/320 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/320 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (OVERLAPS) 1/321 variables, 160/480 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/321 variables, 1/481 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (OVERLAPS) 321/642 variables, 321/802 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 7 (OVERLAPS) 0/642 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 320 unsolved
No progress, stopping.
After SMT solving in domain Real declared 642/642 variables, and 802 constraints, problems are : Problem set: 0 solved, 320 unsolved in 14197 ms.
Refiners :[Domain max(s): 321/321 constraints, Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 321/321 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 320 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/320 variables, 320/320 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/320 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (OVERLAPS) 1/321 variables, 160/480 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/321 variables, 1/481 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (OVERLAPS) 321/642 variables, 321/802 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 320/1122 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/642 variables, 0/1122 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 8 (OVERLAPS) 0/642 variables, 0/1122 constraints. Problems are: Problem set: 0 solved, 320 unsolved
No progress, stopping.
After SMT solving in domain Int declared 642/642 variables, and 1122 constraints, problems are : Problem set: 0 solved, 320 unsolved in 15459 ms.
Refiners :[Domain max(s): 321/321 constraints, Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 321/321 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 0/0 constraints]
After SMT, in 29708ms problems are : Problem set: 0 solved, 320 unsolved
Search for dead transitions found 0 dead transitions in 29713ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 30188 ms. Remains : 321/321 places, 321/321 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 175 ms. (227 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4403 steps, run visited all 1 properties in 28 ms. (steps per millisecond=157 )
Probabilistic random walk after 4403 steps, saw 4255 distinct states, run finished after 29 ms. (steps per millisecond=151 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 423 ms.
Product exploration explored 100000 steps with 0 reset in 488 ms.
Built C files in :
/tmp/ltsmin1986214406429172127
[2024-05-30 15:57:12] [INFO ] Computing symmetric may disable matrix : 321 transitions.
[2024-05-30 15:57:12] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 15:57:12] [INFO ] Computing symmetric may enable matrix : 321 transitions.
[2024-05-30 15:57:12] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 15:57:12] [INFO ] Computing Do-Not-Accords matrix : 321 transitions.
[2024-05-30 15:57:12] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 15:57:12] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1986214406429172127
Running compilation step : cd /tmp/ltsmin1986214406429172127;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 736 ms.
Running link step : cd /tmp/ltsmin1986214406429172127;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin1986214406429172127;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5896492804662974899.hoa' '--buchi-type=spotba'
LTSmin run took 1847 ms.
FORMULA ShieldRVt-PT-040A-LTLCardinality-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVt-PT-040A-LTLCardinality-11 finished in 35794 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&&X(X(G(p1))))))'
Support contains 3 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 3 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
// Phase 1: matrix 322 rows 323 cols
[2024-05-30 15:57:15] [INFO ] Computed 161 invariants in 2 ms
[2024-05-30 15:57:15] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-30 15:57:15] [INFO ] Invariant cache hit.
[2024-05-30 15:57:15] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
Running 321 sub problems to find dead transitions.
[2024-05-30 15:57:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 322/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/323 variables, 161/483 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (OVERLAPS) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Real declared 645/645 variables, and 807 constraints, problems are : Problem set: 0 solved, 321 unsolved in 14202 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 321 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 322/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/323 variables, 161/483 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 321/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/645 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 8 (OVERLAPS) 0/645 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Int declared 645/645 variables, and 1128 constraints, problems are : Problem set: 0 solved, 321 unsolved in 16455 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
After SMT, in 30712ms problems are : Problem set: 0 solved, 321 unsolved
Search for dead transitions found 0 dead transitions in 30717ms
Finished structural reductions in LTL mode , in 1 iterations and 31121 ms. Remains : 323/323 places, 322/322 transitions.
Stuttering acceptance computed with spot in 202 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-040A-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-040A-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040A-LTLCardinality-14 finished in 31347 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(((p1 U p2)&&p0)))'
Support contains 5 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 4 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
[2024-05-30 15:57:46] [INFO ] Invariant cache hit.
[2024-05-30 15:57:46] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-30 15:57:46] [INFO ] Invariant cache hit.
[2024-05-30 15:57:47] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
Running 321 sub problems to find dead transitions.
[2024-05-30 15:57:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 322/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/323 variables, 161/483 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (OVERLAPS) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Real declared 645/645 variables, and 807 constraints, problems are : Problem set: 0 solved, 321 unsolved in 14431 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 321 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 322/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/323 variables, 161/483 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 321/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/645 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 8 (OVERLAPS) 0/645 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Int declared 645/645 variables, and 1128 constraints, problems are : Problem set: 0 solved, 321 unsolved in 16285 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
After SMT, in 30768ms problems are : Problem set: 0 solved, 321 unsolved
Search for dead transitions found 0 dead transitions in 30772ms
Finished structural reductions in LTL mode , in 1 iterations and 31161 ms. Remains : 323/323 places, 322/322 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p2), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true]
Running random walk in product with property : ShieldRVt-PT-040A-LTLCardinality-15
Product exploration explored 100000 steps with 50000 reset in 887 ms.
Product exploration explored 100000 steps with 50000 reset in 923 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X p2), (X (NOT (OR (NOT p0) (AND (NOT p2) (NOT p1))))), (X (NOT (AND p0 (NOT p2) p1))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 20 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-040A-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-040A-LTLCardinality-15 finished in 33161 ms.
All properties solved by simple procedures.
Total runtime 293671 ms.

BK_STOP 1717084699985

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="ShieldRVt-PT-040A"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is ShieldRVt-PT-040A, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r356-tall-171683762301011"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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