Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r391-oct2-167903715100283.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is ShieldIIPt-PT-020B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r391-oct2-167903715100283
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 724K
-rw-r--r-- 1 mcc users 7.9K Feb 25 17:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 17:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 17:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 17:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 25 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 17:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 17:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 338K Mar 5 18:23 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 ShieldIIPt-PT-020B-LTLCardinality-00
FORMULA_NAME ShieldIIPt-PT-020B-LTLCardinality-01
FORMULA_NAME ShieldIIPt-PT-020B-LTLCardinality-02
FORMULA_NAME ShieldIIPt-PT-020B-LTLCardinality-03
FORMULA_NAME ShieldIIPt-PT-020B-LTLCardinality-04
FORMULA_NAME ShieldIIPt-PT-020B-LTLCardinality-05
FORMULA_NAME ShieldIIPt-PT-020B-LTLCardinality-06
FORMULA_NAME ShieldIIPt-PT-020B-LTLCardinality-07
FORMULA_NAME ShieldIIPt-PT-020B-LTLCardinality-08
FORMULA_NAME ShieldIIPt-PT-020B-LTLCardinality-09
FORMULA_NAME ShieldIIPt-PT-020B-LTLCardinality-10
FORMULA_NAME ShieldIIPt-PT-020B-LTLCardinality-11
FORMULA_NAME ShieldIIPt-PT-020B-LTLCardinality-12
FORMULA_NAME ShieldIIPt-PT-020B-LTLCardinality-13
FORMULA_NAME ShieldIIPt-PT-020B-LTLCardinality-14
FORMULA_NAME ShieldIIPt-PT-020B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679271366632

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-020B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 00:16:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 00:16:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 00:16:09] [INFO ] Load time of PNML (sax parser for PT used): 130 ms
[2023-03-20 00:16:09] [INFO ] Transformed 1403 places.
[2023-03-20 00:16:09] [INFO ] Transformed 1303 transitions.
[2023-03-20 00:16:09] [INFO ] Found NUPN structural information;
[2023-03-20 00:16:09] [INFO ] Parsed PT model containing 1403 places and 1303 transitions and 3246 arcs in 257 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldIIPt-PT-020B-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020B-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020B-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020B-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020B-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020B-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020B-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020B-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 1403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1403/1403 places, 1303/1303 transitions.
Discarding 212 places :
Symmetric choice reduction at 0 with 212 rule applications. Total rules 212 place count 1191 transition count 1091
Iterating global reduction 0 with 212 rules applied. Total rules applied 424 place count 1191 transition count 1091
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 425 place count 1190 transition count 1090
Iterating global reduction 0 with 1 rules applied. Total rules applied 426 place count 1190 transition count 1090
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 427 place count 1189 transition count 1089
Iterating global reduction 0 with 1 rules applied. Total rules applied 428 place count 1189 transition count 1089
Applied a total of 428 rules in 535 ms. Remains 1189 /1403 variables (removed 214) and now considering 1089/1303 (removed 214) transitions.
// Phase 1: matrix 1089 rows 1189 cols
[2023-03-20 00:16:09] [INFO ] Computed 181 place invariants in 17 ms
[2023-03-20 00:16:10] [INFO ] Implicit Places using invariants in 710 ms returned []
[2023-03-20 00:16:10] [INFO ] Invariant cache hit.
[2023-03-20 00:16:12] [INFO ] Implicit Places using invariants and state equation in 1743 ms returned []
Implicit Place search using SMT with State Equation took 2498 ms to find 0 implicit places.
[2023-03-20 00:16:12] [INFO ] Invariant cache hit.
[2023-03-20 00:16:13] [INFO ] Dead Transitions using invariants and state equation in 1045 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1189/1403 places, 1089/1303 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4085 ms. Remains : 1189/1403 places, 1089/1303 transitions.
Support contains 28 out of 1189 places after structural reductions.
[2023-03-20 00:16:13] [INFO ] Flatten gal took : 114 ms
[2023-03-20 00:16:13] [INFO ] Flatten gal took : 44 ms
[2023-03-20 00:16:13] [INFO ] Input system was already deterministic with 1089 transitions.
Support contains 26 out of 1189 places (down from 28) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 506 ms. (steps per millisecond=19 ) properties (out of 14) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-20 00:16:14] [INFO ] Invariant cache hit.
[2023-03-20 00:16:14] [INFO ] After 317ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 00:16:15] [INFO ] [Nat]Absence check using 181 positive place invariants in 72 ms returned sat
[2023-03-20 00:16:16] [INFO ] After 1062ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 00:16:17] [INFO ] Deduced a trap composed of 19 places in 577 ms of which 11 ms to minimize.
[2023-03-20 00:16:17] [INFO ] Deduced a trap composed of 20 places in 211 ms of which 1 ms to minimize.
[2023-03-20 00:16:17] [INFO ] Deduced a trap composed of 26 places in 178 ms of which 1 ms to minimize.
[2023-03-20 00:16:17] [INFO ] Deduced a trap composed of 13 places in 262 ms of which 1 ms to minimize.
[2023-03-20 00:16:18] [INFO ] Deduced a trap composed of 23 places in 322 ms of which 14 ms to minimize.
[2023-03-20 00:16:18] [INFO ] Deduced a trap composed of 32 places in 439 ms of which 1 ms to minimize.
[2023-03-20 00:16:18] [INFO ] Deduced a trap composed of 30 places in 295 ms of which 1 ms to minimize.
[2023-03-20 00:16:19] [INFO ] Deduced a trap composed of 20 places in 165 ms of which 1 ms to minimize.
[2023-03-20 00:16:19] [INFO ] Deduced a trap composed of 29 places in 200 ms of which 1 ms to minimize.
[2023-03-20 00:16:19] [INFO ] Deduced a trap composed of 29 places in 228 ms of which 1 ms to minimize.
[2023-03-20 00:16:19] [INFO ] Deduced a trap composed of 16 places in 204 ms of which 0 ms to minimize.
[2023-03-20 00:16:20] [INFO ] Deduced a trap composed of 30 places in 155 ms of which 1 ms to minimize.
[2023-03-20 00:16:20] [INFO ] Deduced a trap composed of 29 places in 160 ms of which 0 ms to minimize.
[2023-03-20 00:16:20] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 0 ms to minimize.
[2023-03-20 00:16:20] [INFO ] Deduced a trap composed of 34 places in 159 ms of which 1 ms to minimize.
[2023-03-20 00:16:20] [INFO ] Deduced a trap composed of 35 places in 177 ms of which 1 ms to minimize.
[2023-03-20 00:16:21] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 1 ms to minimize.
[2023-03-20 00:16:21] [INFO ] Deduced a trap composed of 20 places in 178 ms of which 2 ms to minimize.
[2023-03-20 00:16:21] [INFO ] Deduced a trap composed of 33 places in 169 ms of which 0 ms to minimize.
[2023-03-20 00:16:21] [INFO ] Deduced a trap composed of 33 places in 164 ms of which 1 ms to minimize.
[2023-03-20 00:16:21] [INFO ] Deduced a trap composed of 35 places in 147 ms of which 1 ms to minimize.
[2023-03-20 00:16:22] [INFO ] Deduced a trap composed of 37 places in 151 ms of which 13 ms to minimize.
[2023-03-20 00:16:22] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 5895 ms
[2023-03-20 00:16:22] [INFO ] After 7547ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 430 ms.
[2023-03-20 00:16:23] [INFO ] After 8470ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 130 ms.
Support contains 10 out of 1189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1189/1189 places, 1089/1089 transitions.
Drop transitions removed 235 transitions
Trivial Post-agglo rules discarded 235 transitions
Performed 235 trivial Post agglomeration. Transition count delta: 235
Iterating post reduction 0 with 235 rules applied. Total rules applied 235 place count 1189 transition count 854
Reduce places removed 235 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 236 rules applied. Total rules applied 471 place count 954 transition count 853
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 472 place count 953 transition count 853
Performed 155 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 155 Pre rules applied. Total rules applied 472 place count 953 transition count 698
Deduced a syphon composed of 155 places in 0 ms
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 3 with 310 rules applied. Total rules applied 782 place count 798 transition count 698
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 787 place count 793 transition count 693
Iterating global reduction 3 with 5 rules applied. Total rules applied 792 place count 793 transition count 693
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 792 place count 793 transition count 689
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 800 place count 789 transition count 689
Performed 338 Post agglomeration using F-continuation condition.Transition count delta: 338
Deduced a syphon composed of 338 places in 1 ms
Reduce places removed 338 places and 0 transitions.
Iterating global reduction 3 with 676 rules applied. Total rules applied 1476 place count 451 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1477 place count 451 transition count 350
Renaming transitions due to excessive name length > 1024 char.
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 4 with 2 rules applied. Total rules applied 1479 place count 450 transition count 349
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 4 with 112 rules applied. Total rules applied 1591 place count 394 transition count 385
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1592 place count 394 transition count 384
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1593 place count 394 transition count 383
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1594 place count 393 transition count 383
Partial Free-agglomeration rule applied 20 times.
Drop transitions removed 20 transitions
Iterating global reduction 6 with 20 rules applied. Total rules applied 1614 place count 393 transition count 383
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1615 place count 392 transition count 382
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1617 place count 390 transition count 382
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1617 place count 390 transition count 381
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1619 place count 389 transition count 381
Applied a total of 1619 rules in 217 ms. Remains 389 /1189 variables (removed 800) and now considering 381/1089 (removed 708) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 217 ms. Remains : 389/1189 places, 381/1089 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 283 ms. (steps per millisecond=35 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 381 rows 389 cols
[2023-03-20 00:16:24] [INFO ] Computed 179 place invariants in 2 ms
[2023-03-20 00:16:24] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 00:16:24] [INFO ] [Nat]Absence check using 179 positive place invariants in 46 ms returned sat
[2023-03-20 00:16:24] [INFO ] After 254ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 00:16:24] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-20 00:16:24] [INFO ] After 90ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-20 00:16:24] [INFO ] After 288ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 119 ms.
[2023-03-20 00:16:25] [INFO ] After 841ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 73 ms.
Support contains 8 out of 389 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 389/389 places, 381/381 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 389 transition count 380
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 388 transition count 380
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 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 387 transition count 379
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 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 386 transition count 380
Applied a total of 6 rules in 60 ms. Remains 386 /389 variables (removed 3) and now considering 380/381 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 386/389 places, 380/381 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 147040 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 147040 steps, saw 99051 distinct states, run finished after 3004 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 380 rows 386 cols
[2023-03-20 00:16:28] [INFO ] Computed 179 place invariants in 2 ms
[2023-03-20 00:16:28] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 00:16:28] [INFO ] [Nat]Absence check using 179 positive place invariants in 35 ms returned sat
[2023-03-20 00:16:29] [INFO ] After 207ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 00:16:29] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-20 00:16:29] [INFO ] After 121ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-20 00:16:29] [INFO ] After 335ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 120 ms.
[2023-03-20 00:16:29] [INFO ] After 852ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 14 ms.
Support contains 8 out of 386 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 386/386 places, 380/380 transitions.
Applied a total of 0 rules in 30 ms. Remains 386 /386 variables (removed 0) and now considering 380/380 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 386/386 places, 380/380 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 386/386 places, 380/380 transitions.
Applied a total of 0 rules in 26 ms. Remains 386 /386 variables (removed 0) and now considering 380/380 (removed 0) transitions.
[2023-03-20 00:16:29] [INFO ] Invariant cache hit.
[2023-03-20 00:16:30] [INFO ] Implicit Places using invariants in 576 ms returned [375]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 580 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 385/386 places, 380/380 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 384 transition count 379
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 384 transition count 379
Applied a total of 2 rules in 11 ms. Remains 384 /385 variables (removed 1) and now considering 379/380 (removed 1) transitions.
// Phase 1: matrix 379 rows 384 cols
[2023-03-20 00:16:30] [INFO ] Computed 178 place invariants in 3 ms
[2023-03-20 00:16:30] [INFO ] Implicit Places using invariants in 234 ms returned []
[2023-03-20 00:16:30] [INFO ] Invariant cache hit.
[2023-03-20 00:16:30] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-20 00:16:31] [INFO ] Implicit Places using invariants and state equation in 647 ms returned []
Implicit Place search using SMT with State Equation took 884 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 384/386 places, 379/380 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1501 ms. Remains : 384/386 places, 379/380 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 160210 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :{}
Probabilistic random walk after 160210 steps, saw 107543 distinct states, run finished after 3003 ms. (steps per millisecond=53 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-20 00:16:34] [INFO ] Invariant cache hit.
[2023-03-20 00:16:34] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 00:16:34] [INFO ] [Nat]Absence check using 178 positive place invariants in 27 ms returned sat
[2023-03-20 00:16:34] [INFO ] After 198ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 00:16:34] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-20 00:16:35] [INFO ] After 106ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-20 00:16:35] [INFO ] After 290ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 118 ms.
[2023-03-20 00:16:35] [INFO ] After 794ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 63 ms.
Support contains 8 out of 384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 379/379 transitions.
Applied a total of 0 rules in 10 ms. Remains 384 /384 variables (removed 0) and now considering 379/379 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 384/384 places, 379/379 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 379/379 transitions.
Applied a total of 0 rules in 8 ms. Remains 384 /384 variables (removed 0) and now considering 379/379 (removed 0) transitions.
[2023-03-20 00:16:35] [INFO ] Invariant cache hit.
[2023-03-20 00:16:35] [INFO ] Implicit Places using invariants in 283 ms returned []
[2023-03-20 00:16:35] [INFO ] Invariant cache hit.
[2023-03-20 00:16:36] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-20 00:16:36] [INFO ] Implicit Places using invariants and state equation in 573 ms returned []
Implicit Place search using SMT with State Equation took 873 ms to find 0 implicit places.
[2023-03-20 00:16:36] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-20 00:16:36] [INFO ] Invariant cache hit.
[2023-03-20 00:16:36] [INFO ] Dead Transitions using invariants and state equation in 285 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1198 ms. Remains : 384/384 places, 379/379 transitions.
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 384 transition count 379
Applied a total of 40 rules in 19 ms. Remains 384 /384 variables (removed 0) and now considering 379/379 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 379 rows 384 cols
[2023-03-20 00:16:36] [INFO ] Computed 178 place invariants in 2 ms
[2023-03-20 00:16:36] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 00:16:36] [INFO ] [Nat]Absence check using 178 positive place invariants in 26 ms returned sat
[2023-03-20 00:16:37] [INFO ] After 250ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 00:16:37] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-20 00:16:37] [INFO ] After 137ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-20 00:16:37] [INFO ] After 313ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 167 ms.
[2023-03-20 00:16:37] [INFO ] After 900ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Computed a total of 319 stabilizing places and 319 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1189/1189 places, 1089/1089 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1182 transition count 1082
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1182 transition count 1082
Applied a total of 14 rules in 87 ms. Remains 1182 /1189 variables (removed 7) and now considering 1082/1089 (removed 7) transitions.
// Phase 1: matrix 1082 rows 1182 cols
[2023-03-20 00:16:38] [INFO ] Computed 181 place invariants in 26 ms
[2023-03-20 00:16:38] [INFO ] Implicit Places using invariants in 516 ms returned []
[2023-03-20 00:16:38] [INFO ] Invariant cache hit.
[2023-03-20 00:16:39] [INFO ] Implicit Places using invariants and state equation in 1275 ms returned []
Implicit Place search using SMT with State Equation took 1806 ms to find 0 implicit places.
[2023-03-20 00:16:39] [INFO ] Invariant cache hit.
[2023-03-20 00:16:40] [INFO ] Dead Transitions using invariants and state equation in 942 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1182/1189 places, 1082/1089 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2837 ms. Remains : 1182/1189 places, 1082/1089 transitions.
Stuttering acceptance computed with spot in 216 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s288 0) (EQ s703 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 8 reset in 615 ms.
Stack based approach found an accepted trace after 612 steps with 0 reset with depth 613 and stack size 613 in 4 ms.
FORMULA ShieldIIPt-PT-020B-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-020B-LTLCardinality-00 finished in 3803 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 1189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1189/1189 places, 1089/1089 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1181 transition count 1081
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1181 transition count 1081
Applied a total of 16 rules in 83 ms. Remains 1181 /1189 variables (removed 8) and now considering 1081/1089 (removed 8) transitions.
// Phase 1: matrix 1081 rows 1181 cols
[2023-03-20 00:16:41] [INFO ] Computed 181 place invariants in 9 ms
[2023-03-20 00:16:42] [INFO ] Implicit Places using invariants in 444 ms returned []
[2023-03-20 00:16:42] [INFO ] Invariant cache hit.
[2023-03-20 00:16:43] [INFO ] Implicit Places using invariants and state equation in 974 ms returned []
Implicit Place search using SMT with State Equation took 1431 ms to find 0 implicit places.
[2023-03-20 00:16:43] [INFO ] Invariant cache hit.
[2023-03-20 00:16:43] [INFO ] Dead Transitions using invariants and state equation in 610 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1181/1189 places, 1081/1089 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2127 ms. Remains : 1181/1189 places, 1081/1089 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s649 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 22 reset in 494 ms.
Stack based approach found an accepted trace after 5185 steps with 0 reset with depth 5186 and stack size 2494 in 56 ms.
FORMULA ShieldIIPt-PT-020B-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-020B-LTLCardinality-01 finished in 2863 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||(G(F(p0))&&(G(p1) U G(p2))))))'
Support contains 4 out of 1189 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1189/1189 places, 1089/1089 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 234 transitions
Trivial Post-agglo rules discarded 234 transitions
Performed 234 trivial Post agglomeration. Transition count delta: 234
Iterating post reduction 0 with 234 rules applied. Total rules applied 234 place count 1188 transition count 854
Reduce places removed 234 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 236 rules applied. Total rules applied 470 place count 954 transition count 852
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 472 place count 952 transition count 852
Performed 158 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 158 Pre rules applied. Total rules applied 472 place count 952 transition count 694
Deduced a syphon composed of 158 places in 1 ms
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 3 with 316 rules applied. Total rules applied 788 place count 794 transition count 694
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 794 place count 788 transition count 688
Iterating global reduction 3 with 6 rules applied. Total rules applied 800 place count 788 transition count 688
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 800 place count 788 transition count 683
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 810 place count 783 transition count 683
Performed 332 Post agglomeration using F-continuation condition.Transition count delta: 332
Deduced a syphon composed of 332 places in 0 ms
Reduce places removed 332 places and 0 transitions.
Iterating global reduction 3 with 664 rules applied. Total rules applied 1474 place count 451 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1475 place count 451 transition count 350
Renaming transitions due to excessive name length > 1024 char.
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 4 with 2 rules applied. Total rules applied 1477 place count 450 transition count 349
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 1593 place count 392 transition count 386
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1595 place count 390 transition count 384
Applied a total of 1595 rules in 121 ms. Remains 390 /1189 variables (removed 799) and now considering 384/1089 (removed 705) transitions.
// Phase 1: matrix 384 rows 390 cols
[2023-03-20 00:16:44] [INFO ] Computed 181 place invariants in 15 ms
[2023-03-20 00:16:45] [INFO ] Implicit Places using invariants in 274 ms returned [381, 382]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 276 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 388/1189 places, 384/1089 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 388 transition count 383
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 387 transition count 383
Applied a total of 2 rules in 16 ms. Remains 387 /388 variables (removed 1) and now considering 383/384 (removed 1) transitions.
// Phase 1: matrix 383 rows 387 cols
[2023-03-20 00:16:45] [INFO ] Computed 179 place invariants in 1 ms
[2023-03-20 00:16:45] [INFO ] Implicit Places using invariants in 195 ms returned [375]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 197 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 386/1189 places, 383/1089 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 385 transition count 382
Applied a total of 2 rules in 12 ms. Remains 385 /386 variables (removed 1) and now considering 382/383 (removed 1) transitions.
// Phase 1: matrix 382 rows 385 cols
[2023-03-20 00:16:45] [INFO ] Computed 178 place invariants in 1 ms
[2023-03-20 00:16:45] [INFO ] Implicit Places using invariants in 178 ms returned []
[2023-03-20 00:16:45] [INFO ] Invariant cache hit.
[2023-03-20 00:16:45] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-20 00:16:45] [INFO ] Implicit Places using invariants and state equation in 519 ms returned []
Implicit Place search using SMT with State Equation took 720 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 385/1189 places, 382/1089 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1342 ms. Remains : 385/1189 places, 382/1089 transitions.
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (AND (NOT p2) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p2:(OR (EQ s91 0) (EQ s15 1)), p0:(OR (EQ s234 0) (EQ s285 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 25 steps with 2 reset in 1 ms.
FORMULA ShieldIIPt-PT-020B-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-LTLCardinality-06 finished in 1573 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 1189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1189/1189 places, 1089/1089 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1181 transition count 1081
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1181 transition count 1081
Applied a total of 16 rules in 96 ms. Remains 1181 /1189 variables (removed 8) and now considering 1081/1089 (removed 8) transitions.
// Phase 1: matrix 1081 rows 1181 cols
[2023-03-20 00:16:46] [INFO ] Computed 181 place invariants in 4 ms
[2023-03-20 00:16:46] [INFO ] Implicit Places using invariants in 362 ms returned []
[2023-03-20 00:16:46] [INFO ] Invariant cache hit.
[2023-03-20 00:16:47] [INFO ] Implicit Places using invariants and state equation in 1215 ms returned []
Implicit Place search using SMT with State Equation took 1581 ms to find 0 implicit places.
[2023-03-20 00:16:47] [INFO ] Invariant cache hit.
[2023-03-20 00:16:48] [INFO ] Dead Transitions using invariants and state equation in 608 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1181/1189 places, 1081/1089 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2311 ms. Remains : 1181/1189 places, 1081/1089 transitions.
Stuttering acceptance computed with spot in 179 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (EQ s217 0) (EQ s1081 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 490 ms.
Product exploration explored 100000 steps with 0 reset in 623 ms.
Computed a total of 318 stabilizing places and 318 stable transitions
Computed a total of 318 stabilizing places and 318 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 157 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 259 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 283038 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :{}
Probabilistic random walk after 283038 steps, saw 144305 distinct states, run finished after 3001 ms. (steps per millisecond=94 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 00:16:53] [INFO ] Invariant cache hit.
[2023-03-20 00:16:53] [INFO ] After 211ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:16:53] [INFO ] [Nat]Absence check using 181 positive place invariants in 87 ms returned sat
[2023-03-20 00:16:54] [INFO ] After 579ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:16:54] [INFO ] Deduced a trap composed of 22 places in 266 ms of which 1 ms to minimize.
[2023-03-20 00:16:55] [INFO ] Deduced a trap composed of 24 places in 233 ms of which 1 ms to minimize.
[2023-03-20 00:16:55] [INFO ] Deduced a trap composed of 20 places in 318 ms of which 1 ms to minimize.
[2023-03-20 00:16:55] [INFO ] Deduced a trap composed of 20 places in 249 ms of which 0 ms to minimize.
[2023-03-20 00:16:56] [INFO ] Deduced a trap composed of 16 places in 318 ms of which 1 ms to minimize.
[2023-03-20 00:16:56] [INFO ] Deduced a trap composed of 17 places in 239 ms of which 0 ms to minimize.
[2023-03-20 00:16:56] [INFO ] Deduced a trap composed of 28 places in 165 ms of which 0 ms to minimize.
[2023-03-20 00:16:56] [INFO ] Deduced a trap composed of 20 places in 227 ms of which 1 ms to minimize.
[2023-03-20 00:16:57] [INFO ] Deduced a trap composed of 19 places in 207 ms of which 0 ms to minimize.
[2023-03-20 00:16:57] [INFO ] Deduced a trap composed of 20 places in 186 ms of which 1 ms to minimize.
[2023-03-20 00:16:57] [INFO ] Deduced a trap composed of 33 places in 206 ms of which 0 ms to minimize.
[2023-03-20 00:16:57] [INFO ] Deduced a trap composed of 22 places in 221 ms of which 1 ms to minimize.
[2023-03-20 00:16:58] [INFO ] Deduced a trap composed of 25 places in 290 ms of which 1 ms to minimize.
[2023-03-20 00:16:58] [INFO ] Deduced a trap composed of 29 places in 282 ms of which 1 ms to minimize.
[2023-03-20 00:16:58] [INFO ] Deduced a trap composed of 19 places in 230 ms of which 1 ms to minimize.
[2023-03-20 00:16:59] [INFO ] Deduced a trap composed of 21 places in 242 ms of which 22 ms to minimize.
[2023-03-20 00:16:59] [INFO ] Deduced a trap composed of 24 places in 163 ms of which 1 ms to minimize.
[2023-03-20 00:16:59] [INFO ] Deduced a trap composed of 27 places in 205 ms of which 1 ms to minimize.
[2023-03-20 00:16:59] [INFO ] Deduced a trap composed of 30 places in 273 ms of which 2 ms to minimize.
[2023-03-20 00:17:00] [INFO ] Deduced a trap composed of 31 places in 199 ms of which 1 ms to minimize.
[2023-03-20 00:17:00] [INFO ] Deduced a trap composed of 35 places in 158 ms of which 0 ms to minimize.
[2023-03-20 00:17:00] [INFO ] Deduced a trap composed of 31 places in 154 ms of which 0 ms to minimize.
[2023-03-20 00:17:00] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 1 ms to minimize.
[2023-03-20 00:17:00] [INFO ] Deduced a trap composed of 18 places in 157 ms of which 0 ms to minimize.
[2023-03-20 00:17:01] [INFO ] Deduced a trap composed of 32 places in 130 ms of which 1 ms to minimize.
[2023-03-20 00:17:01] [INFO ] Deduced a trap composed of 26 places in 164 ms of which 1 ms to minimize.
[2023-03-20 00:17:01] [INFO ] Deduced a trap composed of 28 places in 128 ms of which 1 ms to minimize.
[2023-03-20 00:17:01] [INFO ] Deduced a trap composed of 28 places in 146 ms of which 0 ms to minimize.
[2023-03-20 00:17:01] [INFO ] Deduced a trap composed of 29 places in 121 ms of which 0 ms to minimize.
[2023-03-20 00:17:02] [INFO ] Deduced a trap composed of 30 places in 125 ms of which 1 ms to minimize.
[2023-03-20 00:17:02] [INFO ] Deduced a trap composed of 33 places in 135 ms of which 1 ms to minimize.
[2023-03-20 00:17:02] [INFO ] Deduced a trap composed of 32 places in 143 ms of which 1 ms to minimize.
[2023-03-20 00:17:02] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 0 ms to minimize.
[2023-03-20 00:17:02] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 1 ms to minimize.
[2023-03-20 00:17:02] [INFO ] Deduced a trap composed of 33 places in 141 ms of which 1 ms to minimize.
[2023-03-20 00:17:03] [INFO ] Deduced a trap composed of 35 places in 114 ms of which 0 ms to minimize.
[2023-03-20 00:17:03] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 8638 ms
[2023-03-20 00:17:03] [INFO ] After 9299ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 86 ms.
[2023-03-20 00:17:03] [INFO ] After 9669ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 26 ms.
Support contains 2 out of 1181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1181/1181 places, 1081/1081 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 239 rules applied. Total rules applied 239 place count 1181 transition count 842
Reduce places removed 239 places and 0 transitions.
Iterating post reduction 1 with 239 rules applied. Total rules applied 478 place count 942 transition count 842
Performed 161 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 161 Pre rules applied. Total rules applied 478 place count 942 transition count 681
Deduced a syphon composed of 161 places in 1 ms
Reduce places removed 161 places and 0 transitions.
Iterating global reduction 2 with 322 rules applied. Total rules applied 800 place count 781 transition count 681
Performed 339 Post agglomeration using F-continuation condition.Transition count delta: 339
Deduced a syphon composed of 339 places in 0 ms
Reduce places removed 339 places and 0 transitions.
Iterating global reduction 2 with 678 rules applied. Total rules applied 1478 place count 442 transition count 342
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1479 place count 442 transition count 341
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1481 place count 441 transition count 340
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1599 place count 382 transition count 379
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1600 place count 382 transition count 378
Partial Free-agglomeration rule applied 20 times.
Drop transitions removed 20 transitions
Iterating global reduction 4 with 20 rules applied. Total rules applied 1620 place count 382 transition count 378
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1621 place count 381 transition count 377
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1623 place count 379 transition count 377
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1623 place count 379 transition count 376
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1625 place count 378 transition count 376
Applied a total of 1625 rules in 111 ms. Remains 378 /1181 variables (removed 803) and now considering 376/1081 (removed 705) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 378/1181 places, 376/1081 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 501581 steps, run timeout after 3001 ms. (steps per millisecond=167 ) properties seen :{}
Probabilistic random walk after 501581 steps, saw 310996 distinct states, run finished after 3001 ms. (steps per millisecond=167 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 376 rows 378 cols
[2023-03-20 00:17:06] [INFO ] Computed 179 place invariants in 3 ms
[2023-03-20 00:17:06] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:17:06] [INFO ] [Nat]Absence check using 179 positive place invariants in 83 ms returned sat
[2023-03-20 00:17:06] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:17:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 00:17:06] [INFO ] After 19ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 00:17:07] [INFO ] After 64ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-03-20 00:17:07] [INFO ] After 442ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 378 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 376/376 transitions.
Applied a total of 0 rules in 10 ms. Remains 378 /378 variables (removed 0) and now considering 376/376 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 378/378 places, 376/376 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 376/376 transitions.
Applied a total of 0 rules in 8 ms. Remains 378 /378 variables (removed 0) and now considering 376/376 (removed 0) transitions.
[2023-03-20 00:17:07] [INFO ] Invariant cache hit.
[2023-03-20 00:17:07] [INFO ] Implicit Places using invariants in 330 ms returned [367]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 344 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 377/378 places, 376/376 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 376 transition count 375
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 376 transition count 375
Applied a total of 2 rules in 10 ms. Remains 376 /377 variables (removed 1) and now considering 375/376 (removed 1) transitions.
// Phase 1: matrix 375 rows 376 cols
[2023-03-20 00:17:07] [INFO ] Computed 178 place invariants in 1 ms
[2023-03-20 00:17:07] [INFO ] Implicit Places using invariants in 281 ms returned []
[2023-03-20 00:17:07] [INFO ] Invariant cache hit.
[2023-03-20 00:17:08] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 663 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 376/378 places, 375/376 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1038 ms. Remains : 376/378 places, 375/376 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 517018 steps, run timeout after 3001 ms. (steps per millisecond=172 ) properties seen :{}
Probabilistic random walk after 517018 steps, saw 321272 distinct states, run finished after 3001 ms. (steps per millisecond=172 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 00:17:11] [INFO ] Invariant cache hit.
[2023-03-20 00:17:11] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:17:11] [INFO ] [Nat]Absence check using 178 positive place invariants in 27 ms returned sat
[2023-03-20 00:17:11] [INFO ] After 222ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:17:11] [INFO ] After 306ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-20 00:17:11] [INFO ] After 456ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 376 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 376/376 places, 375/375 transitions.
Applied a total of 0 rules in 14 ms. Remains 376 /376 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 376/376 places, 375/375 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 376/376 places, 375/375 transitions.
Applied a total of 0 rules in 12 ms. Remains 376 /376 variables (removed 0) and now considering 375/375 (removed 0) transitions.
[2023-03-20 00:17:11] [INFO ] Invariant cache hit.
[2023-03-20 00:17:12] [INFO ] Implicit Places using invariants in 252 ms returned []
[2023-03-20 00:17:12] [INFO ] Invariant cache hit.
[2023-03-20 00:17:12] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 604 ms to find 0 implicit places.
[2023-03-20 00:17:12] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-20 00:17:12] [INFO ] Invariant cache hit.
[2023-03-20 00:17:12] [INFO ] Dead Transitions using invariants and state equation in 208 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 833 ms. Remains : 376/376 places, 375/375 transitions.
Partial Free-agglomeration rule applied 39 times.
Drop transitions removed 39 transitions
Iterating global reduction 0 with 39 rules applied. Total rules applied 39 place count 376 transition count 375
Applied a total of 39 rules in 13 ms. Remains 376 /376 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 375 rows 376 cols
[2023-03-20 00:17:12] [INFO ] Computed 178 place invariants in 1 ms
[2023-03-20 00:17:12] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:17:12] [INFO ] [Nat]Absence check using 178 positive place invariants in 25 ms returned sat
[2023-03-20 00:17:13] [INFO ] After 221ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:17:13] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-20 00:17:13] [INFO ] After 30ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 00:17:13] [INFO ] After 61ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-20 00:17:13] [INFO ] After 418ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 116 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 264 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 256 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1181/1181 places, 1081/1081 transitions.
Applied a total of 0 rules in 46 ms. Remains 1181 /1181 variables (removed 0) and now considering 1081/1081 (removed 0) transitions.
// Phase 1: matrix 1081 rows 1181 cols
[2023-03-20 00:17:13] [INFO ] Computed 181 place invariants in 8 ms
[2023-03-20 00:17:14] [INFO ] Implicit Places using invariants in 445 ms returned []
[2023-03-20 00:17:14] [INFO ] Invariant cache hit.
[2023-03-20 00:17:15] [INFO ] Implicit Places using invariants and state equation in 986 ms returned []
Implicit Place search using SMT with State Equation took 1446 ms to find 0 implicit places.
[2023-03-20 00:17:15] [INFO ] Invariant cache hit.
[2023-03-20 00:17:15] [INFO ] Dead Transitions using invariants and state equation in 643 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2135 ms. Remains : 1181/1181 places, 1081/1081 transitions.
Computed a total of 318 stabilizing places and 318 stable transitions
Computed a total of 318 stabilizing places and 318 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 133 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 261 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 281803 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :{}
Probabilistic random walk after 281803 steps, saw 143718 distinct states, run finished after 3001 ms. (steps per millisecond=93 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 00:17:19] [INFO ] Invariant cache hit.
[2023-03-20 00:17:19] [INFO ] After 223ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:17:19] [INFO ] [Nat]Absence check using 181 positive place invariants in 56 ms returned sat
[2023-03-20 00:17:20] [INFO ] After 601ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:17:20] [INFO ] Deduced a trap composed of 22 places in 238 ms of which 3 ms to minimize.
[2023-03-20 00:17:21] [INFO ] Deduced a trap composed of 24 places in 217 ms of which 9 ms to minimize.
[2023-03-20 00:17:21] [INFO ] Deduced a trap composed of 20 places in 187 ms of which 3 ms to minimize.
[2023-03-20 00:17:21] [INFO ] Deduced a trap composed of 20 places in 175 ms of which 0 ms to minimize.
[2023-03-20 00:17:21] [INFO ] Deduced a trap composed of 16 places in 187 ms of which 0 ms to minimize.
[2023-03-20 00:17:22] [INFO ] Deduced a trap composed of 17 places in 198 ms of which 1 ms to minimize.
[2023-03-20 00:17:22] [INFO ] Deduced a trap composed of 28 places in 182 ms of which 0 ms to minimize.
[2023-03-20 00:17:22] [INFO ] Deduced a trap composed of 20 places in 196 ms of which 1 ms to minimize.
[2023-03-20 00:17:22] [INFO ] Deduced a trap composed of 19 places in 203 ms of which 1 ms to minimize.
[2023-03-20 00:17:23] [INFO ] Deduced a trap composed of 20 places in 189 ms of which 1 ms to minimize.
[2023-03-20 00:17:23] [INFO ] Deduced a trap composed of 33 places in 177 ms of which 0 ms to minimize.
[2023-03-20 00:17:23] [INFO ] Deduced a trap composed of 22 places in 173 ms of which 1 ms to minimize.
[2023-03-20 00:17:23] [INFO ] Deduced a trap composed of 25 places in 193 ms of which 1 ms to minimize.
[2023-03-20 00:17:23] [INFO ] Deduced a trap composed of 29 places in 153 ms of which 2 ms to minimize.
[2023-03-20 00:17:24] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 0 ms to minimize.
[2023-03-20 00:17:24] [INFO ] Deduced a trap composed of 21 places in 148 ms of which 1 ms to minimize.
[2023-03-20 00:17:24] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 1 ms to minimize.
[2023-03-20 00:17:24] [INFO ] Deduced a trap composed of 27 places in 183 ms of which 0 ms to minimize.
[2023-03-20 00:17:24] [INFO ] Deduced a trap composed of 30 places in 208 ms of which 0 ms to minimize.
[2023-03-20 00:17:25] [INFO ] Deduced a trap composed of 31 places in 298 ms of which 1 ms to minimize.
[2023-03-20 00:17:25] [INFO ] Deduced a trap composed of 35 places in 196 ms of which 1 ms to minimize.
[2023-03-20 00:17:25] [INFO ] Deduced a trap composed of 31 places in 253 ms of which 0 ms to minimize.
[2023-03-20 00:17:25] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 0 ms to minimize.
[2023-03-20 00:17:26] [INFO ] Deduced a trap composed of 18 places in 176 ms of which 1 ms to minimize.
[2023-03-20 00:17:26] [INFO ] Deduced a trap composed of 32 places in 176 ms of which 1 ms to minimize.
[2023-03-20 00:17:26] [INFO ] Deduced a trap composed of 26 places in 169 ms of which 1 ms to minimize.
[2023-03-20 00:17:26] [INFO ] Deduced a trap composed of 28 places in 135 ms of which 1 ms to minimize.
[2023-03-20 00:17:26] [INFO ] Deduced a trap composed of 28 places in 148 ms of which 0 ms to minimize.
[2023-03-20 00:17:27] [INFO ] Deduced a trap composed of 29 places in 154 ms of which 2 ms to minimize.
[2023-03-20 00:17:27] [INFO ] Deduced a trap composed of 30 places in 162 ms of which 0 ms to minimize.
[2023-03-20 00:17:27] [INFO ] Deduced a trap composed of 33 places in 129 ms of which 0 ms to minimize.
[2023-03-20 00:17:27] [INFO ] Deduced a trap composed of 32 places in 124 ms of which 1 ms to minimize.
[2023-03-20 00:17:28] [INFO ] Deduced a trap composed of 34 places in 164 ms of which 3 ms to minimize.
[2023-03-20 00:17:28] [INFO ] Deduced a trap composed of 31 places in 222 ms of which 0 ms to minimize.
[2023-03-20 00:17:28] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 1 ms to minimize.
[2023-03-20 00:17:28] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
[2023-03-20 00:17:28] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 7940 ms
[2023-03-20 00:17:28] [INFO ] After 8582ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-03-20 00:17:28] [INFO ] After 8927ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 1181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1181/1181 places, 1081/1081 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 239 rules applied. Total rules applied 239 place count 1181 transition count 842
Reduce places removed 239 places and 0 transitions.
Iterating post reduction 1 with 239 rules applied. Total rules applied 478 place count 942 transition count 842
Performed 161 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 161 Pre rules applied. Total rules applied 478 place count 942 transition count 681
Deduced a syphon composed of 161 places in 0 ms
Reduce places removed 161 places and 0 transitions.
Iterating global reduction 2 with 322 rules applied. Total rules applied 800 place count 781 transition count 681
Performed 339 Post agglomeration using F-continuation condition.Transition count delta: 339
Deduced a syphon composed of 339 places in 0 ms
Reduce places removed 339 places and 0 transitions.
Iterating global reduction 2 with 678 rules applied. Total rules applied 1478 place count 442 transition count 342
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1479 place count 442 transition count 341
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1481 place count 441 transition count 340
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1599 place count 382 transition count 379
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1600 place count 382 transition count 378
Partial Free-agglomeration rule applied 20 times.
Drop transitions removed 20 transitions
Iterating global reduction 4 with 20 rules applied. Total rules applied 1620 place count 382 transition count 378
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1621 place count 381 transition count 377
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1623 place count 379 transition count 377
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1623 place count 379 transition count 376
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1625 place count 378 transition count 376
Applied a total of 1625 rules in 80 ms. Remains 378 /1181 variables (removed 803) and now considering 376/1081 (removed 705) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 378/1181 places, 376/1081 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 517752 steps, run timeout after 3001 ms. (steps per millisecond=172 ) properties seen :{}
Probabilistic random walk after 517752 steps, saw 321764 distinct states, run finished after 3001 ms. (steps per millisecond=172 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 376 rows 378 cols
[2023-03-20 00:17:31] [INFO ] Computed 179 place invariants in 3 ms
[2023-03-20 00:17:31] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:17:32] [INFO ] [Nat]Absence check using 179 positive place invariants in 25 ms returned sat
[2023-03-20 00:17:32] [INFO ] After 183ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:17:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 00:17:32] [INFO ] After 18ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 00:17:32] [INFO ] After 44ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-20 00:17:32] [INFO ] After 354ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 378 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 376/376 transitions.
Applied a total of 0 rules in 11 ms. Remains 378 /378 variables (removed 0) and now considering 376/376 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 378/378 places, 376/376 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 376/376 transitions.
Applied a total of 0 rules in 8 ms. Remains 378 /378 variables (removed 0) and now considering 376/376 (removed 0) transitions.
[2023-03-20 00:17:32] [INFO ] Invariant cache hit.
[2023-03-20 00:17:32] [INFO ] Implicit Places using invariants in 271 ms returned [367]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 272 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 377/378 places, 376/376 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 376 transition count 375
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 376 transition count 375
Applied a total of 2 rules in 8 ms. Remains 376 /377 variables (removed 1) and now considering 375/376 (removed 1) transitions.
// Phase 1: matrix 375 rows 376 cols
[2023-03-20 00:17:32] [INFO ] Computed 178 place invariants in 1 ms
[2023-03-20 00:17:32] [INFO ] Implicit Places using invariants in 240 ms returned []
[2023-03-20 00:17:32] [INFO ] Invariant cache hit.
[2023-03-20 00:17:33] [INFO ] Implicit Places using invariants and state equation in 437 ms returned []
Implicit Place search using SMT with State Equation took 679 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 376/378 places, 375/376 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 968 ms. Remains : 376/378 places, 375/376 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 534978 steps, run timeout after 3001 ms. (steps per millisecond=178 ) properties seen :{}
Probabilistic random walk after 534978 steps, saw 332480 distinct states, run finished after 3001 ms. (steps per millisecond=178 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 00:17:36] [INFO ] Invariant cache hit.
[2023-03-20 00:17:36] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:17:36] [INFO ] [Nat]Absence check using 178 positive place invariants in 32 ms returned sat
[2023-03-20 00:17:36] [INFO ] After 164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:17:36] [INFO ] After 196ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-20 00:17:36] [INFO ] After 397ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 376 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 376/376 places, 375/375 transitions.
Applied a total of 0 rules in 10 ms. Remains 376 /376 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 376/376 places, 375/375 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 376/376 places, 375/375 transitions.
Applied a total of 0 rules in 9 ms. Remains 376 /376 variables (removed 0) and now considering 375/375 (removed 0) transitions.
[2023-03-20 00:17:36] [INFO ] Invariant cache hit.
[2023-03-20 00:17:37] [INFO ] Implicit Places using invariants in 248 ms returned []
[2023-03-20 00:17:37] [INFO ] Invariant cache hit.
[2023-03-20 00:17:37] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 672 ms to find 0 implicit places.
[2023-03-20 00:17:37] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-20 00:17:37] [INFO ] Invariant cache hit.
[2023-03-20 00:17:37] [INFO ] Dead Transitions using invariants and state equation in 225 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 914 ms. Remains : 376/376 places, 375/375 transitions.
Partial Free-agglomeration rule applied 39 times.
Drop transitions removed 39 transitions
Iterating global reduction 0 with 39 rules applied. Total rules applied 39 place count 376 transition count 375
Applied a total of 39 rules in 10 ms. Remains 376 /376 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 375 rows 376 cols
[2023-03-20 00:17:37] [INFO ] Computed 178 place invariants in 1 ms
[2023-03-20 00:17:37] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:17:38] [INFO ] [Nat]Absence check using 178 positive place invariants in 46 ms returned sat
[2023-03-20 00:17:38] [INFO ] After 113ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:17:38] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-20 00:17:38] [INFO ] After 33ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 00:17:38] [INFO ] After 59ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-20 00:17:38] [INFO ] After 334ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 119 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 228 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 269 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 294 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 531 ms.
Product exploration explored 100000 steps with 0 reset in 616 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 205 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1181 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1181/1181 places, 1081/1081 transitions.
Performed 239 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 239 rules applied. Total rules applied 239 place count 1181 transition count 1081
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 81 Pre rules applied. Total rules applied 239 place count 1181 transition count 1142
Deduced a syphon composed of 320 places in 1 ms
Iterating global reduction 1 with 81 rules applied. Total rules applied 320 place count 1181 transition count 1142
Performed 399 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 719 places in 2 ms
Iterating global reduction 1 with 399 rules applied. Total rules applied 719 place count 1181 transition count 1142
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 720 place count 1181 transition count 1141
Renaming transitions due to excessive name length > 1024 char.
Discarding 160 places :
Symmetric choice reduction at 2 with 160 rule applications. Total rules 880 place count 1021 transition count 981
Deduced a syphon composed of 559 places in 0 ms
Iterating global reduction 2 with 160 rules applied. Total rules applied 1040 place count 1021 transition count 981
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 560 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1041 place count 1021 transition count 981
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1043 place count 1019 transition count 979
Deduced a syphon composed of 558 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1045 place count 1019 transition count 979
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: -419
Deduced a syphon composed of 637 places in 1 ms
Iterating global reduction 2 with 79 rules applied. Total rules applied 1124 place count 1019 transition count 1398
Discarding 79 places :
Symmetric choice reduction at 2 with 79 rule applications. Total rules 1203 place count 940 transition count 1240
Deduced a syphon composed of 558 places in 1 ms
Iterating global reduction 2 with 79 rules applied. Total rules applied 1282 place count 940 transition count 1240
Deduced a syphon composed of 558 places in 2 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 1291 place count 940 transition count 1231
Deduced a syphon composed of 558 places in 0 ms
Applied a total of 1291 rules in 591 ms. Remains 940 /1181 variables (removed 241) and now considering 1231/1081 (removed -150) transitions.
[2023-03-20 00:17:41] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 1231 rows 940 cols
[2023-03-20 00:17:41] [INFO ] Computed 181 place invariants in 6 ms
[2023-03-20 00:17:41] [INFO ] Dead Transitions using invariants and state equation in 620 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 940/1181 places, 1231/1081 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1227 ms. Remains : 940/1181 places, 1231/1081 transitions.
Support contains 2 out of 1181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1181/1181 places, 1081/1081 transitions.
Applied a total of 0 rules in 37 ms. Remains 1181 /1181 variables (removed 0) and now considering 1081/1081 (removed 0) transitions.
// Phase 1: matrix 1081 rows 1181 cols
[2023-03-20 00:17:42] [INFO ] Computed 181 place invariants in 2 ms
[2023-03-20 00:17:42] [INFO ] Implicit Places using invariants in 364 ms returned []
[2023-03-20 00:17:42] [INFO ] Invariant cache hit.
[2023-03-20 00:17:43] [INFO ] Implicit Places using invariants and state equation in 940 ms returned []
Implicit Place search using SMT with State Equation took 1340 ms to find 0 implicit places.
[2023-03-20 00:17:43] [INFO ] Invariant cache hit.
[2023-03-20 00:17:44] [INFO ] Dead Transitions using invariants and state equation in 706 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2084 ms. Remains : 1181/1181 places, 1081/1081 transitions.
Treatment of property ShieldIIPt-PT-020B-LTLCardinality-07 finished in 57987 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 1189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1189/1189 places, 1089/1089 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 237 transitions
Trivial Post-agglo rules discarded 237 transitions
Performed 237 trivial Post agglomeration. Transition count delta: 237
Iterating post reduction 0 with 237 rules applied. Total rules applied 237 place count 1188 transition count 851
Reduce places removed 237 places and 0 transitions.
Iterating post reduction 1 with 237 rules applied. Total rules applied 474 place count 951 transition count 851
Performed 157 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 157 Pre rules applied. Total rules applied 474 place count 951 transition count 694
Deduced a syphon composed of 157 places in 1 ms
Reduce places removed 157 places and 0 transitions.
Iterating global reduction 2 with 314 rules applied. Total rules applied 788 place count 794 transition count 694
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 794 place count 788 transition count 688
Iterating global reduction 2 with 6 rules applied. Total rules applied 800 place count 788 transition count 688
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 800 place count 788 transition count 683
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 810 place count 783 transition count 683
Performed 336 Post agglomeration using F-continuation condition.Transition count delta: 336
Deduced a syphon composed of 336 places in 0 ms
Reduce places removed 336 places and 0 transitions.
Iterating global reduction 2 with 672 rules applied. Total rules applied 1482 place count 447 transition count 347
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1483 place count 447 transition count 346
Renaming transitions due to excessive name length > 1024 char.
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 3 with 2 rules applied. Total rules applied 1485 place count 446 transition count 345
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1603 place count 387 transition count 384
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 1604 place count 387 transition count 384
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1606 place count 385 transition count 382
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1608 place count 383 transition count 382
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1608 place count 383 transition count 381
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1610 place count 382 transition count 381
Applied a total of 1610 rules in 99 ms. Remains 382 /1189 variables (removed 807) and now considering 381/1089 (removed 708) transitions.
// Phase 1: matrix 381 rows 382 cols
[2023-03-20 00:17:44] [INFO ] Computed 179 place invariants in 2 ms
[2023-03-20 00:17:44] [INFO ] Implicit Places using invariants in 289 ms returned [371]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 291 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 381/1189 places, 381/1089 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 380 transition count 380
Applied a total of 2 rules in 11 ms. Remains 380 /381 variables (removed 1) and now considering 380/381 (removed 1) transitions.
// Phase 1: matrix 380 rows 380 cols
[2023-03-20 00:17:44] [INFO ] Computed 178 place invariants in 0 ms
[2023-03-20 00:17:44] [INFO ] Implicit Places using invariants in 357 ms returned []
[2023-03-20 00:17:44] [INFO ] Invariant cache hit.
[2023-03-20 00:17:45] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-20 00:17:45] [INFO ] Implicit Places using invariants and state equation in 551 ms returned []
Implicit Place search using SMT with State Equation took 909 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 380/1189 places, 380/1089 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1310 ms. Remains : 380/1189 places, 380/1089 transitions.
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s324 1), p1:(OR (EQ s36 0) (EQ s232 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-020B-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-LTLCardinality-08 finished in 1539 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U X(p1)))'
Support contains 6 out of 1189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1189/1189 places, 1089/1089 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1183 transition count 1083
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1183 transition count 1083
Applied a total of 12 rules in 91 ms. Remains 1183 /1189 variables (removed 6) and now considering 1083/1089 (removed 6) transitions.
// Phase 1: matrix 1083 rows 1183 cols
[2023-03-20 00:17:45] [INFO ] Computed 181 place invariants in 7 ms
[2023-03-20 00:17:46] [INFO ] Implicit Places using invariants in 646 ms returned []
[2023-03-20 00:17:46] [INFO ] Invariant cache hit.
[2023-03-20 00:17:47] [INFO ] Implicit Places using invariants and state equation in 1109 ms returned []
Implicit Place search using SMT with State Equation took 1769 ms to find 0 implicit places.
[2023-03-20 00:17:47] [INFO ] Invariant cache hit.
[2023-03-20 00:17:48] [INFO ] Dead Transitions using invariants and state equation in 633 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1183/1189 places, 1083/1089 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2494 ms. Remains : 1183/1189 places, 1083/1089 transitions.
Stuttering acceptance computed with spot in 192 ms :[(NOT p1), (NOT p1), (NOT p1), true, p0]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s987 0) (EQ s1021 1)), p1:(OR (NOT (OR (EQ s589 0) (EQ s302 1))) (NOT (OR (EQ s862 0) (EQ s237 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-020B-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-LTLCardinality-11 finished in 2727 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1189/1189 places, 1089/1089 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1181 transition count 1081
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1181 transition count 1081
Applied a total of 16 rules in 96 ms. Remains 1181 /1189 variables (removed 8) and now considering 1081/1089 (removed 8) transitions.
// Phase 1: matrix 1081 rows 1181 cols
[2023-03-20 00:17:48] [INFO ] Computed 181 place invariants in 8 ms
[2023-03-20 00:17:48] [INFO ] Implicit Places using invariants in 390 ms returned []
[2023-03-20 00:17:48] [INFO ] Invariant cache hit.
[2023-03-20 00:17:50] [INFO ] Implicit Places using invariants and state equation in 1513 ms returned []
Implicit Place search using SMT with State Equation took 1927 ms to find 0 implicit places.
[2023-03-20 00:17:50] [INFO ] Invariant cache hit.
[2023-03-20 00:17:51] [INFO ] Dead Transitions using invariants and state equation in 632 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1181/1189 places, 1081/1089 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2656 ms. Remains : 1181/1189 places, 1081/1089 transitions.
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (NEQ s52 0) (NEQ s642 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-020B-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-LTLCardinality-12 finished in 2789 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(((p0 U !p1) U G(p2))))))))'
Support contains 5 out of 1189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1189/1189 places, 1089/1089 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1181 transition count 1081
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1181 transition count 1081
Applied a total of 16 rules in 99 ms. Remains 1181 /1189 variables (removed 8) and now considering 1081/1089 (removed 8) transitions.
[2023-03-20 00:17:51] [INFO ] Invariant cache hit.
[2023-03-20 00:17:51] [INFO ] Implicit Places using invariants in 431 ms returned []
[2023-03-20 00:17:51] [INFO ] Invariant cache hit.
[2023-03-20 00:17:52] [INFO ] Implicit Places using invariants and state equation in 982 ms returned []
Implicit Place search using SMT with State Equation took 1441 ms to find 0 implicit places.
[2023-03-20 00:17:52] [INFO ] Invariant cache hit.
[2023-03-20 00:17:53] [INFO ] Dead Transitions using invariants and state equation in 680 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1181/1189 places, 1081/1089 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2220 ms. Remains : 1181/1189 places, 1081/1089 transitions.
Stuttering acceptance computed with spot in 512 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, p1, (NOT p2)]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(OR (AND p2 (NOT p1)) (AND p2 p0)), acceptance={} source=5 dest: 5}, { cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p2) p0)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=5 dest: 7}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=5 dest: 8}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 6}, { cond=(AND p1 p0), acceptance={0} source=7 dest: 7}], [{ cond=(NOT p2), acceptance={} source=8 dest: 6}, { cond=p2, acceptance={} source=8 dest: 8}]], initial=0, aps=[p2:(EQ s618 1), p1:(OR (EQ s1033 0) (EQ s872 1)), p0:(OR (EQ s384 0) (EQ s1112 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1359 reset in 352 ms.
Product exploration explored 100000 steps with 1359 reset in 334 ms.
Computed a total of 318 stabilizing places and 318 stable transitions
Computed a total of 318 stabilizing places and 318 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 161 ms. Reduced automaton from 9 states, 15 edges and 3 AP (stutter sensitive) to 9 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 465 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, p1, (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 421 ms. (steps per millisecond=23 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-20 00:17:55] [INFO ] Invariant cache hit.
[2023-03-20 00:17:56] [INFO ] After 217ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-20 00:17:56] [INFO ] [Nat]Absence check using 181 positive place invariants in 62 ms returned sat
[2023-03-20 00:17:57] [INFO ] After 787ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-20 00:17:57] [INFO ] Deduced a trap composed of 20 places in 284 ms of which 1 ms to minimize.
[2023-03-20 00:17:58] [INFO ] Deduced a trap composed of 23 places in 292 ms of which 1 ms to minimize.
[2023-03-20 00:17:58] [INFO ] Deduced a trap composed of 22 places in 249 ms of which 1 ms to minimize.
[2023-03-20 00:17:58] [INFO ] Deduced a trap composed of 15 places in 260 ms of which 1 ms to minimize.
[2023-03-20 00:17:59] [INFO ] Deduced a trap composed of 19 places in 236 ms of which 1 ms to minimize.
[2023-03-20 00:17:59] [INFO ] Deduced a trap composed of 29 places in 216 ms of which 1 ms to minimize.
[2023-03-20 00:17:59] [INFO ] Deduced a trap composed of 25 places in 191 ms of which 1 ms to minimize.
[2023-03-20 00:17:59] [INFO ] Deduced a trap composed of 23 places in 226 ms of which 1 ms to minimize.
[2023-03-20 00:18:00] [INFO ] Deduced a trap composed of 22 places in 209 ms of which 1 ms to minimize.
[2023-03-20 00:18:00] [INFO ] Deduced a trap composed of 27 places in 185 ms of which 0 ms to minimize.
[2023-03-20 00:18:00] [INFO ] Deduced a trap composed of 20 places in 396 ms of which 2 ms to minimize.
[2023-03-20 00:18:00] [INFO ] Deduced a trap composed of 35 places in 198 ms of which 1 ms to minimize.
[2023-03-20 00:18:01] [INFO ] Deduced a trap composed of 36 places in 207 ms of which 0 ms to minimize.
[2023-03-20 00:18:01] [INFO ] Deduced a trap composed of 22 places in 188 ms of which 1 ms to minimize.
[2023-03-20 00:18:01] [INFO ] Deduced a trap composed of 33 places in 166 ms of which 1 ms to minimize.
[2023-03-20 00:18:01] [INFO ] Deduced a trap composed of 32 places in 184 ms of which 1 ms to minimize.
[2023-03-20 00:18:02] [INFO ] Deduced a trap composed of 30 places in 187 ms of which 1 ms to minimize.
[2023-03-20 00:18:02] [INFO ] Deduced a trap composed of 28 places in 176 ms of which 0 ms to minimize.
[2023-03-20 00:18:02] [INFO ] Deduced a trap composed of 22 places in 178 ms of which 0 ms to minimize.
[2023-03-20 00:18:02] [INFO ] Deduced a trap composed of 26 places in 186 ms of which 1 ms to minimize.
[2023-03-20 00:18:03] [INFO ] Deduced a trap composed of 22 places in 195 ms of which 1 ms to minimize.
[2023-03-20 00:18:03] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 1 ms to minimize.
[2023-03-20 00:18:03] [INFO ] Deduced a trap composed of 28 places in 216 ms of which 0 ms to minimize.
[2023-03-20 00:18:03] [INFO ] Deduced a trap composed of 27 places in 148 ms of which 1 ms to minimize.
[2023-03-20 00:18:03] [INFO ] Deduced a trap composed of 35 places in 171 ms of which 1 ms to minimize.
[2023-03-20 00:18:04] [INFO ] Deduced a trap composed of 34 places in 214 ms of which 1 ms to minimize.
[2023-03-20 00:18:04] [INFO ] Deduced a trap composed of 29 places in 226 ms of which 1 ms to minimize.
[2023-03-20 00:18:04] [INFO ] Deduced a trap composed of 34 places in 136 ms of which 1 ms to minimize.
[2023-03-20 00:18:04] [INFO ] Deduced a trap composed of 32 places in 144 ms of which 1 ms to minimize.
[2023-03-20 00:18:05] [INFO ] Deduced a trap composed of 29 places in 232 ms of which 1 ms to minimize.
[2023-03-20 00:18:05] [INFO ] Deduced a trap composed of 21 places in 160 ms of which 0 ms to minimize.
[2023-03-20 00:18:05] [INFO ] Deduced a trap composed of 32 places in 158 ms of which 1 ms to minimize.
[2023-03-20 00:18:05] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 0 ms to minimize.
[2023-03-20 00:18:05] [INFO ] Deduced a trap composed of 33 places in 123 ms of which 0 ms to minimize.
[2023-03-20 00:18:06] [INFO ] Deduced a trap composed of 26 places in 567 ms of which 4 ms to minimize.
[2023-03-20 00:18:06] [INFO ] Deduced a trap composed of 31 places in 142 ms of which 1 ms to minimize.
[2023-03-20 00:18:06] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 9060 ms
[2023-03-20 00:18:06] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 1 ms to minimize.
[2023-03-20 00:18:07] [INFO ] Deduced a trap composed of 12 places in 324 ms of which 1 ms to minimize.
[2023-03-20 00:18:07] [INFO ] Deduced a trap composed of 18 places in 186 ms of which 0 ms to minimize.
[2023-03-20 00:18:07] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 0 ms to minimize.
[2023-03-20 00:18:07] [INFO ] Deduced a trap composed of 18 places in 137 ms of which 1 ms to minimize.
[2023-03-20 00:18:07] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 0 ms to minimize.
[2023-03-20 00:18:08] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1366 ms
[2023-03-20 00:18:08] [INFO ] Deduced a trap composed of 17 places in 156 ms of which 1 ms to minimize.
[2023-03-20 00:18:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 225 ms
[2023-03-20 00:18:08] [INFO ] Deduced a trap composed of 28 places in 158 ms of which 1 ms to minimize.
[2023-03-20 00:18:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 237 ms
[2023-03-20 00:18:08] [INFO ] After 11982ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 334 ms.
[2023-03-20 00:18:09] [INFO ] After 12873ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 319 ms.
Support contains 5 out of 1181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1181/1181 places, 1081/1081 transitions.
Drop transitions removed 235 transitions
Trivial Post-agglo rules discarded 235 transitions
Performed 235 trivial Post agglomeration. Transition count delta: 235
Iterating post reduction 0 with 235 rules applied. Total rules applied 235 place count 1181 transition count 846
Reduce places removed 235 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 238 rules applied. Total rules applied 473 place count 946 transition count 843
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 476 place count 943 transition count 843
Performed 160 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 160 Pre rules applied. Total rules applied 476 place count 943 transition count 683
Deduced a syphon composed of 160 places in 0 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 3 with 320 rules applied. Total rules applied 796 place count 783 transition count 683
Performed 336 Post agglomeration using F-continuation condition.Transition count delta: 336
Deduced a syphon composed of 336 places in 0 ms
Reduce places removed 336 places and 0 transitions.
Iterating global reduction 3 with 672 rules applied. Total rules applied 1468 place count 447 transition count 347
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1469 place count 447 transition count 346
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1471 place count 446 transition count 345
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 1587 place count 388 transition count 383
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1588 place count 388 transition count 382
Partial Free-agglomeration rule applied 19 times.
Drop transitions removed 19 transitions
Iterating global reduction 5 with 19 rules applied. Total rules applied 1607 place count 388 transition count 382
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1608 place count 387 transition count 381
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1610 place count 385 transition count 381
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1610 place count 385 transition count 380
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1612 place count 384 transition count 380
Applied a total of 1612 rules in 73 ms. Remains 384 /1181 variables (removed 797) and now considering 380/1081 (removed 701) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 384/1181 places, 380/1081 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 380 rows 384 cols
[2023-03-20 00:18:09] [INFO ] Computed 179 place invariants in 1 ms
[2023-03-20 00:18:09] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:18:09] [INFO ] [Nat]Absence check using 179 positive place invariants in 22 ms returned sat
[2023-03-20 00:18:09] [INFO ] After 125ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:18:09] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-20 00:18:09] [INFO ] After 32ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 00:18:10] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2023-03-20 00:18:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2023-03-20 00:18:10] [INFO ] After 131ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-20 00:18:10] [INFO ] After 398ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 5 out of 384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 380/380 transitions.
Applied a total of 0 rules in 9 ms. Remains 384 /384 variables (removed 0) and now considering 380/380 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 384/384 places, 380/380 transitions.
Finished random walk after 6557 steps, including 1 resets, run visited all 1 properties in 38 ms. (steps per millisecond=172 )
Knowledge obtained : [(AND (NOT p2) p1 p0), true]
False Knowledge obtained : [(F (AND (NOT p0) p2 p1)), (F (NOT (AND p0 (NOT p2) p1))), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1)), (F (OR (AND p0 p2) (AND p2 (NOT p1)))), (F (AND (NOT p0) (NOT p2) p1)), (F (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p1))))), (F p2)]
Knowledge based reduction with 2 factoid took 390 ms. Reduced automaton from 9 states, 15 edges and 3 AP (stutter sensitive) to 9 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 471 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, p1, (NOT p2)]
Stuttering acceptance computed with spot in 689 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, p1, (NOT p2)]
// Phase 1: matrix 1081 rows 1181 cols
[2023-03-20 00:18:11] [INFO ] Computed 181 place invariants in 9 ms
[2023-03-20 00:18:12] [INFO ] [Real]Absence check using 181 positive place invariants in 201 ms returned sat
[2023-03-20 00:18:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 00:18:15] [INFO ] [Real]Absence check using state equation in 3028 ms returned sat
[2023-03-20 00:18:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 00:18:16] [INFO ] [Nat]Absence check using 181 positive place invariants in 139 ms returned sat
[2023-03-20 00:18:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 00:18:19] [INFO ] [Nat]Absence check using state equation in 3101 ms returned sat
[2023-03-20 00:18:19] [INFO ] Computed and/alt/rep : 1080/1621/1080 causal constraints (skipped 0 transitions) in 79 ms.
[2023-03-20 00:18:31] [INFO ] Deduced a trap composed of 13 places in 643 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 00:18:31] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p2)
Could not prove EG (NOT p2)
Support contains 5 out of 1181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1181/1181 places, 1081/1081 transitions.
Applied a total of 0 rules in 32 ms. Remains 1181 /1181 variables (removed 0) and now considering 1081/1081 (removed 0) transitions.
[2023-03-20 00:18:31] [INFO ] Invariant cache hit.
[2023-03-20 00:18:31] [INFO ] Implicit Places using invariants in 355 ms returned []
[2023-03-20 00:18:31] [INFO ] Invariant cache hit.
[2023-03-20 00:18:32] [INFO ] Implicit Places using invariants and state equation in 1042 ms returned []
Implicit Place search using SMT with State Equation took 1413 ms to find 0 implicit places.
[2023-03-20 00:18:32] [INFO ] Invariant cache hit.
[2023-03-20 00:18:33] [INFO ] Dead Transitions using invariants and state equation in 591 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2036 ms. Remains : 1181/1181 places, 1081/1081 transitions.
Computed a total of 318 stabilizing places and 318 stable transitions
Computed a total of 318 stabilizing places and 318 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 128 ms. Reduced automaton from 9 states, 15 edges and 3 AP (stutter sensitive) to 9 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 577 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, p1, (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 8) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 00:18:34] [INFO ] Invariant cache hit.
[2023-03-20 00:18:34] [INFO ] After 191ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:18:34] [INFO ] [Nat]Absence check using 181 positive place invariants in 69 ms returned sat
[2023-03-20 00:18:35] [INFO ] After 1088ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:18:36] [INFO ] Deduced a trap composed of 26 places in 297 ms of which 0 ms to minimize.
[2023-03-20 00:18:36] [INFO ] Deduced a trap composed of 20 places in 331 ms of which 1 ms to minimize.
[2023-03-20 00:18:36] [INFO ] Deduced a trap composed of 23 places in 242 ms of which 1 ms to minimize.
[2023-03-20 00:18:37] [INFO ] Deduced a trap composed of 20 places in 195 ms of which 1 ms to minimize.
[2023-03-20 00:18:37] [INFO ] Deduced a trap composed of 21 places in 225 ms of which 0 ms to minimize.
[2023-03-20 00:18:37] [INFO ] Deduced a trap composed of 17 places in 202 ms of which 1 ms to minimize.
[2023-03-20 00:18:37] [INFO ] Deduced a trap composed of 33 places in 239 ms of which 0 ms to minimize.
[2023-03-20 00:18:38] [INFO ] Deduced a trap composed of 23 places in 228 ms of which 1 ms to minimize.
[2023-03-20 00:18:38] [INFO ] Deduced a trap composed of 22 places in 469 ms of which 1 ms to minimize.
[2023-03-20 00:18:38] [INFO ] Deduced a trap composed of 32 places in 221 ms of which 0 ms to minimize.
[2023-03-20 00:18:39] [INFO ] Deduced a trap composed of 30 places in 186 ms of which 1 ms to minimize.
[2023-03-20 00:18:39] [INFO ] Deduced a trap composed of 26 places in 183 ms of which 0 ms to minimize.
[2023-03-20 00:18:39] [INFO ] Deduced a trap composed of 26 places in 194 ms of which 0 ms to minimize.
[2023-03-20 00:18:39] [INFO ] Deduced a trap composed of 28 places in 230 ms of which 0 ms to minimize.
[2023-03-20 00:18:40] [INFO ] Deduced a trap composed of 27 places in 174 ms of which 1 ms to minimize.
[2023-03-20 00:18:40] [INFO ] Deduced a trap composed of 28 places in 153 ms of which 0 ms to minimize.
[2023-03-20 00:18:40] [INFO ] Deduced a trap composed of 29 places in 134 ms of which 1 ms to minimize.
[2023-03-20 00:18:40] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 0 ms to minimize.
[2023-03-20 00:18:40] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 1 ms to minimize.
[2023-03-20 00:18:40] [INFO ] Deduced a trap composed of 29 places in 134 ms of which 0 ms to minimize.
[2023-03-20 00:18:41] [INFO ] Deduced a trap composed of 29 places in 131 ms of which 0 ms to minimize.
[2023-03-20 00:18:41] [INFO ] Deduced a trap composed of 36 places in 107 ms of which 0 ms to minimize.
[2023-03-20 00:18:41] [INFO ] Deduced a trap composed of 32 places in 173 ms of which 0 ms to minimize.
[2023-03-20 00:18:41] [INFO ] Deduced a trap composed of 21 places in 171 ms of which 1 ms to minimize.
[2023-03-20 00:18:41] [INFO ] Deduced a trap composed of 25 places in 120 ms of which 1 ms to minimize.
[2023-03-20 00:18:41] [INFO ] Deduced a trap composed of 33 places in 172 ms of which 1 ms to minimize.
[2023-03-20 00:18:42] [INFO ] Deduced a trap composed of 33 places in 129 ms of which 1 ms to minimize.
[2023-03-20 00:18:42] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 1 ms to minimize.
[2023-03-20 00:18:42] [INFO ] Deduced a trap composed of 31 places in 162 ms of which 1 ms to minimize.
[2023-03-20 00:18:42] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 1 ms to minimize.
[2023-03-20 00:18:42] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 0 ms to minimize.
[2023-03-20 00:18:42] [INFO ] Deduced a trap composed of 35 places in 95 ms of which 0 ms to minimize.
[2023-03-20 00:18:43] [INFO ] Deduced a trap composed of 34 places in 190 ms of which 1 ms to minimize.
[2023-03-20 00:18:43] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 7360 ms
[2023-03-20 00:18:43] [INFO ] After 8484ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-03-20 00:18:43] [INFO ] After 8849ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 5 out of 1181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1181/1181 places, 1081/1081 transitions.
Drop transitions removed 235 transitions
Trivial Post-agglo rules discarded 235 transitions
Performed 235 trivial Post agglomeration. Transition count delta: 235
Iterating post reduction 0 with 235 rules applied. Total rules applied 235 place count 1181 transition count 846
Reduce places removed 235 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 238 rules applied. Total rules applied 473 place count 946 transition count 843
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 476 place count 943 transition count 843
Performed 160 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 160 Pre rules applied. Total rules applied 476 place count 943 transition count 683
Deduced a syphon composed of 160 places in 0 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 3 with 320 rules applied. Total rules applied 796 place count 783 transition count 683
Performed 336 Post agglomeration using F-continuation condition.Transition count delta: 336
Deduced a syphon composed of 336 places in 1 ms
Reduce places removed 336 places and 0 transitions.
Iterating global reduction 3 with 672 rules applied. Total rules applied 1468 place count 447 transition count 347
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1469 place count 447 transition count 346
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1471 place count 446 transition count 345
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 1587 place count 388 transition count 383
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1588 place count 388 transition count 382
Partial Free-agglomeration rule applied 19 times.
Drop transitions removed 19 transitions
Iterating global reduction 5 with 19 rules applied. Total rules applied 1607 place count 388 transition count 382
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1608 place count 387 transition count 381
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1610 place count 385 transition count 381
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1610 place count 385 transition count 380
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1612 place count 384 transition count 380
Applied a total of 1612 rules in 123 ms. Remains 384 /1181 variables (removed 797) and now considering 380/1081 (removed 701) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 384/1181 places, 380/1081 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 530701 steps, run timeout after 3112 ms. (steps per millisecond=170 ) properties seen :{}
Probabilistic random walk after 530701 steps, saw 304572 distinct states, run finished after 3112 ms. (steps per millisecond=170 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 380 rows 384 cols
[2023-03-20 00:18:46] [INFO ] Computed 179 place invariants in 1 ms
[2023-03-20 00:18:46] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:18:46] [INFO ] [Nat]Absence check using 179 positive place invariants in 19 ms returned sat
[2023-03-20 00:18:46] [INFO ] After 239ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:18:46] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-20 00:18:47] [INFO ] After 44ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 00:18:47] [INFO ] Deduced a trap composed of 3 places in 134 ms of which 1 ms to minimize.
[2023-03-20 00:18:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 167 ms
[2023-03-20 00:18:47] [INFO ] After 250ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-20 00:18:47] [INFO ] After 592ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 380/380 transitions.
Applied a total of 0 rules in 6 ms. Remains 384 /384 variables (removed 0) and now considering 380/380 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 384/384 places, 380/380 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 380/380 transitions.
Applied a total of 0 rules in 4 ms. Remains 384 /384 variables (removed 0) and now considering 380/380 (removed 0) transitions.
[2023-03-20 00:18:47] [INFO ] Invariant cache hit.
[2023-03-20 00:18:47] [INFO ] Implicit Places using invariants in 357 ms returned [373]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 363 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 383/384 places, 380/380 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 382 transition count 379
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 382 transition count 379
Applied a total of 2 rules in 7 ms. Remains 382 /383 variables (removed 1) and now considering 379/380 (removed 1) transitions.
// Phase 1: matrix 379 rows 382 cols
[2023-03-20 00:18:47] [INFO ] Computed 178 place invariants in 0 ms
[2023-03-20 00:18:47] [INFO ] Implicit Places using invariants in 295 ms returned []
[2023-03-20 00:18:47] [INFO ] Invariant cache hit.
[2023-03-20 00:18:48] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 00:18:48] [INFO ] Implicit Places using invariants and state equation in 537 ms returned []
Implicit Place search using SMT with State Equation took 834 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 382/384 places, 379/380 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1208 ms. Remains : 382/384 places, 379/380 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 542769 steps, run timeout after 3001 ms. (steps per millisecond=180 ) properties seen :{}
Probabilistic random walk after 542769 steps, saw 314678 distinct states, run finished after 3001 ms. (steps per millisecond=180 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 00:18:51] [INFO ] Invariant cache hit.
[2023-03-20 00:18:51] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:18:51] [INFO ] [Nat]Absence check using 178 positive place invariants in 32 ms returned sat
[2023-03-20 00:18:52] [INFO ] After 226ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:18:52] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 00:18:52] [INFO ] After 19ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 00:18:52] [INFO ] After 92ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-20 00:18:52] [INFO ] After 476ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 5 out of 382 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 382/382 places, 379/379 transitions.
Applied a total of 0 rules in 8 ms. Remains 382 /382 variables (removed 0) and now considering 379/379 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 382/382 places, 379/379 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 382/382 places, 379/379 transitions.
Applied a total of 0 rules in 7 ms. Remains 382 /382 variables (removed 0) and now considering 379/379 (removed 0) transitions.
[2023-03-20 00:18:52] [INFO ] Invariant cache hit.
[2023-03-20 00:18:52] [INFO ] Implicit Places using invariants in 303 ms returned []
[2023-03-20 00:18:52] [INFO ] Invariant cache hit.
[2023-03-20 00:18:52] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 00:18:53] [INFO ] Implicit Places using invariants and state equation in 607 ms returned []
Implicit Place search using SMT with State Equation took 912 ms to find 0 implicit places.
[2023-03-20 00:18:53] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-20 00:18:53] [INFO ] Invariant cache hit.
[2023-03-20 00:18:53] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1160 ms. Remains : 382/382 places, 379/379 transitions.
Partial Free-agglomeration rule applied 41 times.
Drop transitions removed 41 transitions
Iterating global reduction 0 with 41 rules applied. Total rules applied 41 place count 382 transition count 379
Applied a total of 41 rules in 8 ms. Remains 382 /382 variables (removed 0) and now considering 379/379 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 379 rows 382 cols
[2023-03-20 00:18:53] [INFO ] Computed 178 place invariants in 1 ms
[2023-03-20 00:18:53] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:18:53] [INFO ] [Nat]Absence check using 178 positive place invariants in 61 ms returned sat
[2023-03-20 00:18:53] [INFO ] After 220ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:18:53] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-20 00:18:53] [INFO ] After 38ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 00:18:53] [INFO ] After 69ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-03-20 00:18:53] [INFO ] After 485ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 (NOT p2) p1), true]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p2) p1))), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1)), (F (OR (AND p0 p2) (AND p2 (NOT p1)))), (F (AND (NOT p0) (NOT p2) p1)), (F (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p1))))), (F p2)]
Knowledge based reduction with 2 factoid took 356 ms. Reduced automaton from 9 states, 15 edges and 3 AP (stutter sensitive) to 9 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 387 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, p1, (NOT p2)]
Stuttering acceptance computed with spot in 444 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, p1, (NOT p2)]
// Phase 1: matrix 1081 rows 1181 cols
[2023-03-20 00:18:55] [INFO ] Computed 181 place invariants in 7 ms
[2023-03-20 00:18:55] [INFO ] [Real]Absence check using 181 positive place invariants in 266 ms returned sat
[2023-03-20 00:18:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 00:18:58] [INFO ] [Real]Absence check using state equation in 2642 ms returned sat
[2023-03-20 00:18:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 00:18:59] [INFO ] [Nat]Absence check using 181 positive place invariants in 116 ms returned sat
[2023-03-20 00:18:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 00:19:02] [INFO ] [Nat]Absence check using state equation in 2877 ms returned sat
[2023-03-20 00:19:02] [INFO ] Computed and/alt/rep : 1080/1621/1080 causal constraints (skipped 0 transitions) in 88 ms.
[2023-03-20 00:19:13] [INFO ] Added : 530 causal constraints over 106 iterations in 11401 ms. Result :unknown
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 603 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, p1, (NOT p2)]
Product exploration explored 100000 steps with 1401 reset in 314 ms.
Product exploration explored 100000 steps with 1378 reset in 317 ms.
Applying partial POR strategy [false, false, false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 716 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, p1, (NOT p2)]
Support contains 5 out of 1181 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1181/1181 places, 1081/1081 transitions.
Performed 238 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 238 rules applied. Total rules applied 238 place count 1181 transition count 1081
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 80 Pre rules applied. Total rules applied 238 place count 1181 transition count 1141
Deduced a syphon composed of 318 places in 2 ms
Iterating global reduction 1 with 80 rules applied. Total rules applied 318 place count 1181 transition count 1141
Performed 397 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 715 places in 1 ms
Iterating global reduction 1 with 397 rules applied. Total rules applied 715 place count 1181 transition count 1141
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 716 place count 1181 transition count 1140
Renaming transitions due to excessive name length > 1024 char.
Discarding 159 places :
Symmetric choice reduction at 2 with 159 rule applications. Total rules 875 place count 1022 transition count 981
Deduced a syphon composed of 556 places in 1 ms
Iterating global reduction 2 with 159 rules applied. Total rules applied 1034 place count 1022 transition count 981
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 557 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1035 place count 1022 transition count 981
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1037 place count 1020 transition count 979
Deduced a syphon composed of 555 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1039 place count 1020 transition count 979
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: -410
Deduced a syphon composed of 632 places in 0 ms
Iterating global reduction 2 with 77 rules applied. Total rules applied 1116 place count 1020 transition count 1389
Discarding 77 places :
Symmetric choice reduction at 2 with 77 rule applications. Total rules 1193 place count 943 transition count 1235
Deduced a syphon composed of 555 places in 1 ms
Iterating global reduction 2 with 77 rules applied. Total rules applied 1270 place count 943 transition count 1235
Deduced a syphon composed of 555 places in 0 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 1279 place count 943 transition count 1226
Deduced a syphon composed of 555 places in 0 ms
Applied a total of 1279 rules in 361 ms. Remains 943 /1181 variables (removed 238) and now considering 1226/1081 (removed -145) transitions.
[2023-03-20 00:19:16] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 1226 rows 943 cols
[2023-03-20 00:19:16] [INFO ] Computed 181 place invariants in 10 ms
[2023-03-20 00:19:16] [INFO ] Dead Transitions using invariants and state equation in 607 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 943/1181 places, 1226/1081 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 996 ms. Remains : 943/1181 places, 1226/1081 transitions.
Support contains 5 out of 1181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1181/1181 places, 1081/1081 transitions.
Applied a total of 0 rules in 41 ms. Remains 1181 /1181 variables (removed 0) and now considering 1081/1081 (removed 0) transitions.
// Phase 1: matrix 1081 rows 1181 cols
[2023-03-20 00:19:16] [INFO ] Computed 181 place invariants in 2 ms
[2023-03-20 00:19:17] [INFO ] Implicit Places using invariants in 339 ms returned []
[2023-03-20 00:19:17] [INFO ] Invariant cache hit.
[2023-03-20 00:19:18] [INFO ] Implicit Places using invariants and state equation in 1033 ms returned []
Implicit Place search using SMT with State Equation took 1376 ms to find 0 implicit places.
[2023-03-20 00:19:18] [INFO ] Invariant cache hit.
[2023-03-20 00:19:18] [INFO ] Dead Transitions using invariants and state equation in 721 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2139 ms. Remains : 1181/1181 places, 1081/1081 transitions.
Treatment of property ShieldIIPt-PT-020B-LTLCardinality-15 finished in 87588 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Found a Lengthening insensitive property : ShieldIIPt-PT-020B-LTLCardinality-07
Stuttering acceptance computed with spot in 182 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1189 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1189/1189 places, 1089/1089 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 238 transitions
Trivial Post-agglo rules discarded 238 transitions
Performed 238 trivial Post agglomeration. Transition count delta: 238
Iterating post reduction 0 with 238 rules applied. Total rules applied 238 place count 1188 transition count 850
Reduce places removed 238 places and 0 transitions.
Iterating post reduction 1 with 238 rules applied. Total rules applied 476 place count 950 transition count 850
Performed 157 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 157 Pre rules applied. Total rules applied 476 place count 950 transition count 693
Deduced a syphon composed of 157 places in 1 ms
Reduce places removed 157 places and 0 transitions.
Iterating global reduction 2 with 314 rules applied. Total rules applied 790 place count 793 transition count 693
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 797 place count 786 transition count 686
Iterating global reduction 2 with 7 rules applied. Total rules applied 804 place count 786 transition count 686
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 804 place count 786 transition count 680
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 816 place count 780 transition count 680
Performed 337 Post agglomeration using F-continuation condition.Transition count delta: 337
Deduced a syphon composed of 337 places in 0 ms
Reduce places removed 337 places and 0 transitions.
Iterating global reduction 2 with 674 rules applied. Total rules applied 1490 place count 443 transition count 343
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1491 place count 443 transition count 342
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1493 place count 442 transition count 341
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1611 place count 383 transition count 380
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1613 place count 381 transition count 378
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1615 place count 379 transition count 378
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1615 place count 379 transition count 377
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1617 place count 378 transition count 377
Applied a total of 1617 rules in 184 ms. Remains 378 /1189 variables (removed 811) and now considering 377/1089 (removed 712) transitions.
// Phase 1: matrix 377 rows 378 cols
[2023-03-20 00:19:19] [INFO ] Computed 179 place invariants in 1 ms
[2023-03-20 00:19:19] [INFO ] Implicit Places using invariants in 362 ms returned [367]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 374 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 377/1189 places, 377/1089 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 376 transition count 376
Applied a total of 2 rules in 8 ms. Remains 376 /377 variables (removed 1) and now considering 376/377 (removed 1) transitions.
// Phase 1: matrix 376 rows 376 cols
[2023-03-20 00:19:19] [INFO ] Computed 178 place invariants in 2 ms
[2023-03-20 00:19:19] [INFO ] Implicit Places using invariants in 285 ms returned []
[2023-03-20 00:19:19] [INFO ] Invariant cache hit.
[2023-03-20 00:19:20] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 737 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 376/1189 places, 376/1089 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1303 ms. Remains : 376/1189 places, 376/1089 transitions.
Running random walk in product with property : ShieldIIPt-PT-020B-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (EQ s67 0) (EQ s348 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 377 ms.
Entered a terminal (fully accepting) state of product in 30755 steps with 0 reset in 142 ms.
Treatment of property ShieldIIPt-PT-020B-LTLCardinality-07 finished in 2099 ms.
FORMULA ShieldIIPt-PT-020B-LTLCardinality-07 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(((p0 U !p1) U G(p2))))))))'
Found a Lengthening insensitive property : ShieldIIPt-PT-020B-LTLCardinality-15
Stuttering acceptance computed with spot in 636 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, p1, (NOT p2)]
Support contains 5 out of 1189 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1189/1189 places, 1089/1089 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 234 transitions
Trivial Post-agglo rules discarded 234 transitions
Performed 234 trivial Post agglomeration. Transition count delta: 234
Iterating post reduction 0 with 234 rules applied. Total rules applied 234 place count 1188 transition count 854
Reduce places removed 234 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 237 rules applied. Total rules applied 471 place count 954 transition count 851
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 474 place count 951 transition count 851
Performed 156 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 156 Pre rules applied. Total rules applied 474 place count 951 transition count 695
Deduced a syphon composed of 156 places in 2 ms
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 3 with 312 rules applied. Total rules applied 786 place count 795 transition count 695
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 793 place count 788 transition count 688
Iterating global reduction 3 with 7 rules applied. Total rules applied 800 place count 788 transition count 688
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 800 place count 788 transition count 682
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 812 place count 782 transition count 682
Performed 334 Post agglomeration using F-continuation condition.Transition count delta: 334
Deduced a syphon composed of 334 places in 0 ms
Reduce places removed 334 places and 0 transitions.
Iterating global reduction 3 with 668 rules applied. Total rules applied 1480 place count 448 transition count 348
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1481 place count 448 transition count 347
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1483 place count 447 transition count 346
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 1599 place count 389 transition count 384
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1601 place count 387 transition count 382
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1603 place count 385 transition count 382
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1603 place count 385 transition count 381
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1605 place count 384 transition count 381
Applied a total of 1605 rules in 129 ms. Remains 384 /1189 variables (removed 805) and now considering 381/1089 (removed 708) transitions.
// Phase 1: matrix 381 rows 384 cols
[2023-03-20 00:19:21] [INFO ] Computed 179 place invariants in 2 ms
[2023-03-20 00:19:22] [INFO ] Implicit Places using invariants in 439 ms returned [373]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 440 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 383/1189 places, 381/1089 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 382 transition count 380
Applied a total of 2 rules in 7 ms. Remains 382 /383 variables (removed 1) and now considering 380/381 (removed 1) transitions.
// Phase 1: matrix 380 rows 382 cols
[2023-03-20 00:19:22] [INFO ] Computed 178 place invariants in 0 ms
[2023-03-20 00:19:22] [INFO ] Implicit Places using invariants in 237 ms returned []
[2023-03-20 00:19:22] [INFO ] Invariant cache hit.
[2023-03-20 00:19:22] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 00:19:23] [INFO ] Implicit Places using invariants and state equation in 510 ms returned []
Implicit Place search using SMT with State Equation took 763 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 382/1189 places, 380/1089 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1339 ms. Remains : 382/1189 places, 380/1089 transitions.
Running random walk in product with property : ShieldIIPt-PT-020B-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(OR (AND p2 (NOT p1)) (AND p2 p0)), acceptance={} source=5 dest: 5}, { cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p2) p0)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=5 dest: 7}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=5 dest: 8}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 6}, { cond=(AND p1 p0), acceptance={0} source=7 dest: 7}], [{ cond=(NOT p2), acceptance={} source=8 dest: 6}, { cond=p2, acceptance={} source=8 dest: 8}]], initial=0, aps=[p2:(EQ s197 1), p1:(OR (EQ s340 0) (EQ s284 1)), p0:(OR (EQ s119 0) (EQ s367 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
Treatment of property ShieldIIPt-PT-020B-LTLCardinality-15 finished in 2132 ms.
FORMULA ShieldIIPt-PT-020B-LTLCardinality-15 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2023-03-20 00:19:23] [INFO ] Flatten gal took : 38 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 194323 ms.
ITS solved all properties within timeout

BK_STOP 1679271563339

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-PT-020B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is ShieldIIPt-PT-020B, 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 r391-oct2-167903715100283"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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