Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r222-tall-165286025000332.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldIIPt-PT-050B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025000332
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 5.9K Apr 29 18:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Apr 29 18:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 29 18:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 29 18:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 9 08:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 860K May 10 09:34 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-050B-LTLFireability-00
FORMULA_NAME ShieldIIPt-PT-050B-LTLFireability-01
FORMULA_NAME ShieldIIPt-PT-050B-LTLFireability-02
FORMULA_NAME ShieldIIPt-PT-050B-LTLFireability-03
FORMULA_NAME ShieldIIPt-PT-050B-LTLFireability-04
FORMULA_NAME ShieldIIPt-PT-050B-LTLFireability-05
FORMULA_NAME ShieldIIPt-PT-050B-LTLFireability-06
FORMULA_NAME ShieldIIPt-PT-050B-LTLFireability-07
FORMULA_NAME ShieldIIPt-PT-050B-LTLFireability-08
FORMULA_NAME ShieldIIPt-PT-050B-LTLFireability-09
FORMULA_NAME ShieldIIPt-PT-050B-LTLFireability-10
FORMULA_NAME ShieldIIPt-PT-050B-LTLFireability-11
FORMULA_NAME ShieldIIPt-PT-050B-LTLFireability-12
FORMULA_NAME ShieldIIPt-PT-050B-LTLFireability-13
FORMULA_NAME ShieldIIPt-PT-050B-LTLFireability-14
FORMULA_NAME ShieldIIPt-PT-050B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652966474642

Running Version 202205111006
[2022-05-19 13:21:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-19 13:21:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 13:21:16] [INFO ] Load time of PNML (sax parser for PT used): 227 ms
[2022-05-19 13:21:16] [INFO ] Transformed 3503 places.
[2022-05-19 13:21:16] [INFO ] Transformed 3253 transitions.
[2022-05-19 13:21:16] [INFO ] Found NUPN structural information;
[2022-05-19 13:21:16] [INFO ] Parsed PT model containing 3503 places and 3253 transitions in 463 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ShieldIIPt-PT-050B-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-050B-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-050B-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-050B-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 3503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3503/3503 places, 3253/3253 transitions.
Discarding 544 places :
Symmetric choice reduction at 0 with 544 rule applications. Total rules 544 place count 2959 transition count 2709
Iterating global reduction 0 with 544 rules applied. Total rules applied 1088 place count 2959 transition count 2709
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1089 place count 2958 transition count 2708
Iterating global reduction 0 with 1 rules applied. Total rules applied 1090 place count 2958 transition count 2708
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1091 place count 2957 transition count 2707
Iterating global reduction 0 with 1 rules applied. Total rules applied 1092 place count 2957 transition count 2707
Applied a total of 1092 rules in 1313 ms. Remains 2957 /3503 variables (removed 546) and now considering 2707/3253 (removed 546) transitions.
// Phase 1: matrix 2707 rows 2957 cols
[2022-05-19 13:21:17] [INFO ] Computed 451 place invariants in 48 ms
[2022-05-19 13:21:18] [INFO ] Implicit Places using invariants in 1073 ms returned []
// Phase 1: matrix 2707 rows 2957 cols
[2022-05-19 13:21:18] [INFO ] Computed 451 place invariants in 12 ms
[2022-05-19 13:21:21] [INFO ] Implicit Places using invariants and state equation in 2833 ms returned []
Implicit Place search using SMT with State Equation took 3942 ms to find 0 implicit places.
// Phase 1: matrix 2707 rows 2957 cols
[2022-05-19 13:21:21] [INFO ] Computed 451 place invariants in 11 ms
[2022-05-19 13:21:23] [INFO ] Dead Transitions using invariants and state equation in 1734 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2957/3503 places, 2707/3253 transitions.
Finished structural reductions, in 1 iterations. Remains : 2957/3503 places, 2707/3253 transitions.
Support contains 42 out of 2957 places after structural reductions.
[2022-05-19 13:21:23] [INFO ] Flatten gal took : 186 ms
[2022-05-19 13:21:23] [INFO ] Flatten gal took : 119 ms
[2022-05-19 13:21:24] [INFO ] Input system was already deterministic with 2707 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 621 ms. (steps per millisecond=16 ) properties (out of 31) seen :11
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
// Phase 1: matrix 2707 rows 2957 cols
[2022-05-19 13:21:24] [INFO ] Computed 451 place invariants in 9 ms
[2022-05-19 13:21:26] [INFO ] [Real]Absence check using 451 positive place invariants in 162 ms returned sat
[2022-05-19 13:21:26] [INFO ] After 1497ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2022-05-19 13:21:27] [INFO ] [Nat]Absence check using 451 positive place invariants in 154 ms returned sat
[2022-05-19 13:21:31] [INFO ] After 3300ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :20
[2022-05-19 13:21:32] [INFO ] Deduced a trap composed of 16 places in 624 ms of which 8 ms to minimize.
[2022-05-19 13:21:33] [INFO ] Deduced a trap composed of 19 places in 658 ms of which 5 ms to minimize.
[2022-05-19 13:21:34] [INFO ] Deduced a trap composed of 22 places in 579 ms of which 5 ms to minimize.
[2022-05-19 13:21:34] [INFO ] Deduced a trap composed of 26 places in 649 ms of which 12 ms to minimize.
[2022-05-19 13:21:35] [INFO ] Deduced a trap composed of 23 places in 605 ms of which 3 ms to minimize.
[2022-05-19 13:21:36] [INFO ] Deduced a trap composed of 17 places in 624 ms of which 2 ms to minimize.
[2022-05-19 13:21:36] [INFO ] Deduced a trap composed of 26 places in 659 ms of which 2 ms to minimize.
[2022-05-19 13:21:37] [INFO ] Deduced a trap composed of 32 places in 595 ms of which 2 ms to minimize.
[2022-05-19 13:21:38] [INFO ] Deduced a trap composed of 19 places in 590 ms of which 2 ms to minimize.
[2022-05-19 13:21:39] [INFO ] Deduced a trap composed of 21 places in 600 ms of which 1 ms to minimize.
[2022-05-19 13:21:39] [INFO ] Deduced a trap composed of 25 places in 580 ms of which 1 ms to minimize.
[2022-05-19 13:21:40] [INFO ] Deduced a trap composed of 29 places in 564 ms of which 2 ms to minimize.
[2022-05-19 13:21:41] [INFO ] Deduced a trap composed of 36 places in 557 ms of which 1 ms to minimize.
[2022-05-19 13:21:41] [INFO ] Deduced a trap composed of 23 places in 525 ms of which 1 ms to minimize.
[2022-05-19 13:21:42] [INFO ] Deduced a trap composed of 36 places in 528 ms of which 1 ms to minimize.
[2022-05-19 13:21:42] [INFO ] Deduced a trap composed of 35 places in 520 ms of which 1 ms to minimize.
[2022-05-19 13:21:43] [INFO ] Deduced a trap composed of 18 places in 512 ms of which 1 ms to minimize.
[2022-05-19 13:21:44] [INFO ] Deduced a trap composed of 28 places in 500 ms of which 1 ms to minimize.
[2022-05-19 13:21:44] [INFO ] Deduced a trap composed of 19 places in 499 ms of which 1 ms to minimize.
[2022-05-19 13:21:45] [INFO ] Deduced a trap composed of 39 places in 487 ms of which 2 ms to minimize.
[2022-05-19 13:21:45] [INFO ] Deduced a trap composed of 27 places in 473 ms of which 1 ms to minimize.
[2022-05-19 13:21:46] [INFO ] Deduced a trap composed of 41 places in 490 ms of which 2 ms to minimize.
[2022-05-19 13:21:46] [INFO ] Deduced a trap composed of 37 places in 476 ms of which 1 ms to minimize.
[2022-05-19 13:21:47] [INFO ] Deduced a trap composed of 37 places in 469 ms of which 1 ms to minimize.
[2022-05-19 13:21:48] [INFO ] Deduced a trap composed of 35 places in 464 ms of which 1 ms to minimize.
[2022-05-19 13:21:48] [INFO ] Deduced a trap composed of 26 places in 466 ms of which 1 ms to minimize.
[2022-05-19 13:21:49] [INFO ] Deduced a trap composed of 50 places in 448 ms of which 1 ms to minimize.
[2022-05-19 13:21:49] [INFO ] Deduced a trap composed of 27 places in 429 ms of which 2 ms to minimize.
[2022-05-19 13:21:50] [INFO ] Deduced a trap composed of 40 places in 399 ms of which 1 ms to minimize.
[2022-05-19 13:21:50] [INFO ] Deduced a trap composed of 66 places in 412 ms of which 1 ms to minimize.
[2022-05-19 13:21:51] [INFO ] Deduced a trap composed of 59 places in 428 ms of which 2 ms to minimize.
[2022-05-19 13:21:51] [INFO ] Deduced a trap composed of 49 places in 426 ms of which 1 ms to minimize.
[2022-05-19 13:21:51] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 13:21:51] [INFO ] After 25242ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:20
Fused 20 Parikh solutions to 19 different solutions.
Parikh walk visited 1 properties in 2631 ms.
Support contains 28 out of 2957 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2957/2957 places, 2707/2707 transitions.
Drop transitions removed 587 transitions
Trivial Post-agglo rules discarded 587 transitions
Performed 587 trivial Post agglomeration. Transition count delta: 587
Iterating post reduction 0 with 587 rules applied. Total rules applied 587 place count 2957 transition count 2120
Reduce places removed 587 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 590 rules applied. Total rules applied 1177 place count 2370 transition count 2117
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 1180 place count 2367 transition count 2117
Performed 392 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 392 Pre rules applied. Total rules applied 1180 place count 2367 transition count 1725
Deduced a syphon composed of 392 places in 3 ms
Reduce places removed 392 places and 0 transitions.
Iterating global reduction 3 with 784 rules applied. Total rules applied 1964 place count 1975 transition count 1725
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1965 place count 1974 transition count 1724
Iterating global reduction 3 with 1 rules applied. Total rules applied 1966 place count 1974 transition count 1724
Performed 848 Post agglomeration using F-continuation condition.Transition count delta: 848
Deduced a syphon composed of 848 places in 1 ms
Reduce places removed 848 places and 0 transitions.
Iterating global reduction 3 with 1696 rules applied. Total rules applied 3662 place count 1126 transition count 876
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3663 place count 1126 transition count 875
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 3665 place count 1125 transition count 874
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -61
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3867 place count 1024 transition count 935
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 44 places in 4 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 3955 place count 980 transition count 964
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3956 place count 980 transition count 963
Partial Free-agglomeration rule applied 49 times.
Drop transitions removed 49 transitions
Iterating global reduction 5 with 49 rules applied. Total rules applied 4005 place count 980 transition count 963
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 4006 place count 979 transition count 962
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 4008 place count 977 transition count 962
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 4008 place count 977 transition count 961
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 4010 place count 976 transition count 961
Applied a total of 4010 rules in 671 ms. Remains 976 /2957 variables (removed 1981) and now considering 961/2707 (removed 1746) transitions.
Finished structural reductions, in 1 iterations. Remains : 976/2957 places, 961/2707 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 415 ms. (steps per millisecond=24 ) properties (out of 19) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
// Phase 1: matrix 961 rows 976 cols
[2022-05-19 13:21:55] [INFO ] Computed 449 place invariants in 7 ms
[2022-05-19 13:21:56] [INFO ] [Real]Absence check using 449 positive place invariants in 67 ms returned sat
[2022-05-19 13:21:56] [INFO ] After 450ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2022-05-19 13:21:56] [INFO ] [Nat]Absence check using 449 positive place invariants in 65 ms returned sat
[2022-05-19 13:21:57] [INFO ] After 877ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2022-05-19 13:21:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 13:21:58] [INFO ] After 606ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :17
[2022-05-19 13:21:59] [INFO ] After 1647ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 619 ms.
[2022-05-19 13:21:59] [INFO ] After 3814ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Parikh walk visited 0 properties in 531 ms.
Support contains 27 out of 976 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 976/976 places, 961/961 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 975 transition count 960
Applied a total of 2 rules in 44 ms. Remains 975 /976 variables (removed 1) and now considering 960/961 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 975/976 places, 960/961 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 418 ms. (steps per millisecond=23 ) properties (out of 17) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 79371 steps, run timeout after 3002 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 79371 steps, saw 51312 distinct states, run finished after 3004 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 960 rows 975 cols
[2022-05-19 13:22:04] [INFO ] Computed 449 place invariants in 2 ms
[2022-05-19 13:22:04] [INFO ] [Real]Absence check using 449 positive place invariants in 62 ms returned sat
[2022-05-19 13:22:04] [INFO ] After 436ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2022-05-19 13:22:04] [INFO ] [Nat]Absence check using 449 positive place invariants in 63 ms returned sat
[2022-05-19 13:22:06] [INFO ] After 864ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2022-05-19 13:22:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 13:22:06] [INFO ] After 570ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :16
[2022-05-19 13:22:07] [INFO ] After 1539ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 575 ms.
[2022-05-19 13:22:08] [INFO ] After 3594ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Fused 16 Parikh solutions to 15 different solutions.
Parikh walk visited 0 properties in 400 ms.
Support contains 26 out of 975 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 975/975 places, 960/960 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 975 transition count 959
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 974 transition count 959
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 973 transition count 961
Applied a total of 4 rules in 39 ms. Remains 973 /975 variables (removed 2) and now considering 961/960 (removed -1) transitions.
Finished structural reductions, in 1 iterations. Remains : 973/975 places, 961/960 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 354 ms. (steps per millisecond=28 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 81290 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 81290 steps, saw 52657 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 961 rows 973 cols
[2022-05-19 13:22:12] [INFO ] Computed 449 place invariants in 6 ms
[2022-05-19 13:22:12] [INFO ] [Real]Absence check using 449 positive place invariants in 60 ms returned sat
[2022-05-19 13:22:12] [INFO ] After 423ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2022-05-19 13:22:12] [INFO ] [Nat]Absence check using 449 positive place invariants in 60 ms returned sat
[2022-05-19 13:22:14] [INFO ] After 872ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2022-05-19 13:22:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 13:22:14] [INFO ] After 538ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :16
[2022-05-19 13:22:15] [INFO ] After 1483ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 545 ms.
[2022-05-19 13:22:16] [INFO ] After 3500ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Fused 16 Parikh solutions to 15 different solutions.
Parikh walk visited 0 properties in 472 ms.
Support contains 26 out of 973 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 973/973 places, 961/961 transitions.
Applied a total of 0 rules in 19 ms. Remains 973 /973 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 973/973 places, 961/961 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 973/973 places, 961/961 transitions.
Applied a total of 0 rules in 20 ms. Remains 973 /973 variables (removed 0) and now considering 961/961 (removed 0) transitions.
// Phase 1: matrix 961 rows 973 cols
[2022-05-19 13:22:16] [INFO ] Computed 449 place invariants in 4 ms
[2022-05-19 13:22:17] [INFO ] Implicit Places using invariants in 493 ms returned [962]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 495 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 972/973 places, 961/961 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 971 transition count 960
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 971 transition count 960
Applied a total of 2 rules in 30 ms. Remains 971 /972 variables (removed 1) and now considering 960/961 (removed 1) transitions.
// Phase 1: matrix 960 rows 971 cols
[2022-05-19 13:22:17] [INFO ] Computed 448 place invariants in 5 ms
[2022-05-19 13:22:17] [INFO ] Implicit Places using invariants in 525 ms returned []
// Phase 1: matrix 960 rows 971 cols
[2022-05-19 13:22:17] [INFO ] Computed 448 place invariants in 5 ms
[2022-05-19 13:22:18] [INFO ] Implicit Places using invariants and state equation in 1013 ms returned []
Implicit Place search using SMT with State Equation took 1541 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 971/973 places, 960/961 transitions.
Finished structural reductions, in 2 iterations. Remains : 971/973 places, 960/961 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 495 ms. (steps per millisecond=20 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 83832 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 83832 steps, saw 54268 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 960 rows 971 cols
[2022-05-19 13:22:22] [INFO ] Computed 448 place invariants in 2 ms
[2022-05-19 13:22:22] [INFO ] [Real]Absence check using 448 positive place invariants in 69 ms returned sat
[2022-05-19 13:22:22] [INFO ] After 447ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2022-05-19 13:22:23] [INFO ] [Nat]Absence check using 448 positive place invariants in 62 ms returned sat
[2022-05-19 13:22:24] [INFO ] After 909ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2022-05-19 13:22:25] [INFO ] After 1923ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 597 ms.
[2022-05-19 13:22:25] [INFO ] After 3133ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Fused 16 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 337 ms.
Support contains 26 out of 971 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 971/971 places, 960/960 transitions.
Applied a total of 0 rules in 28 ms. Remains 971 /971 variables (removed 0) and now considering 960/960 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 971/971 places, 960/960 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 971/971 places, 960/960 transitions.
Applied a total of 0 rules in 19 ms. Remains 971 /971 variables (removed 0) and now considering 960/960 (removed 0) transitions.
// Phase 1: matrix 960 rows 971 cols
[2022-05-19 13:22:26] [INFO ] Computed 448 place invariants in 2 ms
[2022-05-19 13:22:26] [INFO ] Implicit Places using invariants in 483 ms returned []
// Phase 1: matrix 960 rows 971 cols
[2022-05-19 13:22:26] [INFO ] Computed 448 place invariants in 2 ms
[2022-05-19 13:22:27] [INFO ] Implicit Places using invariants and state equation in 999 ms returned []
Implicit Place search using SMT with State Equation took 1484 ms to find 0 implicit places.
[2022-05-19 13:22:27] [INFO ] Redundant transitions in 61 ms returned []
// Phase 1: matrix 960 rows 971 cols
[2022-05-19 13:22:27] [INFO ] Computed 448 place invariants in 5 ms
[2022-05-19 13:22:28] [INFO ] Dead Transitions using invariants and state equation in 481 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 971/971 places, 960/960 transitions.
Partial Free-agglomeration rule applied 95 times.
Drop transitions removed 95 transitions
Iterating global reduction 0 with 95 rules applied. Total rules applied 95 place count 971 transition count 960
Applied a total of 95 rules in 39 ms. Remains 971 /971 variables (removed 0) and now considering 960/960 (removed 0) transitions.
Running SMT prover for 16 properties.
// Phase 1: matrix 960 rows 971 cols
[2022-05-19 13:22:28] [INFO ] Computed 448 place invariants in 5 ms
[2022-05-19 13:22:28] [INFO ] [Real]Absence check using 448 positive place invariants in 61 ms returned sat
[2022-05-19 13:22:28] [INFO ] After 426ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2022-05-19 13:22:29] [INFO ] [Nat]Absence check using 448 positive place invariants in 64 ms returned sat
[2022-05-19 13:22:30] [INFO ] After 885ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2022-05-19 13:22:30] [INFO ] State equation strengthened by 91 read => feed constraints.
[2022-05-19 13:22:31] [INFO ] After 1021ms SMT Verify possible using 91 Read/Feed constraints in natural domain returned unsat :0 sat :16
[2022-05-19 13:22:32] [INFO ] After 2300ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 729 ms.
[2022-05-19 13:22:33] [INFO ] After 4527ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
[2022-05-19 13:22:33] [INFO ] Flatten gal took : 45 ms
[2022-05-19 13:22:33] [INFO ] Flatten gal took : 41 ms
[2022-05-19 13:22:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3655738273393227443.gal : 25 ms
[2022-05-19 13:22:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10505388255899393207.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms2625617986026271450;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3655738273393227443.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10505388255899393207.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality10505388255899393207.prop.
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :4 after 16
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :16 after 64
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :64 after 256
Reachability property AtomicPropp17 is true.
Reachability property AtomicPropp1 is true.
SDD proceeding with computation,14 properties remain. new max is 64
SDD size :256 after 22000
Reachability property AtomicPropp28 is true.
Reachability property AtomicPropp15 is true.
Reachability property AtomicPropp0 is true.
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :22000 after 22252
Reachability property AtomicPropp23 is true.
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :22252 after 22712
Reachability property AtomicPropp2 is true.
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :22712 after 28298
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :28298 after 32604
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :32604 after 100991
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :100991 after 762680
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :762680 after 5.7083e+07
SDD proceeding with computation,9 properties remain. new max is 2048
SDD size :5.7083e+07 after 2.18443e+08
Reachability property AtomicPropp5 is true.
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :2.18443e+08 after 2.05927e+11
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :2.05927e+11 after 1.13659e+14
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :1.13659e+14 after 8.33281e+16
Reachability property AtomicPropp20 is true.
Reachability property AtomicPropp16 is true.
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :8.33281e+16 after 1.31866e+22
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :1.31866e+22 after 1.01368e+25
SDD proceeding with computation,6 properties remain. new max is 32768
SDD size :1.01368e+25 after 4.45366e+28
SDD proceeding with computation,6 properties remain. new max is 65536
SDD size :4.45366e+28 after 6.67752e+34
Detected timeout of ITS tools.
[2022-05-19 13:22:48] [INFO ] Flatten gal took : 38 ms
[2022-05-19 13:22:48] [INFO ] Applying decomposition
[2022-05-19 13:22:48] [INFO ] Flatten gal took : 42 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2896005950577606788.txt' '-o' '/tmp/graph2896005950577606788.bin' '-w' '/tmp/graph2896005950577606788.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2896005950577606788.bin' '-l' '-1' '-v' '-w' '/tmp/graph2896005950577606788.weights' '-q' '0' '-e' '0.001'
[2022-05-19 13:22:48] [INFO ] Decomposing Gal with order
[2022-05-19 13:22:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 13:22:49] [INFO ] Removed a total of 552 redundant transitions.
[2022-05-19 13:22:49] [INFO ] Flatten gal took : 109 ms
[2022-05-19 13:22:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 20 ms.
[2022-05-19 13:22:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3199263949398970325.gal : 13 ms
[2022-05-19 13:22:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16849984098707025281.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms2625617986026271450;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3199263949398970325.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16849984098707025281.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality16849984098707025281.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :1 after 2
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :2 after 16
Reachability property AtomicPropp10 is true.
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :7.86432e+06 after 6.83459e+30
Reachability property AtomicPropp30 is true.
Reachability property AtomicPropp25 is true.
Reachability property AtomicPropp12 is true.
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :6.83459e+30 after 3.5116e+65
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15994426063826206180
[2022-05-19 13:23:04] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15994426063826206180
Running compilation step : cd /tmp/ltsmin15994426063826206180;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1824 ms.
Running link step : cd /tmp/ltsmin15994426063826206180;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin15994426063826206180;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicPropp3==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
FORMULA ShieldIIPt-PT-050B-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 799 stabilizing places and 799 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||F(F(X(G((F(X(p1))||p2)))))))'
Support contains 4 out of 2957 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2957/2957 places, 2707/2707 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 594 transitions
Trivial Post-agglo rules discarded 594 transitions
Performed 594 trivial Post agglomeration. Transition count delta: 594
Iterating post reduction 0 with 594 rules applied. Total rules applied 594 place count 2956 transition count 2112
Reduce places removed 594 places and 0 transitions.
Iterating post reduction 1 with 594 rules applied. Total rules applied 1188 place count 2362 transition count 2112
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 399 Pre rules applied. Total rules applied 1188 place count 2362 transition count 1713
Deduced a syphon composed of 399 places in 3 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 2 with 798 rules applied. Total rules applied 1986 place count 1963 transition count 1713
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1991 place count 1958 transition count 1708
Iterating global reduction 2 with 5 rules applied. Total rules applied 1996 place count 1958 transition count 1708
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1996 place count 1958 transition count 1704
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 2004 place count 1954 transition count 1704
Performed 847 Post agglomeration using F-continuation condition.Transition count delta: 847
Deduced a syphon composed of 847 places in 1 ms
Reduce places removed 847 places and 0 transitions.
Iterating global reduction 2 with 1694 rules applied. Total rules applied 3698 place count 1107 transition count 857
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3699 place count 1107 transition count 856
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 3701 place count 1106 transition count 855
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3903 place count 1005 transition count 921
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 3997 place count 958 transition count 952
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3999 place count 956 transition count 950
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 4001 place count 954 transition count 950
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 4001 place count 954 transition count 949
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 4003 place count 953 transition count 949
Applied a total of 4003 rules in 660 ms. Remains 953 /2957 variables (removed 2004) and now considering 949/2707 (removed 1758) transitions.
// Phase 1: matrix 949 rows 953 cols
[2022-05-19 13:23:20] [INFO ] Computed 449 place invariants in 18 ms
[2022-05-19 13:23:20] [INFO ] Implicit Places using invariants in 670 ms returned [942]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 678 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 952/2957 places, 949/2707 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 951 transition count 948
Applied a total of 2 rules in 32 ms. Remains 951 /952 variables (removed 1) and now considering 948/949 (removed 1) transitions.
// Phase 1: matrix 948 rows 951 cols
[2022-05-19 13:23:20] [INFO ] Computed 448 place invariants in 2 ms
[2022-05-19 13:23:21] [INFO ] Implicit Places using invariants in 494 ms returned []
// Phase 1: matrix 948 rows 951 cols
[2022-05-19 13:23:21] [INFO ] Computed 448 place invariants in 2 ms
[2022-05-19 13:23:22] [INFO ] Implicit Places using invariants and state equation in 1014 ms returned []
Implicit Place search using SMT with State Equation took 1513 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 951/2957 places, 948/2707 transitions.
Finished structural reductions, in 2 iterations. Remains : 951/2957 places, 948/2707 transitions.
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s214 1) (EQ s233 1)), p2:(EQ s41 0), p1:(EQ s459 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 874 ms.
Product exploration explored 100000 steps with 0 reset in 1125 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (AND p2 (NOT p0) (NOT p1))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND p2 (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 289 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 147068 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 147068 steps, saw 90794 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 948 rows 951 cols
[2022-05-19 13:23:28] [INFO ] Computed 448 place invariants in 8 ms
[2022-05-19 13:23:28] [INFO ] [Real]Absence check using 448 positive place invariants in 55 ms returned sat
[2022-05-19 13:23:29] [INFO ] After 540ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-19 13:23:29] [INFO ] [Nat]Absence check using 448 positive place invariants in 64 ms returned sat
[2022-05-19 13:23:29] [INFO ] After 421ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-19 13:23:29] [INFO ] After 596ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 103 ms.
[2022-05-19 13:23:29] [INFO ] After 948ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 65 ms.
Support contains 4 out of 951 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 951/951 places, 948/948 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 951 transition count 947
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 951 transition count 947
Applied a total of 2 rules in 35 ms. Remains 951 /951 variables (removed 0) and now considering 947/948 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 951/951 places, 947/948 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 135090 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 135090 steps, saw 85191 distinct states, run finished after 3001 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 947 rows 951 cols
[2022-05-19 13:23:33] [INFO ] Computed 448 place invariants in 5 ms
[2022-05-19 13:23:33] [INFO ] [Real]Absence check using 448 positive place invariants in 61 ms returned sat
[2022-05-19 13:23:34] [INFO ] After 533ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-19 13:23:34] [INFO ] [Nat]Absence check using 448 positive place invariants in 63 ms returned sat
[2022-05-19 13:23:34] [INFO ] After 403ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-19 13:23:34] [INFO ] After 574ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 99 ms.
[2022-05-19 13:23:35] [INFO ] After 923ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 73 ms.
Support contains 4 out of 951 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 951/951 places, 947/947 transitions.
Applied a total of 0 rules in 17 ms. Remains 951 /951 variables (removed 0) and now considering 947/947 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 951/951 places, 947/947 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 951/951 places, 947/947 transitions.
Applied a total of 0 rules in 16 ms. Remains 951 /951 variables (removed 0) and now considering 947/947 (removed 0) transitions.
// Phase 1: matrix 947 rows 951 cols
[2022-05-19 13:23:35] [INFO ] Computed 448 place invariants in 4 ms
[2022-05-19 13:23:35] [INFO ] Implicit Places using invariants in 500 ms returned []
// Phase 1: matrix 947 rows 951 cols
[2022-05-19 13:23:35] [INFO ] Computed 448 place invariants in 2 ms
[2022-05-19 13:23:36] [INFO ] Implicit Places using invariants and state equation in 953 ms returned []
Implicit Place search using SMT with State Equation took 1457 ms to find 0 implicit places.
[2022-05-19 13:23:36] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 947 rows 951 cols
[2022-05-19 13:23:36] [INFO ] Computed 448 place invariants in 2 ms
[2022-05-19 13:23:37] [INFO ] Dead Transitions using invariants and state equation in 475 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 951/951 places, 947/947 transitions.
Partial Free-agglomeration rule applied 101 times.
Drop transitions removed 101 transitions
Iterating global reduction 0 with 101 rules applied. Total rules applied 101 place count 951 transition count 947
Applied a total of 101 rules in 31 ms. Remains 951 /951 variables (removed 0) and now considering 947/947 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 947 rows 951 cols
[2022-05-19 13:23:37] [INFO ] Computed 448 place invariants in 6 ms
[2022-05-19 13:23:37] [INFO ] [Real]Absence check using 448 positive place invariants in 57 ms returned sat
[2022-05-19 13:23:37] [INFO ] After 328ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2022-05-19 13:23:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-19 13:23:37] [INFO ] After 39ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-19 13:23:37] [INFO ] After 572ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-19 13:23:37] [INFO ] [Nat]Absence check using 448 positive place invariants in 65 ms returned sat
[2022-05-19 13:23:38] [INFO ] After 419ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-19 13:23:38] [INFO ] After 110ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-19 13:23:38] [INFO ] After 307ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 117 ms.
[2022-05-19 13:23:38] [INFO ] After 1091ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2022-05-19 13:23:38] [INFO ] Flatten gal took : 34 ms
[2022-05-19 13:23:38] [INFO ] Flatten gal took : 34 ms
[2022-05-19 13:23:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4830221851217160507.gal : 5 ms
[2022-05-19 13:23:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7739623926048427560.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms2428293851013883965;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4830221851217160507.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7739623926048427560.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality7739623926048427560.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :2 after 20
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :20 after 58
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :58 after 124
Reachability property apf2 is true.
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :124 after 260
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :260 after 349
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :349 after 2130
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2130 after 41863
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :41863 after 3.2771e+06
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :3.2771e+06 after 2.31526e+13
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2.31526e+13 after 1.22498e+27
Reachability property apf0 is true.
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.22498e+27 after 1.82542e+49
Reachability property apf1 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 2049 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,5.10598e+72,0.777535,21352,2,2973,20,71650,6,0,4753,75627,0
Total reachable state count : 5.105978620655571474258538248858288472997e+72

Verifying 3 reachability properties.
Reachability property apf0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,2.95148e+31,0.780648,21616,2,1123,20,71650,7,0,4759,75627,0
Reachability property apf1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf1,102400,0.782932,21616,2,980,20,71650,8,0,4769,75627,0
Reachability property apf2 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf2,3.13604e+66,0.784662,21616,2,1328,20,71650,9,0,4773,75627,0
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (AND p2 (NOT p0) (NOT p1))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND p2 (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 228 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 4 out of 951 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 951/951 places, 948/948 transitions.
Applied a total of 0 rules in 22 ms. Remains 951 /951 variables (removed 0) and now considering 948/948 (removed 0) transitions.
// Phase 1: matrix 948 rows 951 cols
[2022-05-19 13:23:40] [INFO ] Computed 448 place invariants in 4 ms
[2022-05-19 13:23:40] [INFO ] Implicit Places using invariants in 478 ms returned []
// Phase 1: matrix 948 rows 951 cols
[2022-05-19 13:23:40] [INFO ] Computed 448 place invariants in 2 ms
[2022-05-19 13:23:41] [INFO ] Implicit Places using invariants and state equation in 966 ms returned []
Implicit Place search using SMT with State Equation took 1445 ms to find 0 implicit places.
[2022-05-19 13:23:41] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 948 rows 951 cols
[2022-05-19 13:23:41] [INFO ] Computed 448 place invariants in 2 ms
[2022-05-19 13:23:42] [INFO ] Dead Transitions using invariants and state equation in 442 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 951/951 places, 948/948 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 269 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 134350 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 134350 steps, saw 83195 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 948 rows 951 cols
[2022-05-19 13:23:45] [INFO ] Computed 448 place invariants in 2 ms
[2022-05-19 13:23:45] [INFO ] [Real]Absence check using 448 positive place invariants in 62 ms returned sat
[2022-05-19 13:23:46] [INFO ] After 579ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-19 13:23:46] [INFO ] [Nat]Absence check using 448 positive place invariants in 64 ms returned sat
[2022-05-19 13:23:46] [INFO ] After 419ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-19 13:23:47] [INFO ] After 614ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 110 ms.
[2022-05-19 13:23:47] [INFO ] After 971ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 51 ms.
Support contains 4 out of 951 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 951/951 places, 948/948 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 951 transition count 947
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 951 transition count 947
Applied a total of 2 rules in 38 ms. Remains 951 /951 variables (removed 0) and now considering 947/948 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 951/951 places, 947/948 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 136274 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 136274 steps, saw 85883 distinct states, run finished after 3001 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 947 rows 951 cols
[2022-05-19 13:23:50] [INFO ] Computed 448 place invariants in 3 ms
[2022-05-19 13:23:50] [INFO ] [Real]Absence check using 448 positive place invariants in 60 ms returned sat
[2022-05-19 13:23:51] [INFO ] After 540ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-19 13:23:51] [INFO ] [Nat]Absence check using 448 positive place invariants in 61 ms returned sat
[2022-05-19 13:23:51] [INFO ] After 378ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-19 13:23:52] [INFO ] After 549ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 113 ms.
[2022-05-19 13:23:52] [INFO ] After 902ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 93 ms.
Support contains 4 out of 951 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 951/951 places, 947/947 transitions.
Applied a total of 0 rules in 16 ms. Remains 951 /951 variables (removed 0) and now considering 947/947 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 951/951 places, 947/947 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 951/951 places, 947/947 transitions.
Applied a total of 0 rules in 16 ms. Remains 951 /951 variables (removed 0) and now considering 947/947 (removed 0) transitions.
// Phase 1: matrix 947 rows 951 cols
[2022-05-19 13:23:52] [INFO ] Computed 448 place invariants in 3 ms
[2022-05-19 13:23:52] [INFO ] Implicit Places using invariants in 471 ms returned []
// Phase 1: matrix 947 rows 951 cols
[2022-05-19 13:23:52] [INFO ] Computed 448 place invariants in 4 ms
[2022-05-19 13:23:53] [INFO ] Implicit Places using invariants and state equation in 960 ms returned []
Implicit Place search using SMT with State Equation took 1432 ms to find 0 implicit places.
[2022-05-19 13:23:53] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 947 rows 951 cols
[2022-05-19 13:23:53] [INFO ] Computed 448 place invariants in 2 ms
[2022-05-19 13:23:54] [INFO ] Dead Transitions using invariants and state equation in 477 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 951/951 places, 947/947 transitions.
Partial Free-agglomeration rule applied 101 times.
Drop transitions removed 101 transitions
Iterating global reduction 0 with 101 rules applied. Total rules applied 101 place count 951 transition count 947
Applied a total of 101 rules in 31 ms. Remains 951 /951 variables (removed 0) and now considering 947/947 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 947 rows 951 cols
[2022-05-19 13:23:54] [INFO ] Computed 448 place invariants in 3 ms
[2022-05-19 13:23:54] [INFO ] [Real]Absence check using 448 positive place invariants in 62 ms returned sat
[2022-05-19 13:23:54] [INFO ] After 349ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2022-05-19 13:23:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-19 13:23:54] [INFO ] After 37ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-19 13:23:54] [INFO ] After 604ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-19 13:23:55] [INFO ] [Nat]Absence check using 448 positive place invariants in 62 ms returned sat
[2022-05-19 13:23:55] [INFO ] After 423ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-19 13:23:55] [INFO ] After 115ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-19 13:23:55] [INFO ] After 307ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 118 ms.
[2022-05-19 13:23:56] [INFO ] After 1092ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2022-05-19 13:23:56] [INFO ] Flatten gal took : 28 ms
[2022-05-19 13:23:56] [INFO ] Flatten gal took : 32 ms
[2022-05-19 13:23:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality536367128156934188.gal : 4 ms
[2022-05-19 13:23:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7626396783864055446.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms7790763662997119089;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality536367128156934188.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7626396783864055446.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...318
Loading property file /tmp/ReachabilityCardinality7626396783864055446.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :2 after 20
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :20 after 58
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :58 after 124
Reachability property apf2 is true.
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :124 after 260
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :260 after 349
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :349 after 2130
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2130 after 41863
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :41863 after 3.2771e+06
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :3.2771e+06 after 2.31526e+13
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2.31526e+13 after 1.22498e+27
Reachability property apf0 is true.
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.22498e+27 after 1.82542e+49
Reachability property apf1 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 2049 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,5.10598e+72,0.76599,21356,2,2973,20,71650,6,0,4753,75627,0
Total reachable state count : 5.105978620655571474258538248858288472997e+72

Verifying 3 reachability properties.
Reachability property apf0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,2.95148e+31,0.76938,21620,2,1123,20,71650,7,0,4759,75627,0
Reachability property apf1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf1,102400,0.771789,21620,2,980,20,71650,8,0,4769,75627,0
Reachability property apf2 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf2,3.13604e+66,0.773692,21620,2,1328,20,71650,9,0,4773,75627,0
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 301 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 773 ms.
Product exploration explored 100000 steps with 0 reset in 1072 ms.
Built C files in :
/tmp/ltsmin16629872260911583852
[2022-05-19 13:23:59] [INFO ] Computing symmetric may disable matrix : 948 transitions.
[2022-05-19 13:23:59] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 13:23:59] [INFO ] Computing symmetric may enable matrix : 948 transitions.
[2022-05-19 13:23:59] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 13:23:59] [INFO ] Computing Do-Not-Accords matrix : 948 transitions.
[2022-05-19 13:23:59] [INFO ] Computation of Completed DNA matrix. took 30 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 13:23:59] [INFO ] Built C files in 175ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16629872260911583852
Running compilation step : cd /tmp/ltsmin16629872260911583852;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2762 ms.
Running link step : cd /tmp/ltsmin16629872260911583852;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin16629872260911583852;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16796342711074981998.hoa' '--buchi-type=spotba'
LTSmin run took 9574 ms.
FORMULA ShieldIIPt-PT-050B-LTLFireability-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPt-PT-050B-LTLFireability-00 finished in 52341 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 2957 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2957/2957 places, 2707/2707 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 596 transitions
Trivial Post-agglo rules discarded 596 transitions
Performed 596 trivial Post agglomeration. Transition count delta: 596
Iterating post reduction 0 with 596 rules applied. Total rules applied 596 place count 2956 transition count 2110
Reduce places removed 596 places and 0 transitions.
Iterating post reduction 1 with 596 rules applied. Total rules applied 1192 place count 2360 transition count 2110
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 400 Pre rules applied. Total rules applied 1192 place count 2360 transition count 1710
Deduced a syphon composed of 400 places in 3 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 2 with 800 rules applied. Total rules applied 1992 place count 1960 transition count 1710
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1998 place count 1954 transition count 1704
Iterating global reduction 2 with 6 rules applied. Total rules applied 2004 place count 1954 transition count 1704
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 2004 place count 1954 transition count 1699
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 2014 place count 1949 transition count 1699
Performed 846 Post agglomeration using F-continuation condition.Transition count delta: 846
Deduced a syphon composed of 846 places in 1 ms
Reduce places removed 846 places and 0 transitions.
Iterating global reduction 2 with 1692 rules applied. Total rules applied 3706 place count 1103 transition count 853
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3707 place count 1103 transition count 852
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 3709 place count 1102 transition count 851
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3911 place count 1001 transition count 917
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 4007 place count 953 transition count 950
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4009 place count 951 transition count 948
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 4011 place count 949 transition count 948
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 4011 place count 949 transition count 947
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 4013 place count 948 transition count 947
Applied a total of 4013 rules in 587 ms. Remains 948 /2957 variables (removed 2009) and now considering 947/2707 (removed 1760) transitions.
// Phase 1: matrix 947 rows 948 cols
[2022-05-19 13:24:12] [INFO ] Computed 449 place invariants in 3 ms
[2022-05-19 13:24:12] [INFO ] Implicit Places using invariants in 537 ms returned [937]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 538 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 947/2957 places, 947/2707 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 946 transition count 946
Applied a total of 2 rules in 26 ms. Remains 946 /947 variables (removed 1) and now considering 946/947 (removed 1) transitions.
// Phase 1: matrix 946 rows 946 cols
[2022-05-19 13:24:13] [INFO ] Computed 448 place invariants in 3 ms
[2022-05-19 13:24:13] [INFO ] Implicit Places using invariants in 502 ms returned []
// Phase 1: matrix 946 rows 946 cols
[2022-05-19 13:24:13] [INFO ] Computed 448 place invariants in 1 ms
[2022-05-19 13:24:14] [INFO ] Implicit Places using invariants and state equation in 1002 ms returned []
Implicit Place search using SMT with State Equation took 1505 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 946/2957 places, 946/2707 transitions.
Finished structural reductions, in 2 iterations. Remains : 946/2957 places, 946/2707 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s352 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 818 ms.
Product exploration explored 100000 steps with 0 reset in 1050 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 223333 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :{}
Probabilistic random walk after 223333 steps, saw 138891 distinct states, run finished after 3001 ms. (steps per millisecond=74 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 946 rows 946 cols
[2022-05-19 13:24:19] [INFO ] Computed 448 place invariants in 4 ms
[2022-05-19 13:24:19] [INFO ] [Real]Absence check using 448 positive place invariants in 58 ms returned sat
[2022-05-19 13:24:20] [INFO ] After 315ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-19 13:24:20] [INFO ] After 374ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 13:24:20] [INFO ] After 557ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 13:24:20] [INFO ] [Nat]Absence check using 448 positive place invariants in 59 ms returned sat
[2022-05-19 13:24:20] [INFO ] After 315ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 13:24:20] [INFO ] After 378ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2022-05-19 13:24:20] [INFO ] After 589ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 1 out of 946 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 946/946 places, 946/946 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 946 transition count 945
Applied a total of 1 rules in 16 ms. Remains 946 /946 variables (removed 0) and now considering 945/946 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 946/946 places, 945/946 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 221866 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :{}
Probabilistic random walk after 221866 steps, saw 138186 distinct states, run finished after 3001 ms. (steps per millisecond=73 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 945 rows 946 cols
[2022-05-19 13:24:24] [INFO ] Computed 448 place invariants in 4 ms
[2022-05-19 13:24:24] [INFO ] [Real]Absence check using 448 positive place invariants in 60 ms returned sat
[2022-05-19 13:24:24] [INFO ] After 329ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-19 13:24:24] [INFO ] After 388ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2022-05-19 13:24:24] [INFO ] After 606ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 946 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 946/946 places, 945/945 transitions.
Applied a total of 0 rules in 15 ms. Remains 946 /946 variables (removed 0) and now considering 945/945 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 946/946 places, 945/945 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 946/946 places, 945/945 transitions.
Applied a total of 0 rules in 15 ms. Remains 946 /946 variables (removed 0) and now considering 945/945 (removed 0) transitions.
// Phase 1: matrix 945 rows 946 cols
[2022-05-19 13:24:24] [INFO ] Computed 448 place invariants in 4 ms
[2022-05-19 13:24:25] [INFO ] Implicit Places using invariants in 509 ms returned []
// Phase 1: matrix 945 rows 946 cols
[2022-05-19 13:24:25] [INFO ] Computed 448 place invariants in 2 ms
[2022-05-19 13:24:26] [INFO ] Implicit Places using invariants and state equation in 988 ms returned []
Implicit Place search using SMT with State Equation took 1497 ms to find 0 implicit places.
[2022-05-19 13:24:26] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 945 rows 946 cols
[2022-05-19 13:24:26] [INFO ] Computed 448 place invariants in 1 ms
[2022-05-19 13:24:26] [INFO ] Dead Transitions using invariants and state equation in 479 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 946/946 places, 945/945 transitions.
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 0 with 100 rules applied. Total rules applied 100 place count 946 transition count 945
Applied a total of 100 rules in 28 ms. Remains 946 /946 variables (removed 0) and now considering 945/945 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 945 rows 946 cols
[2022-05-19 13:24:26] [INFO ] Computed 448 place invariants in 2 ms
[2022-05-19 13:24:26] [INFO ] [Real]Absence check using 448 positive place invariants in 63 ms returned sat
[2022-05-19 13:24:27] [INFO ] After 521ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 13:24:27] [INFO ] [Nat]Absence check using 448 positive place invariants in 61 ms returned sat
[2022-05-19 13:24:27] [INFO ] After 342ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 13:24:27] [INFO ] After 403ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2022-05-19 13:24:27] [INFO ] After 626ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-19 13:24:27] [INFO ] Flatten gal took : 29 ms
[2022-05-19 13:24:27] [INFO ] Flatten gal took : 28 ms
[2022-05-19 13:24:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12350707307505168782.gal : 4 ms
[2022-05-19 13:24:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2383445897520373027.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms14821834126143027107;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12350707307505168782.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2383445897520373027.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality2383445897520373027.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 18
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :18 after 37
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :37 after 70
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :70 after 137
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :137 after 313
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :313 after 12873
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :12873 after 4.09616e+06
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :4.09616e+06 after 2.24815e+13
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2.24815e+13 after 1.26101e+27
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 2049 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2.75841e+52,0.634842,16852,2,2718,16,49099,6,0,4732,52061,0
Total reachable state count : 2.758407706096627177656826174898176e+52

Verifying 1 reachability properties.
Reachability property apf0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,2.92067e+51,0.638534,16852,2,1594,16,49099,7,0,4735,52061,0
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Support contains 1 out of 946 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 946/946 places, 946/946 transitions.
Applied a total of 0 rules in 20 ms. Remains 946 /946 variables (removed 0) and now considering 946/946 (removed 0) transitions.
// Phase 1: matrix 946 rows 946 cols
[2022-05-19 13:24:28] [INFO ] Computed 448 place invariants in 2 ms
[2022-05-19 13:24:29] [INFO ] Implicit Places using invariants in 504 ms returned []
// Phase 1: matrix 946 rows 946 cols
[2022-05-19 13:24:29] [INFO ] Computed 448 place invariants in 1 ms
[2022-05-19 13:24:30] [INFO ] Implicit Places using invariants and state equation in 963 ms returned []
Implicit Place search using SMT with State Equation took 1471 ms to find 0 implicit places.
[2022-05-19 13:24:30] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 946 rows 946 cols
[2022-05-19 13:24:30] [INFO ] Computed 448 place invariants in 3 ms
[2022-05-19 13:24:30] [INFO ] Dead Transitions using invariants and state equation in 444 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 946/946 places, 946/946 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 226154 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :{}
Probabilistic random walk after 226154 steps, saw 140613 distinct states, run finished after 3001 ms. (steps per millisecond=75 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 946 rows 946 cols
[2022-05-19 13:24:34] [INFO ] Computed 448 place invariants in 2 ms
[2022-05-19 13:24:34] [INFO ] [Real]Absence check using 448 positive place invariants in 59 ms returned sat
[2022-05-19 13:24:34] [INFO ] After 326ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-19 13:24:34] [INFO ] After 389ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 13:24:34] [INFO ] After 584ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 13:24:34] [INFO ] [Nat]Absence check using 448 positive place invariants in 60 ms returned sat
[2022-05-19 13:24:35] [INFO ] After 338ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 13:24:35] [INFO ] After 395ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2022-05-19 13:24:35] [INFO ] After 626ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 946 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 946/946 places, 946/946 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 946 transition count 945
Applied a total of 1 rules in 17 ms. Remains 946 /946 variables (removed 0) and now considering 945/946 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 946/946 places, 945/946 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 224403 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :{}
Probabilistic random walk after 224403 steps, saw 139719 distinct states, run finished after 3001 ms. (steps per millisecond=74 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 945 rows 946 cols
[2022-05-19 13:24:38] [INFO ] Computed 448 place invariants in 3 ms
[2022-05-19 13:24:38] [INFO ] [Real]Absence check using 448 positive place invariants in 62 ms returned sat
[2022-05-19 13:24:38] [INFO ] After 339ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-19 13:24:39] [INFO ] After 408ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2022-05-19 13:24:39] [INFO ] After 638ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 946 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 946/946 places, 945/945 transitions.
Applied a total of 0 rules in 14 ms. Remains 946 /946 variables (removed 0) and now considering 945/945 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 946/946 places, 945/945 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 946/946 places, 945/945 transitions.
Applied a total of 0 rules in 14 ms. Remains 946 /946 variables (removed 0) and now considering 945/945 (removed 0) transitions.
// Phase 1: matrix 945 rows 946 cols
[2022-05-19 13:24:39] [INFO ] Computed 448 place invariants in 3 ms
[2022-05-19 13:24:39] [INFO ] Implicit Places using invariants in 505 ms returned []
// Phase 1: matrix 945 rows 946 cols
[2022-05-19 13:24:39] [INFO ] Computed 448 place invariants in 1 ms
[2022-05-19 13:24:40] [INFO ] Implicit Places using invariants and state equation in 992 ms returned []
Implicit Place search using SMT with State Equation took 1499 ms to find 0 implicit places.
[2022-05-19 13:24:40] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 945 rows 946 cols
[2022-05-19 13:24:40] [INFO ] Computed 448 place invariants in 2 ms
[2022-05-19 13:24:41] [INFO ] Dead Transitions using invariants and state equation in 468 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 946/946 places, 945/945 transitions.
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 0 with 100 rules applied. Total rules applied 100 place count 946 transition count 945
Applied a total of 100 rules in 27 ms. Remains 946 /946 variables (removed 0) and now considering 945/945 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 945 rows 946 cols
[2022-05-19 13:24:41] [INFO ] Computed 448 place invariants in 3 ms
[2022-05-19 13:24:41] [INFO ] [Real]Absence check using 448 positive place invariants in 62 ms returned sat
[2022-05-19 13:24:41] [INFO ] After 539ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 13:24:41] [INFO ] [Nat]Absence check using 448 positive place invariants in 64 ms returned sat
[2022-05-19 13:24:42] [INFO ] After 341ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 13:24:42] [INFO ] After 403ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2022-05-19 13:24:42] [INFO ] After 630ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-19 13:24:42] [INFO ] Flatten gal took : 29 ms
[2022-05-19 13:24:42] [INFO ] Flatten gal took : 29 ms
[2022-05-19 13:24:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15128080766129811743.gal : 4 ms
[2022-05-19 13:24:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16538731523837008395.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms2143488280673529533;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15128080766129811743.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16538731523837008395.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality16538731523837008395.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 18
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :18 after 37
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :37 after 70
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :70 after 137
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :137 after 313
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :313 after 12873
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :12873 after 4.09616e+06
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :4.09616e+06 after 2.24815e+13
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2.24815e+13 after 1.26101e+27
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 2049 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2.75841e+52,0.615197,16852,2,2718,16,49099,6,0,4732,52061,0
Total reachable state count : 2.758407706096627177656826174898176e+52

Verifying 1 reachability properties.
Reachability property apf0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,2.92067e+51,0.620399,16852,2,1594,16,49099,7,0,4735,52061,0
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 698 ms.
Product exploration explored 100000 steps with 0 reset in 867 ms.
Built C files in :
/tmp/ltsmin9430983655338981368
[2022-05-19 13:24:44] [INFO ] Computing symmetric may disable matrix : 946 transitions.
[2022-05-19 13:24:44] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 13:24:44] [INFO ] Computing symmetric may enable matrix : 946 transitions.
[2022-05-19 13:24:44] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 13:24:44] [INFO ] Computing Do-Not-Accords matrix : 946 transitions.
[2022-05-19 13:24:44] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 13:24:44] [INFO ] Built C files in 99ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9430983655338981368
Running compilation step : cd /tmp/ltsmin9430983655338981368;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2788 ms.
Running link step : cd /tmp/ltsmin9430983655338981368;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin9430983655338981368;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17116800637936568114.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 946 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 946/946 places, 946/946 transitions.
Applied a total of 0 rules in 27 ms. Remains 946 /946 variables (removed 0) and now considering 946/946 (removed 0) transitions.
// Phase 1: matrix 946 rows 946 cols
[2022-05-19 13:24:59] [INFO ] Computed 448 place invariants in 4 ms
[2022-05-19 13:25:00] [INFO ] Implicit Places using invariants in 507 ms returned []
// Phase 1: matrix 946 rows 946 cols
[2022-05-19 13:25:00] [INFO ] Computed 448 place invariants in 1 ms
[2022-05-19 13:25:01] [INFO ] Implicit Places using invariants and state equation in 985 ms returned []
Implicit Place search using SMT with State Equation took 1494 ms to find 0 implicit places.
[2022-05-19 13:25:01] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 946 rows 946 cols
[2022-05-19 13:25:01] [INFO ] Computed 448 place invariants in 2 ms
[2022-05-19 13:25:01] [INFO ] Dead Transitions using invariants and state equation in 476 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 946/946 places, 946/946 transitions.
Built C files in :
/tmp/ltsmin12866631142593424122
[2022-05-19 13:25:01] [INFO ] Computing symmetric may disable matrix : 946 transitions.
[2022-05-19 13:25:01] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 13:25:01] [INFO ] Computing symmetric may enable matrix : 946 transitions.
[2022-05-19 13:25:01] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 13:25:02] [INFO ] Computing Do-Not-Accords matrix : 946 transitions.
[2022-05-19 13:25:02] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 13:25:02] [INFO ] Built C files in 90ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12866631142593424122
Running compilation step : cd /tmp/ltsmin12866631142593424122;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2778 ms.
Running link step : cd /tmp/ltsmin12866631142593424122;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin12866631142593424122;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased504364158775101562.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 13:25:17] [INFO ] Flatten gal took : 30 ms
[2022-05-19 13:25:17] [INFO ] Flatten gal took : 28 ms
[2022-05-19 13:25:17] [INFO ] Time to serialize gal into /tmp/LTL14142964930363523213.gal : 3 ms
[2022-05-19 13:25:17] [INFO ] Time to serialize properties into /tmp/LTL8794176833703672970.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14142964930363523213.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8794176833703672970.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1414296...267
Read 1 LTL properties
Checking formula 0 : !((F(G("(p1314!=1)"))))
Formula 0 simplified : !FG"(p1314!=1)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 6.21554e+61 deadlock states
Detected timeout of ITS tools.
[2022-05-19 13:25:32] [INFO ] Flatten gal took : 27 ms
[2022-05-19 13:25:32] [INFO ] Applying decomposition
[2022-05-19 13:25:32] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph10120044405128305541.txt' '-o' '/tmp/graph10120044405128305541.bin' '-w' '/tmp/graph10120044405128305541.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10120044405128305541.bin' '-l' '-1' '-v' '-w' '/tmp/graph10120044405128305541.weights' '-q' '0' '-e' '0.001'
[2022-05-19 13:25:32] [INFO ] Decomposing Gal with order
[2022-05-19 13:25:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 13:25:32] [INFO ] Removed a total of 1088 redundant transitions.
[2022-05-19 13:25:32] [INFO ] Flatten gal took : 62 ms
[2022-05-19 13:25:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 474 labels/synchronizations in 14 ms.
[2022-05-19 13:25:32] [INFO ] Time to serialize gal into /tmp/LTL3161920653380404069.gal : 8 ms
[2022-05-19 13:25:32] [INFO ] Time to serialize properties into /tmp/LTL5796277228788316775.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3161920653380404069.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5796277228788316775.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3161920...245
Read 1 LTL properties
Checking formula 0 : !((F(G("(i10.i1.i1.u148.p1314!=1)"))))
Formula 0 simplified : !FG"(i10.i1.i1.u148.p1314!=1)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 6.21554e+61 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18071602274065425498
[2022-05-19 13:25:47] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18071602274065425498
Running compilation step : cd /tmp/ltsmin18071602274065425498;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1784 ms.
Running link step : cd /tmp/ltsmin18071602274065425498;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin18071602274065425498;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPt-PT-050B-LTLFireability-01 finished in 110781 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G((X(p0)||(X(p1)&&p2))))))'
Support contains 4 out of 2957 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2957/2957 places, 2707/2707 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 2952 transition count 2702
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 2952 transition count 2702
Applied a total of 10 rules in 318 ms. Remains 2952 /2957 variables (removed 5) and now considering 2702/2707 (removed 5) transitions.
// Phase 1: matrix 2702 rows 2952 cols
[2022-05-19 13:26:02] [INFO ] Computed 451 place invariants in 13 ms
[2022-05-19 13:26:03] [INFO ] Implicit Places using invariants in 947 ms returned []
// Phase 1: matrix 2702 rows 2952 cols
[2022-05-19 13:26:03] [INFO ] Computed 451 place invariants in 10 ms
[2022-05-19 13:26:06] [INFO ] Implicit Places using invariants and state equation in 2964 ms returned []
Implicit Place search using SMT with State Equation took 3914 ms to find 0 implicit places.
// Phase 1: matrix 2702 rows 2952 cols
[2022-05-19 13:26:06] [INFO ] Computed 451 place invariants in 6 ms
[2022-05-19 13:26:08] [INFO ] Dead Transitions using invariants and state equation in 1804 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2952/2957 places, 2702/2707 transitions.
Finished structural reductions, in 1 iterations. Remains : 2952/2957 places, 2702/2707 transitions.
Stuttering acceptance computed with spot in 98 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(OR (AND p2 p0) (AND p2 p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p2) p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 p0), acceptance={} source=1 dest: 0}, { cond=(OR (AND p2 (NOT p0)) (AND (NOT p0) (NOT p1))), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(EQ s2197 1), p0:(OR (EQ s2853 0) (EQ s2855 0)), p1:(EQ s269 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 758 ms.
Stack based approach found an accepted trace after 2033 steps with 0 reset with depth 2034 and stack size 2034 in 17 ms.
FORMULA ShieldIIPt-PT-050B-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-050B-LTLFireability-02 finished in 6962 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G((X(X(p0))&&p1))||F(G(p2))))))'
Support contains 4 out of 2957 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2957/2957 places, 2707/2707 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 2951 transition count 2701
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 2951 transition count 2701
Applied a total of 12 rules in 310 ms. Remains 2951 /2957 variables (removed 6) and now considering 2701/2707 (removed 6) transitions.
// Phase 1: matrix 2701 rows 2951 cols
[2022-05-19 13:26:09] [INFO ] Computed 451 place invariants in 12 ms
[2022-05-19 13:26:10] [INFO ] Implicit Places using invariants in 929 ms returned []
// Phase 1: matrix 2701 rows 2951 cols
[2022-05-19 13:26:10] [INFO ] Computed 451 place invariants in 14 ms
[2022-05-19 13:26:13] [INFO ] Implicit Places using invariants and state equation in 2741 ms returned []
Implicit Place search using SMT with State Equation took 3672 ms to find 0 implicit places.
// Phase 1: matrix 2701 rows 2951 cols
[2022-05-19 13:26:13] [INFO ] Computed 451 place invariants in 7 ms
[2022-05-19 13:26:15] [INFO ] Dead Transitions using invariants and state equation in 1774 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2951/2957 places, 2701/2707 transitions.
Finished structural reductions, in 1 iterations. Remains : 2951/2957 places, 2701/2707 transitions.
Stuttering acceptance computed with spot in 210 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=4, aps=[p1:(EQ s848 0), p2:(EQ s2757 1), p0:(AND (EQ s2905 1) (EQ s2932 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 808 ms.
Stack based approach found an accepted trace after 2597 steps with 0 reset with depth 2598 and stack size 2598 in 25 ms.
FORMULA ShieldIIPt-PT-050B-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-050B-LTLFireability-03 finished in 6845 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((!(F(p0)||p1) U (F(X(p2))||p3))||X(p4)))'
Support contains 4 out of 2957 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2957/2957 places, 2707/2707 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 2952 transition count 2702
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 2952 transition count 2702
Applied a total of 10 rules in 337 ms. Remains 2952 /2957 variables (removed 5) and now considering 2702/2707 (removed 5) transitions.
// Phase 1: matrix 2702 rows 2952 cols
[2022-05-19 13:26:16] [INFO ] Computed 451 place invariants in 13 ms
[2022-05-19 13:26:17] [INFO ] Implicit Places using invariants in 964 ms returned []
// Phase 1: matrix 2702 rows 2952 cols
[2022-05-19 13:26:17] [INFO ] Computed 451 place invariants in 6 ms
[2022-05-19 13:26:20] [INFO ] Implicit Places using invariants and state equation in 2978 ms returned []
Implicit Place search using SMT with State Equation took 3943 ms to find 0 implicit places.
// Phase 1: matrix 2702 rows 2952 cols
[2022-05-19 13:26:20] [INFO ] Computed 451 place invariants in 7 ms
[2022-05-19 13:26:22] [INFO ] Dead Transitions using invariants and state equation in 1781 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2952/2957 places, 2702/2707 transitions.
Finished structural reductions, in 1 iterations. Remains : 2952/2957 places, 2702/2707 transitions.
Stuttering acceptance computed with spot in 264 ms :[(AND (NOT p2) p0), (AND (NOT p2) (NOT p3) (NOT p4)), (AND (NOT p2) (NOT p4)), (OR (AND (NOT p2) (NOT p3) (NOT p4)) (AND p0 (NOT p2) (NOT p4))), (OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p2))), (NOT p2)]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 5}], [{ cond=(OR (AND (NOT p3) p1) (AND (NOT p3) p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p4) (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND p3 (NOT p0) (NOT p4) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p3) (NOT p1) (NOT p0) (NOT p4) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(OR (AND (NOT p3) p1 (NOT p4) (NOT p2)) (AND p0 (NOT p4) (NOT p2))), acceptance={} source=3 dest: 5}], [{ cond=(AND p3 (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(OR (AND (NOT p3) p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={0} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=1, aps=[p0:(EQ s2067 1), p2:(EQ s1558 1), p3:(EQ s2561 1), p1:(EQ s926 1), p4:(EQ s2561 0)], 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, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2369 ms.
Product exploration explored 100000 steps with 50000 reset in 2277 ms.
Computed a total of 798 stabilizing places and 798 stable transitions
Computed a total of 798 stabilizing places and 798 stable transitions
Detected a total of 798/2952 stabilizing places and 798/2702 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/5 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1) p4), (X (NOT (AND (NOT p3) (NOT p1) (NOT p0) (NOT p4) (NOT p2)))), (X (NOT (OR (AND (NOT p3) p1 (NOT p4) (NOT p2)) (AND p0 (NOT p4) (NOT p2))))), (X (NOT (AND (NOT p4) (NOT p2)))), (X (NOT (AND p3 (NOT p0) (NOT p4) (NOT p2)))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p3 (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p3) p1 (NOT p2)) (AND p0 (NOT p2)))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p4) (NOT p2))))
Knowledge based reduction with 12 factoid took 221 ms. Reduced automaton from 6 states, 12 edges and 5 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldIIPt-PT-050B-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-050B-LTLFireability-04 finished in 11269 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)||G(p1))))'
Support contains 5 out of 2957 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2957/2957 places, 2707/2707 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 2952 transition count 2702
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 2952 transition count 2702
Applied a total of 10 rules in 321 ms. Remains 2952 /2957 variables (removed 5) and now considering 2702/2707 (removed 5) transitions.
// Phase 1: matrix 2702 rows 2952 cols
[2022-05-19 13:26:28] [INFO ] Computed 451 place invariants in 16 ms
[2022-05-19 13:26:28] [INFO ] Implicit Places using invariants in 877 ms returned []
// Phase 1: matrix 2702 rows 2952 cols
[2022-05-19 13:26:28] [INFO ] Computed 451 place invariants in 11 ms
[2022-05-19 13:26:31] [INFO ] Implicit Places using invariants and state equation in 2836 ms returned []
Implicit Place search using SMT with State Equation took 3714 ms to find 0 implicit places.
// Phase 1: matrix 2702 rows 2952 cols
[2022-05-19 13:26:31] [INFO ] Computed 451 place invariants in 6 ms
[2022-05-19 13:26:33] [INFO ] Dead Transitions using invariants and state equation in 1738 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2952/2957 places, 2702/2707 transitions.
Finished structural reductions, in 1 iterations. Remains : 2952/2957 places, 2702/2707 transitions.
Stuttering acceptance computed with spot in 189 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(AND (EQ s739 0) (OR (EQ s1408 0) (EQ s1419 0) (EQ s1445 0))), p1:(EQ s420 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1571 ms.
Product exploration explored 100000 steps with 33333 reset in 1590 ms.
Computed a total of 798 stabilizing places and 798 stable transitions
Computed a total of 798 stabilizing places and 798 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND p1 (NOT p0)))))
Knowledge based reduction with 5 factoid took 124 ms. Reduced automaton from 6 states, 9 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldIIPt-PT-050B-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-050B-LTLFireability-05 finished in 9317 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(X(X((G(X(F(X(p0))))&&p1)))))))'
Support contains 4 out of 2957 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2957/2957 places, 2707/2707 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 2952 transition count 2702
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 2952 transition count 2702
Applied a total of 10 rules in 322 ms. Remains 2952 /2957 variables (removed 5) and now considering 2702/2707 (removed 5) transitions.
// Phase 1: matrix 2702 rows 2952 cols
[2022-05-19 13:26:37] [INFO ] Computed 451 place invariants in 14 ms
[2022-05-19 13:26:38] [INFO ] Implicit Places using invariants in 890 ms returned []
// Phase 1: matrix 2702 rows 2952 cols
[2022-05-19 13:26:38] [INFO ] Computed 451 place invariants in 6 ms
[2022-05-19 13:26:41] [INFO ] Implicit Places using invariants and state equation in 2883 ms returned []
Implicit Place search using SMT with State Equation took 3774 ms to find 0 implicit places.
// Phase 1: matrix 2702 rows 2952 cols
[2022-05-19 13:26:41] [INFO ] Computed 451 place invariants in 7 ms
[2022-05-19 13:26:42] [INFO ] Dead Transitions using invariants and state equation in 1841 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2952/2957 places, 2702/2707 transitions.
Finished structural reductions, in 1 iterations. Remains : 2952/2957 places, 2702/2707 transitions.
Stuttering acceptance computed with spot in 275 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLFireability-09 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=(NOT p0), acceptance={} source=3 dest: 4}, { cond=true, acceptance={} source=3 dest: 5}, { cond=(NOT p1), acceptance={} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(OR (EQ s1584 0) (EQ s1609 0) (EQ s1618 0)), p1:(EQ s1717 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, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3 reset in 734 ms.
Product exploration explored 100000 steps with 0 reset in 999 ms.
Computed a total of 799 stabilizing places and 799 stable transitions
Computed a total of 799 stabilizing places and 799 stable transitions
Detected a total of 799/2952 stabilizing places and 799/2702 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 171 ms. Reduced automaton from 7 states, 10 edges and 2 AP to 7 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 268 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 2) seen :1
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
Running SMT prover for 1 properties.
// Phase 1: matrix 2702 rows 2952 cols
[2022-05-19 13:26:45] [INFO ] Computed 451 place invariants in 14 ms
[2022-05-19 13:26:45] [INFO ] After 350ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 13:26:46] [INFO ] [Nat]Absence check using 451 positive place invariants in 165 ms returned sat
[2022-05-19 13:26:47] [INFO ] After 1418ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 13:26:48] [INFO ] Deduced a trap composed of 25 places in 663 ms of which 1 ms to minimize.
[2022-05-19 13:26:49] [INFO ] Deduced a trap composed of 38 places in 668 ms of which 3 ms to minimize.
[2022-05-19 13:26:50] [INFO ] Deduced a trap composed of 15 places in 658 ms of which 1 ms to minimize.
[2022-05-19 13:26:50] [INFO ] Deduced a trap composed of 13 places in 663 ms of which 1 ms to minimize.
[2022-05-19 13:26:51] [INFO ] Deduced a trap composed of 16 places in 636 ms of which 1 ms to minimize.
[2022-05-19 13:26:52] [INFO ] Deduced a trap composed of 21 places in 646 ms of which 2 ms to minimize.
[2022-05-19 13:26:53] [INFO ] Deduced a trap composed of 23 places in 605 ms of which 1 ms to minimize.
[2022-05-19 13:26:53] [INFO ] Deduced a trap composed of 17 places in 620 ms of which 2 ms to minimize.
[2022-05-19 13:26:54] [INFO ] Deduced a trap composed of 29 places in 617 ms of which 2 ms to minimize.
[2022-05-19 13:26:55] [INFO ] Deduced a trap composed of 21 places in 616 ms of which 1 ms to minimize.
[2022-05-19 13:26:55] [INFO ] Deduced a trap composed of 26 places in 598 ms of which 2 ms to minimize.
[2022-05-19 13:26:56] [INFO ] Deduced a trap composed of 25 places in 592 ms of which 2 ms to minimize.
[2022-05-19 13:26:57] [INFO ] Deduced a trap composed of 24 places in 593 ms of which 2 ms to minimize.
[2022-05-19 13:26:57] [INFO ] Deduced a trap composed of 24 places in 563 ms of which 1 ms to minimize.
[2022-05-19 13:26:58] [INFO ] Deduced a trap composed of 33 places in 582 ms of which 2 ms to minimize.
[2022-05-19 13:26:59] [INFO ] Deduced a trap composed of 18 places in 591 ms of which 1 ms to minimize.
[2022-05-19 13:27:00] [INFO ] Deduced a trap composed of 34 places in 580 ms of which 1 ms to minimize.
[2022-05-19 13:27:00] [INFO ] Deduced a trap composed of 24 places in 571 ms of which 1 ms to minimize.
[2022-05-19 13:27:01] [INFO ] Deduced a trap composed of 27 places in 557 ms of which 1 ms to minimize.
[2022-05-19 13:27:01] [INFO ] Deduced a trap composed of 32 places in 546 ms of which 2 ms to minimize.
[2022-05-19 13:27:02] [INFO ] Deduced a trap composed of 23 places in 520 ms of which 1 ms to minimize.
[2022-05-19 13:27:03] [INFO ] Deduced a trap composed of 25 places in 536 ms of which 1 ms to minimize.
[2022-05-19 13:27:03] [INFO ] Deduced a trap composed of 19 places in 525 ms of which 2 ms to minimize.
[2022-05-19 13:27:04] [INFO ] Deduced a trap composed of 33 places in 518 ms of which 1 ms to minimize.
[2022-05-19 13:27:05] [INFO ] Deduced a trap composed of 33 places in 497 ms of which 1 ms to minimize.
[2022-05-19 13:27:05] [INFO ] Deduced a trap composed of 37 places in 534 ms of which 1 ms to minimize.
[2022-05-19 13:27:06] [INFO ] Deduced a trap composed of 37 places in 532 ms of which 2 ms to minimize.
[2022-05-19 13:27:06] [INFO ] Deduced a trap composed of 26 places in 499 ms of which 1 ms to minimize.
[2022-05-19 13:27:07] [INFO ] Deduced a trap composed of 35 places in 483 ms of which 2 ms to minimize.
[2022-05-19 13:27:08] [INFO ] Deduced a trap composed of 37 places in 516 ms of which 2 ms to minimize.
[2022-05-19 13:27:08] [INFO ] Deduced a trap composed of 36 places in 494 ms of which 1 ms to minimize.
[2022-05-19 13:27:09] [INFO ] Deduced a trap composed of 35 places in 503 ms of which 1 ms to minimize.
[2022-05-19 13:27:09] [INFO ] Deduced a trap composed of 36 places in 488 ms of which 1 ms to minimize.
[2022-05-19 13:27:10] [INFO ] Deduced a trap composed of 42 places in 476 ms of which 1 ms to minimize.
[2022-05-19 13:27:11] [INFO ] Deduced a trap composed of 48 places in 465 ms of which 1 ms to minimize.
[2022-05-19 13:27:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 13:27:11] [INFO ] After 25052ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 25 ms.
Support contains 3 out of 2952 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2952/2952 places, 2702/2702 transitions.
Drop transitions removed 600 transitions
Trivial Post-agglo rules discarded 600 transitions
Performed 600 trivial Post agglomeration. Transition count delta: 600
Iterating post reduction 0 with 600 rules applied. Total rules applied 600 place count 2952 transition count 2102
Reduce places removed 600 places and 0 transitions.
Iterating post reduction 1 with 600 rules applied. Total rules applied 1200 place count 2352 transition count 2102
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 399 Pre rules applied. Total rules applied 1200 place count 2352 transition count 1703
Deduced a syphon composed of 399 places in 2 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 2 with 798 rules applied. Total rules applied 1998 place count 1953 transition count 1703
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1999 place count 1952 transition count 1702
Iterating global reduction 2 with 1 rules applied. Total rules applied 2000 place count 1952 transition count 1702
Performed 849 Post agglomeration using F-continuation condition.Transition count delta: 849
Deduced a syphon composed of 849 places in 1 ms
Reduce places removed 849 places and 0 transitions.
Iterating global reduction 2 with 1698 rules applied. Total rules applied 3698 place count 1103 transition count 853
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3699 place count 1103 transition count 852
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 3701 place count 1102 transition count 851
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3903 place count 1001 transition count 917
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 3999 place count 953 transition count 950
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4000 place count 953 transition count 949
Partial Free-agglomeration rule applied 50 times.
Drop transitions removed 50 transitions
Iterating global reduction 4 with 50 rules applied. Total rules applied 4050 place count 953 transition count 949
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4051 place count 952 transition count 948
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 4053 place count 950 transition count 948
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 4053 place count 950 transition count 947
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 4055 place count 949 transition count 947
Applied a total of 4055 rules in 492 ms. Remains 949 /2952 variables (removed 2003) and now considering 947/2702 (removed 1755) transitions.
Finished structural reductions, in 1 iterations. Remains : 949/2952 places, 947/2702 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 199582 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 199582 steps, saw 128358 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 947 rows 949 cols
[2022-05-19 13:27:14] [INFO ] Computed 449 place invariants in 1 ms
[2022-05-19 13:27:14] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 13:27:14] [INFO ] [Nat]Absence check using 449 positive place invariants in 63 ms returned sat
[2022-05-19 13:27:15] [INFO ] After 345ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 13:27:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 13:27:15] [INFO ] After 41ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 13:27:15] [INFO ] After 106ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2022-05-19 13:27:15] [INFO ] After 692ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 3 out of 949 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 949/949 places, 947/947 transitions.
Applied a total of 0 rules in 16 ms. Remains 949 /949 variables (removed 0) and now considering 947/947 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 949/949 places, 947/947 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 949/949 places, 947/947 transitions.
Applied a total of 0 rules in 15 ms. Remains 949 /949 variables (removed 0) and now considering 947/947 (removed 0) transitions.
// Phase 1: matrix 947 rows 949 cols
[2022-05-19 13:27:15] [INFO ] Computed 449 place invariants in 3 ms
[2022-05-19 13:27:16] [INFO ] Implicit Places using invariants in 494 ms returned [938]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 499 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 948/949 places, 947/947 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 947 transition count 946
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 947 transition count 946
Applied a total of 2 rules in 34 ms. Remains 947 /948 variables (removed 1) and now considering 946/947 (removed 1) transitions.
// Phase 1: matrix 946 rows 947 cols
[2022-05-19 13:27:16] [INFO ] Computed 448 place invariants in 3 ms
[2022-05-19 13:27:16] [INFO ] Implicit Places using invariants in 526 ms returned []
// Phase 1: matrix 946 rows 947 cols
[2022-05-19 13:27:16] [INFO ] Computed 448 place invariants in 2 ms
[2022-05-19 13:27:17] [INFO ] Implicit Places using invariants and state equation in 982 ms returned []
Implicit Place search using SMT with State Equation took 1510 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 947/949 places, 946/947 transitions.
Finished structural reductions, in 2 iterations. Remains : 947/949 places, 946/947 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 198036 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :{}
Probabilistic random walk after 198036 steps, saw 127292 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 946 rows 947 cols
[2022-05-19 13:27:20] [INFO ] Computed 448 place invariants in 7 ms
[2022-05-19 13:27:20] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 13:27:21] [INFO ] [Nat]Absence check using 448 positive place invariants in 64 ms returned sat
[2022-05-19 13:27:21] [INFO ] After 349ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 13:27:21] [INFO ] After 418ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2022-05-19 13:27:21] [INFO ] After 652ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 3 out of 947 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 947/947 places, 946/946 transitions.
Applied a total of 0 rules in 16 ms. Remains 947 /947 variables (removed 0) and now considering 946/946 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 947/947 places, 946/946 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 947/947 places, 946/946 transitions.
Applied a total of 0 rules in 14 ms. Remains 947 /947 variables (removed 0) and now considering 946/946 (removed 0) transitions.
// Phase 1: matrix 946 rows 947 cols
[2022-05-19 13:27:21] [INFO ] Computed 448 place invariants in 2 ms
[2022-05-19 13:27:22] [INFO ] Implicit Places using invariants in 493 ms returned []
// Phase 1: matrix 946 rows 947 cols
[2022-05-19 13:27:22] [INFO ] Computed 448 place invariants in 1 ms
[2022-05-19 13:27:22] [INFO ] Implicit Places using invariants and state equation in 979 ms returned []
Implicit Place search using SMT with State Equation took 1474 ms to find 0 implicit places.
[2022-05-19 13:27:22] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 946 rows 947 cols
[2022-05-19 13:27:23] [INFO ] Computed 448 place invariants in 3 ms
[2022-05-19 13:27:23] [INFO ] Dead Transitions using invariants and state equation in 457 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 947/947 places, 946/946 transitions.
Partial Free-agglomeration rule applied 99 times.
Drop transitions removed 99 transitions
Iterating global reduction 0 with 99 rules applied. Total rules applied 99 place count 947 transition count 946
Applied a total of 99 rules in 26 ms. Remains 947 /947 variables (removed 0) and now considering 946/946 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 946 rows 947 cols
[2022-05-19 13:27:23] [INFO ] Computed 448 place invariants in 2 ms
[2022-05-19 13:27:23] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 13:27:23] [INFO ] [Nat]Absence check using 448 positive place invariants in 63 ms returned sat
[2022-05-19 13:27:24] [INFO ] After 341ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 13:27:24] [INFO ] State equation strengthened by 97 read => feed constraints.
[2022-05-19 13:27:24] [INFO ] After 90ms SMT Verify possible using 97 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 13:27:24] [INFO ] After 151ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2022-05-19 13:27:24] [INFO ] After 720ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-19 13:27:24] [INFO ] Flatten gal took : 31 ms
[2022-05-19 13:27:24] [INFO ] Flatten gal took : 30 ms
[2022-05-19 13:27:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14526220009701536401.gal : 6 ms
[2022-05-19 13:27:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17713814486194068647.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms5392696725052746209;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14526220009701536401.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17713814486194068647.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality17713814486194068647.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 40
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :40 after 116
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :116 after 248
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,399,0.437341,12936,2,1679,10,6266,6,0,4688,2329,0
Total reachable state count : 399

Verifying 1 reachability properties.
Reachability property apf0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,1,0.440026,12936,2,948,10,6266,7,0,4697,2329,0
Knowledge obtained : [(AND p0 (NOT p1)), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 173 ms. Reduced automaton from 7 states, 10 edges and 2 AP to 7 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 261 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 250 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
// Phase 1: matrix 2702 rows 2952 cols
[2022-05-19 13:27:25] [INFO ] Computed 451 place invariants in 9 ms
[2022-05-19 13:27:27] [INFO ] [Real]Absence check using 451 positive place invariants in 841 ms returned sat
[2022-05-19 13:27:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 13:27:40] [INFO ] [Real]Absence check using state equation in 12777 ms returned unknown
Could not prove EG (NOT p1)
Support contains 4 out of 2952 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2952/2952 places, 2702/2702 transitions.
Applied a total of 0 rules in 155 ms. Remains 2952 /2952 variables (removed 0) and now considering 2702/2702 (removed 0) transitions.
// Phase 1: matrix 2702 rows 2952 cols
[2022-05-19 13:27:40] [INFO ] Computed 451 place invariants in 17 ms
[2022-05-19 13:27:41] [INFO ] Implicit Places using invariants in 969 ms returned []
// Phase 1: matrix 2702 rows 2952 cols
[2022-05-19 13:27:41] [INFO ] Computed 451 place invariants in 6 ms
[2022-05-19 13:27:44] [INFO ] Implicit Places using invariants and state equation in 2849 ms returned []
Implicit Place search using SMT with State Equation took 3819 ms to find 0 implicit places.
// Phase 1: matrix 2702 rows 2952 cols
[2022-05-19 13:27:44] [INFO ] Computed 451 place invariants in 15 ms
[2022-05-19 13:27:46] [INFO ] Dead Transitions using invariants and state equation in 1804 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2952/2952 places, 2702/2702 transitions.
Computed a total of 799 stabilizing places and 799 stable transitions
Computed a total of 799 stabilizing places and 799 stable transitions
Detected a total of 799/2952 stabilizing places and 799/2702 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 7 states, 10 edges and 2 AP to 7 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 309 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 2) seen :1
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
Running SMT prover for 1 properties.
// Phase 1: matrix 2702 rows 2952 cols
[2022-05-19 13:27:47] [INFO ] Computed 451 place invariants in 15 ms
[2022-05-19 13:27:47] [INFO ] After 331ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 13:27:47] [INFO ] [Nat]Absence check using 451 positive place invariants in 168 ms returned sat
[2022-05-19 13:27:49] [INFO ] After 1416ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 13:27:50] [INFO ] Deduced a trap composed of 25 places in 668 ms of which 1 ms to minimize.
[2022-05-19 13:27:50] [INFO ] Deduced a trap composed of 38 places in 650 ms of which 2 ms to minimize.
[2022-05-19 13:27:51] [INFO ] Deduced a trap composed of 15 places in 640 ms of which 1 ms to minimize.
[2022-05-19 13:27:52] [INFO ] Deduced a trap composed of 13 places in 665 ms of which 2 ms to minimize.
[2022-05-19 13:27:52] [INFO ] Deduced a trap composed of 16 places in 626 ms of which 1 ms to minimize.
[2022-05-19 13:27:53] [INFO ] Deduced a trap composed of 21 places in 608 ms of which 1 ms to minimize.
[2022-05-19 13:27:54] [INFO ] Deduced a trap composed of 23 places in 605 ms of which 1 ms to minimize.
[2022-05-19 13:27:55] [INFO ] Deduced a trap composed of 17 places in 588 ms of which 2 ms to minimize.
[2022-05-19 13:27:55] [INFO ] Deduced a trap composed of 29 places in 629 ms of which 1 ms to minimize.
[2022-05-19 13:27:56] [INFO ] Deduced a trap composed of 21 places in 624 ms of which 2 ms to minimize.
[2022-05-19 13:27:57] [INFO ] Deduced a trap composed of 26 places in 627 ms of which 2 ms to minimize.
[2022-05-19 13:27:57] [INFO ] Deduced a trap composed of 25 places in 604 ms of which 1 ms to minimize.
[2022-05-19 13:27:58] [INFO ] Deduced a trap composed of 24 places in 593 ms of which 1 ms to minimize.
[2022-05-19 13:27:59] [INFO ] Deduced a trap composed of 24 places in 594 ms of which 1 ms to minimize.
[2022-05-19 13:28:00] [INFO ] Deduced a trap composed of 33 places in 577 ms of which 1 ms to minimize.
[2022-05-19 13:28:00] [INFO ] Deduced a trap composed of 18 places in 557 ms of which 2 ms to minimize.
[2022-05-19 13:28:01] [INFO ] Deduced a trap composed of 34 places in 584 ms of which 2 ms to minimize.
[2022-05-19 13:28:02] [INFO ] Deduced a trap composed of 24 places in 577 ms of which 1 ms to minimize.
[2022-05-19 13:28:02] [INFO ] Deduced a trap composed of 27 places in 568 ms of which 2 ms to minimize.
[2022-05-19 13:28:03] [INFO ] Deduced a trap composed of 32 places in 559 ms of which 1 ms to minimize.
[2022-05-19 13:28:04] [INFO ] Deduced a trap composed of 23 places in 542 ms of which 1 ms to minimize.
[2022-05-19 13:28:04] [INFO ] Deduced a trap composed of 25 places in 518 ms of which 1 ms to minimize.
[2022-05-19 13:28:05] [INFO ] Deduced a trap composed of 19 places in 508 ms of which 2 ms to minimize.
[2022-05-19 13:28:05] [INFO ] Deduced a trap composed of 33 places in 512 ms of which 1 ms to minimize.
[2022-05-19 13:28:06] [INFO ] Deduced a trap composed of 33 places in 510 ms of which 1 ms to minimize.
[2022-05-19 13:28:07] [INFO ] Deduced a trap composed of 37 places in 542 ms of which 2 ms to minimize.
[2022-05-19 13:28:07] [INFO ] Deduced a trap composed of 37 places in 554 ms of which 1 ms to minimize.
[2022-05-19 13:28:08] [INFO ] Deduced a trap composed of 26 places in 501 ms of which 2 ms to minimize.
[2022-05-19 13:28:08] [INFO ] Deduced a trap composed of 35 places in 516 ms of which 2 ms to minimize.
[2022-05-19 13:28:09] [INFO ] Deduced a trap composed of 37 places in 511 ms of which 1 ms to minimize.
[2022-05-19 13:28:10] [INFO ] Deduced a trap composed of 36 places in 490 ms of which 1 ms to minimize.
[2022-05-19 13:28:10] [INFO ] Deduced a trap composed of 35 places in 497 ms of which 5 ms to minimize.
[2022-05-19 13:28:11] [INFO ] Deduced a trap composed of 36 places in 475 ms of which 1 ms to minimize.
[2022-05-19 13:28:11] [INFO ] Deduced a trap composed of 42 places in 470 ms of which 1 ms to minimize.
[2022-05-19 13:28:12] [INFO ] Deduced a trap composed of 48 places in 470 ms of which 1 ms to minimize.
[2022-05-19 13:28:12] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 13:28:12] [INFO ] After 25056ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 24 ms.
Support contains 3 out of 2952 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2952/2952 places, 2702/2702 transitions.
Drop transitions removed 600 transitions
Trivial Post-agglo rules discarded 600 transitions
Performed 600 trivial Post agglomeration. Transition count delta: 600
Iterating post reduction 0 with 600 rules applied. Total rules applied 600 place count 2952 transition count 2102
Reduce places removed 600 places and 0 transitions.
Iterating post reduction 1 with 600 rules applied. Total rules applied 1200 place count 2352 transition count 2102
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 399 Pre rules applied. Total rules applied 1200 place count 2352 transition count 1703
Deduced a syphon composed of 399 places in 3 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 2 with 798 rules applied. Total rules applied 1998 place count 1953 transition count 1703
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1999 place count 1952 transition count 1702
Iterating global reduction 2 with 1 rules applied. Total rules applied 2000 place count 1952 transition count 1702
Performed 849 Post agglomeration using F-continuation condition.Transition count delta: 849
Deduced a syphon composed of 849 places in 1 ms
Reduce places removed 849 places and 0 transitions.
Iterating global reduction 2 with 1698 rules applied. Total rules applied 3698 place count 1103 transition count 853
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3699 place count 1103 transition count 852
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 3701 place count 1102 transition count 851
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3903 place count 1001 transition count 917
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 3999 place count 953 transition count 950
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4000 place count 953 transition count 949
Partial Free-agglomeration rule applied 50 times.
Drop transitions removed 50 transitions
Iterating global reduction 4 with 50 rules applied. Total rules applied 4050 place count 953 transition count 949
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4051 place count 952 transition count 948
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 4053 place count 950 transition count 948
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 4053 place count 950 transition count 947
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 4055 place count 949 transition count 947
Applied a total of 4055 rules in 449 ms. Remains 949 /2952 variables (removed 2003) and now considering 947/2702 (removed 1755) transitions.
Finished structural reductions, in 1 iterations. Remains : 949/2952 places, 947/2702 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 200797 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 200797 steps, saw 129114 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 947 rows 949 cols
[2022-05-19 13:28:16] [INFO ] Computed 449 place invariants in 4 ms
[2022-05-19 13:28:16] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 13:28:16] [INFO ] [Nat]Absence check using 449 positive place invariants in 63 ms returned sat
[2022-05-19 13:28:16] [INFO ] After 344ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 13:28:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 13:28:16] [INFO ] After 35ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 13:28:16] [INFO ] After 98ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2022-05-19 13:28:16] [INFO ] After 673ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 3 out of 949 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 949/949 places, 947/947 transitions.
Applied a total of 0 rules in 14 ms. Remains 949 /949 variables (removed 0) and now considering 947/947 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 949/949 places, 947/947 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 949/949 places, 947/947 transitions.
Applied a total of 0 rules in 13 ms. Remains 949 /949 variables (removed 0) and now considering 947/947 (removed 0) transitions.
// Phase 1: matrix 947 rows 949 cols
[2022-05-19 13:28:16] [INFO ] Computed 449 place invariants in 3 ms
[2022-05-19 13:28:17] [INFO ] Implicit Places using invariants in 513 ms returned [938]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 514 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 948/949 places, 947/947 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 947 transition count 946
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 947 transition count 946
Applied a total of 2 rules in 25 ms. Remains 947 /948 variables (removed 1) and now considering 946/947 (removed 1) transitions.
// Phase 1: matrix 946 rows 947 cols
[2022-05-19 13:28:17] [INFO ] Computed 448 place invariants in 2 ms
[2022-05-19 13:28:17] [INFO ] Implicit Places using invariants in 479 ms returned []
// Phase 1: matrix 946 rows 947 cols
[2022-05-19 13:28:17] [INFO ] Computed 448 place invariants in 1 ms
[2022-05-19 13:28:18] [INFO ] Implicit Places using invariants and state equation in 968 ms returned []
Implicit Place search using SMT with State Equation took 1448 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 947/949 places, 946/947 transitions.
Finished structural reductions, in 2 iterations. Remains : 947/949 places, 946/947 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 201829 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :{}
Probabilistic random walk after 201829 steps, saw 129877 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 946 rows 947 cols
[2022-05-19 13:28:21] [INFO ] Computed 448 place invariants in 3 ms
[2022-05-19 13:28:22] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 13:28:22] [INFO ] [Nat]Absence check using 448 positive place invariants in 63 ms returned sat
[2022-05-19 13:28:22] [INFO ] After 347ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 13:28:22] [INFO ] After 420ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2022-05-19 13:28:22] [INFO ] After 645ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 3 out of 947 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 947/947 places, 946/946 transitions.
Applied a total of 0 rules in 13 ms. Remains 947 /947 variables (removed 0) and now considering 946/946 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 947/947 places, 946/946 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 947/947 places, 946/946 transitions.
Applied a total of 0 rules in 13 ms. Remains 947 /947 variables (removed 0) and now considering 946/946 (removed 0) transitions.
// Phase 1: matrix 946 rows 947 cols
[2022-05-19 13:28:22] [INFO ] Computed 448 place invariants in 3 ms
[2022-05-19 13:28:23] [INFO ] Implicit Places using invariants in 512 ms returned []
// Phase 1: matrix 946 rows 947 cols
[2022-05-19 13:28:23] [INFO ] Computed 448 place invariants in 1 ms
[2022-05-19 13:28:24] [INFO ] Implicit Places using invariants and state equation in 972 ms returned []
Implicit Place search using SMT with State Equation took 1485 ms to find 0 implicit places.
[2022-05-19 13:28:24] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 946 rows 947 cols
[2022-05-19 13:28:24] [INFO ] Computed 448 place invariants in 3 ms
[2022-05-19 13:28:24] [INFO ] Dead Transitions using invariants and state equation in 438 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 947/947 places, 946/946 transitions.
Partial Free-agglomeration rule applied 99 times.
Drop transitions removed 99 transitions
Iterating global reduction 0 with 99 rules applied. Total rules applied 99 place count 947 transition count 946
Applied a total of 99 rules in 26 ms. Remains 947 /947 variables (removed 0) and now considering 946/946 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 946 rows 947 cols
[2022-05-19 13:28:24] [INFO ] Computed 448 place invariants in 2 ms
[2022-05-19 13:28:24] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 13:28:25] [INFO ] [Nat]Absence check using 448 positive place invariants in 61 ms returned sat
[2022-05-19 13:28:25] [INFO ] After 352ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 13:28:25] [INFO ] State equation strengthened by 97 read => feed constraints.
[2022-05-19 13:28:25] [INFO ] After 93ms SMT Verify possible using 97 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 13:28:25] [INFO ] After 164ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2022-05-19 13:28:25] [INFO ] After 757ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-19 13:28:25] [INFO ] Flatten gal took : 30 ms
[2022-05-19 13:28:25] [INFO ] Flatten gal took : 30 ms
[2022-05-19 13:28:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2701661348940063876.gal : 3 ms
[2022-05-19 13:28:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3546232235520976709.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms10816723825219001896;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2701661348940063876.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3546232235520976709.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality3546232235520976709.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 40
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :40 after 116
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :116 after 248
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,399,0.439142,12940,2,1679,10,6266,6,0,4688,2329,0
Total reachable state count : 399

Verifying 1 reachability properties.
Reachability property apf0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,1,0.44191,12940,2,948,10,6266,7,0,4697,2329,0
Knowledge obtained : [(AND p0 (NOT p1)), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 182 ms. Reduced automaton from 7 states, 10 edges and 2 AP to 7 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 281 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
// Phase 1: matrix 2702 rows 2952 cols
[2022-05-19 13:28:26] [INFO ] Computed 451 place invariants in 6 ms
[2022-05-19 13:28:29] [INFO ] [Real]Absence check using 451 positive place invariants in 826 ms returned sat
[2022-05-19 13:28:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 13:28:41] [INFO ] [Real]Absence check using state equation in 12861 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 2 reset in 775 ms.
Product exploration explored 100000 steps with 1 reset in 1028 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 271 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Support contains 4 out of 2952 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2952/2952 places, 2702/2702 transitions.
Performed 598 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 598 rules applied. Total rules applied 598 place count 2952 transition count 2702
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 200 Pre rules applied. Total rules applied 598 place count 2952 transition count 2852
Deduced a syphon composed of 798 places in 4 ms
Iterating global reduction 1 with 200 rules applied. Total rules applied 798 place count 2952 transition count 2852
Performed 1000 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1798 places in 3 ms
Iterating global reduction 1 with 1000 rules applied. Total rules applied 1798 place count 2952 transition count 2853
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1799 place count 2952 transition count 2852
Renaming transitions due to excessive name length > 1024 char.
Discarding 399 places :
Symmetric choice reduction at 2 with 399 rule applications. Total rules 2198 place count 2553 transition count 2452
Deduced a syphon composed of 1399 places in 2 ms
Iterating global reduction 2 with 399 rules applied. Total rules applied 2597 place count 2553 transition count 2452
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1400 places in 3 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2598 place count 2553 transition count 2452
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2600 place count 2551 transition count 2450
Deduced a syphon composed of 1398 places in 3 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2602 place count 2551 transition count 2450
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -530
Deduced a syphon composed of 1499 places in 4 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2703 place count 2551 transition count 2980
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 2804 place count 2450 transition count 2778
Deduced a syphon composed of 1398 places in 3 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2905 place count 2450 transition count 2778
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -513
Deduced a syphon composed of 1495 places in 4 ms
Iterating global reduction 2 with 97 rules applied. Total rules applied 3002 place count 2450 transition count 3291
Discarding 97 places :
Symmetric choice reduction at 2 with 97 rule applications. Total rules 3099 place count 2353 transition count 3097
Deduced a syphon composed of 1398 places in 3 ms
Iterating global reduction 2 with 97 rules applied. Total rules applied 3196 place count 2353 transition count 3097
Deduced a syphon composed of 1398 places in 3 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 3205 place count 2353 transition count 3088
Deduced a syphon composed of 1398 places in 3 ms
Applied a total of 3205 rules in 2163 ms. Remains 2353 /2952 variables (removed 599) and now considering 3088/2702 (removed -386) transitions.
[2022-05-19 13:28:46] [INFO ] Redundant transitions in 89 ms returned []
// Phase 1: matrix 3088 rows 2353 cols
[2022-05-19 13:28:46] [INFO ] Computed 451 place invariants in 22 ms
[2022-05-19 13:28:48] [INFO ] Dead Transitions using invariants and state equation in 1697 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2353/2952 places, 3088/2702 transitions.
Finished structural reductions, in 1 iterations. Remains : 2353/2952 places, 3088/2702 transitions.
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 2 ms.
FORMULA ShieldIIPt-PT-050B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050B-LTLFireability-09 finished in 131326 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F(p1)))))'
Support contains 4 out of 2957 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2957/2957 places, 2707/2707 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 2951 transition count 2701
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 2951 transition count 2701
Applied a total of 12 rules in 381 ms. Remains 2951 /2957 variables (removed 6) and now considering 2701/2707 (removed 6) transitions.
// Phase 1: matrix 2701 rows 2951 cols
[2022-05-19 13:28:48] [INFO ] Computed 451 place invariants in 6 ms
[2022-05-19 13:28:49] [INFO ] Implicit Places using invariants in 711 ms returned []
// Phase 1: matrix 2701 rows 2951 cols
[2022-05-19 13:28:49] [INFO ] Computed 451 place invariants in 7 ms
[2022-05-19 13:28:52] [INFO ] Implicit Places using invariants and state equation in 2900 ms returned []
Implicit Place search using SMT with State Equation took 3612 ms to find 0 implicit places.
// Phase 1: matrix 2701 rows 2951 cols
[2022-05-19 13:28:52] [INFO ] Computed 451 place invariants in 14 ms
[2022-05-19 13:28:54] [INFO ] Dead Transitions using invariants and state equation in 1786 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2951/2957 places, 2701/2707 transitions.
Finished structural reductions, in 1 iterations. Remains : 2951/2957 places, 2701/2707 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (NEQ s1697 1) (NEQ s1708 1) (NEQ s1734 1)), p0:(NEQ s83 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 50000 reset in 2264 ms.
Product exploration explored 100000 steps with 50000 reset in 2265 ms.
Computed a total of 798 stabilizing places and 798 stable transitions
Computed a total of 798 stabilizing places and 798 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (X p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p0 (NOT p1))))
Knowledge based reduction with 6 factoid took 104 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldIIPt-PT-050B-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-050B-LTLFireability-11 finished in 10587 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 2957 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2957/2957 places, 2707/2707 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 595 transitions
Trivial Post-agglo rules discarded 595 transitions
Performed 595 trivial Post agglomeration. Transition count delta: 595
Iterating post reduction 0 with 595 rules applied. Total rules applied 595 place count 2956 transition count 2111
Reduce places removed 595 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 596 rules applied. Total rules applied 1191 place count 2361 transition count 2110
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1192 place count 2360 transition count 2110
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 400 Pre rules applied. Total rules applied 1192 place count 2360 transition count 1710
Deduced a syphon composed of 400 places in 2 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 3 with 800 rules applied. Total rules applied 1992 place count 1960 transition count 1710
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1998 place count 1954 transition count 1704
Iterating global reduction 3 with 6 rules applied. Total rules applied 2004 place count 1954 transition count 1704
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 2004 place count 1954 transition count 1699
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 2014 place count 1949 transition count 1699
Performed 847 Post agglomeration using F-continuation condition.Transition count delta: 847
Deduced a syphon composed of 847 places in 2 ms
Reduce places removed 847 places and 0 transitions.
Iterating global reduction 3 with 1694 rules applied. Total rules applied 3708 place count 1102 transition count 852
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3709 place count 1102 transition count 851
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 3711 place count 1101 transition count 850
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3913 place count 1000 transition count 916
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 4009 place count 952 transition count 949
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 4011 place count 950 transition count 947
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 4013 place count 948 transition count 947
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 4013 place count 948 transition count 946
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 4015 place count 947 transition count 946
Applied a total of 4015 rules in 617 ms. Remains 947 /2957 variables (removed 2010) and now considering 946/2707 (removed 1761) transitions.
// Phase 1: matrix 946 rows 947 cols
[2022-05-19 13:28:59] [INFO ] Computed 449 place invariants in 1 ms
[2022-05-19 13:29:00] [INFO ] Implicit Places using invariants in 695 ms returned [936]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 712 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 946/2957 places, 946/2707 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 945 transition count 945
Applied a total of 2 rules in 33 ms. Remains 945 /946 variables (removed 1) and now considering 945/946 (removed 1) transitions.
// Phase 1: matrix 945 rows 945 cols
[2022-05-19 13:29:00] [INFO ] Computed 448 place invariants in 2 ms
[2022-05-19 13:29:01] [INFO ] Implicit Places using invariants in 755 ms returned []
// Phase 1: matrix 945 rows 945 cols
[2022-05-19 13:29:01] [INFO ] Computed 448 place invariants in 1 ms
[2022-05-19 13:29:01] [INFO ] Implicit Places using invariants and state equation in 933 ms returned []
Implicit Place search using SMT with State Equation took 1729 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 945/2957 places, 945/2707 transitions.
Finished structural reductions, in 2 iterations. Remains : 945/2957 places, 945/2707 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s481 1) (EQ s483 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-050B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050B-LTLFireability-12 finished in 3132 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(G(F(G((F(G(p0))||F(p1)))))))))'
Support contains 2 out of 2957 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2957/2957 places, 2707/2707 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 594 transitions
Trivial Post-agglo rules discarded 594 transitions
Performed 594 trivial Post agglomeration. Transition count delta: 594
Iterating post reduction 0 with 594 rules applied. Total rules applied 594 place count 2956 transition count 2112
Reduce places removed 594 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 596 rules applied. Total rules applied 1190 place count 2362 transition count 2110
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1192 place count 2360 transition count 2110
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 400 Pre rules applied. Total rules applied 1192 place count 2360 transition count 1710
Deduced a syphon composed of 400 places in 3 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 3 with 800 rules applied. Total rules applied 1992 place count 1960 transition count 1710
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1998 place count 1954 transition count 1704
Iterating global reduction 3 with 6 rules applied. Total rules applied 2004 place count 1954 transition count 1704
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 2004 place count 1954 transition count 1699
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 2014 place count 1949 transition count 1699
Performed 843 Post agglomeration using F-continuation condition.Transition count delta: 843
Deduced a syphon composed of 843 places in 1 ms
Reduce places removed 843 places and 0 transitions.
Iterating global reduction 3 with 1686 rules applied. Total rules applied 3700 place count 1106 transition count 856
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3701 place count 1106 transition count 855
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 3703 place count 1105 transition count 854
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3905 place count 1004 transition count 920
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 4001 place count 956 transition count 953
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 4003 place count 954 transition count 951
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 4005 place count 952 transition count 951
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 4005 place count 952 transition count 950
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 4007 place count 951 transition count 950
Applied a total of 4007 rules in 541 ms. Remains 951 /2957 variables (removed 2006) and now considering 950/2707 (removed 1757) transitions.
// Phase 1: matrix 950 rows 951 cols
[2022-05-19 13:29:02] [INFO ] Computed 449 place invariants in 2 ms
[2022-05-19 13:29:03] [INFO ] Implicit Places using invariants in 869 ms returned [940]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 886 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 950/2957 places, 950/2707 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 949 transition count 949
Applied a total of 2 rules in 37 ms. Remains 949 /950 variables (removed 1) and now considering 949/950 (removed 1) transitions.
// Phase 1: matrix 949 rows 949 cols
[2022-05-19 13:29:03] [INFO ] Computed 448 place invariants in 2 ms
[2022-05-19 13:29:04] [INFO ] Implicit Places using invariants in 666 ms returned []
// Phase 1: matrix 949 rows 949 cols
[2022-05-19 13:29:04] [INFO ] Computed 448 place invariants in 2 ms
[2022-05-19 13:29:04] [INFO ] State equation strengthened by 369 read => feed constraints.
[2022-05-19 13:29:08] [INFO ] Implicit Places using invariants and state equation in 4541 ms returned []
Implicit Place search using SMT with State Equation took 5234 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 949/2957 places, 949/2707 transitions.
Finished structural reductions, in 2 iterations. Remains : 949/2957 places, 949/2707 transitions.
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s460 0), p1:(EQ s765 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-050B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050B-LTLFireability-13 finished in 6775 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||(G(X(X(G(F(p1))))) U X(p2))))'
Support contains 3 out of 2957 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2957/2957 places, 2707/2707 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 2952 transition count 2702
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 2952 transition count 2702
Applied a total of 10 rules in 367 ms. Remains 2952 /2957 variables (removed 5) and now considering 2702/2707 (removed 5) transitions.
// Phase 1: matrix 2702 rows 2952 cols
[2022-05-19 13:29:09] [INFO ] Computed 451 place invariants in 6 ms
[2022-05-19 13:29:10] [INFO ] Implicit Places using invariants in 862 ms returned []
// Phase 1: matrix 2702 rows 2952 cols
[2022-05-19 13:29:10] [INFO ] Computed 451 place invariants in 6 ms
[2022-05-19 13:29:12] [INFO ] Implicit Places using invariants and state equation in 2748 ms returned []
Implicit Place search using SMT with State Equation took 3616 ms to find 0 implicit places.
// Phase 1: matrix 2702 rows 2952 cols
[2022-05-19 13:29:12] [INFO ] Computed 451 place invariants in 9 ms
[2022-05-19 13:29:14] [INFO ] Dead Transitions using invariants and state equation in 1877 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2952/2957 places, 2702/2707 transitions.
Finished structural reductions, in 1 iterations. Remains : 2952/2957 places, 2702/2707 transitions.
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s365 1), p2:(EQ s780 1), p1:(EQ s160 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][false, false, false, false]]
Product exploration explored 100000 steps with 88 reset in 616 ms.
Product exploration explored 100000 steps with 88 reset in 717 ms.
Computed a total of 798 stabilizing places and 798 stable transitions
Computed a total of 798 stabilizing places and 798 stable transitions
Detected a total of 798/2952 stabilizing places and 798/2702 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 334 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 147 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2702 rows 2952 cols
[2022-05-19 13:29:16] [INFO ] Computed 451 place invariants in 6 ms
[2022-05-19 13:29:17] [INFO ] [Real]Absence check using 451 positive place invariants in 161 ms returned sat
[2022-05-19 13:29:17] [INFO ] After 601ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 13:29:18] [INFO ] [Nat]Absence check using 451 positive place invariants in 161 ms returned sat
[2022-05-19 13:29:19] [INFO ] After 1432ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 13:29:20] [INFO ] Deduced a trap composed of 25 places in 717 ms of which 1 ms to minimize.
[2022-05-19 13:29:21] [INFO ] Deduced a trap composed of 16 places in 679 ms of which 2 ms to minimize.
[2022-05-19 13:29:21] [INFO ] Deduced a trap composed of 40 places in 679 ms of which 2 ms to minimize.
[2022-05-19 13:29:22] [INFO ] Deduced a trap composed of 25 places in 687 ms of which 2 ms to minimize.
[2022-05-19 13:29:23] [INFO ] Deduced a trap composed of 21 places in 677 ms of which 1 ms to minimize.
[2022-05-19 13:29:24] [INFO ] Deduced a trap composed of 17 places in 671 ms of which 2 ms to minimize.
[2022-05-19 13:29:25] [INFO ] Deduced a trap composed of 19 places in 681 ms of which 1 ms to minimize.
[2022-05-19 13:29:25] [INFO ] Deduced a trap composed of 16 places in 639 ms of which 1 ms to minimize.
[2022-05-19 13:29:26] [INFO ] Deduced a trap composed of 23 places in 651 ms of which 2 ms to minimize.
[2022-05-19 13:29:27] [INFO ] Deduced a trap composed of 30 places in 712 ms of which 1 ms to minimize.
[2022-05-19 13:29:28] [INFO ] Deduced a trap composed of 28 places in 652 ms of which 2 ms to minimize.
[2022-05-19 13:29:28] [INFO ] Deduced a trap composed of 37 places in 611 ms of which 2 ms to minimize.
[2022-05-19 13:29:29] [INFO ] Deduced a trap composed of 48 places in 614 ms of which 1 ms to minimize.
[2022-05-19 13:29:30] [INFO ] Deduced a trap composed of 37 places in 608 ms of which 1 ms to minimize.
[2022-05-19 13:29:30] [INFO ] Deduced a trap composed of 39 places in 633 ms of which 1 ms to minimize.
[2022-05-19 13:29:31] [INFO ] Deduced a trap composed of 30 places in 628 ms of which 1 ms to minimize.
[2022-05-19 13:29:32] [INFO ] Deduced a trap composed of 29 places in 613 ms of which 1 ms to minimize.
[2022-05-19 13:29:33] [INFO ] Deduced a trap composed of 31 places in 603 ms of which 2 ms to minimize.
[2022-05-19 13:29:33] [INFO ] Deduced a trap composed of 25 places in 592 ms of which 1 ms to minimize.
[2022-05-19 13:29:34] [INFO ] Deduced a trap composed of 32 places in 595 ms of which 2 ms to minimize.
[2022-05-19 13:29:35] [INFO ] Deduced a trap composed of 35 places in 569 ms of which 1 ms to minimize.
[2022-05-19 13:29:35] [INFO ] Deduced a trap composed of 34 places in 553 ms of which 1 ms to minimize.
[2022-05-19 13:29:36] [INFO ] Deduced a trap composed of 21 places in 554 ms of which 1 ms to minimize.
[2022-05-19 13:29:37] [INFO ] Deduced a trap composed of 39 places in 558 ms of which 1 ms to minimize.
[2022-05-19 13:29:37] [INFO ] Deduced a trap composed of 35 places in 518 ms of which 2 ms to minimize.
[2022-05-19 13:29:38] [INFO ] Deduced a trap composed of 38 places in 512 ms of which 1 ms to minimize.
[2022-05-19 13:29:38] [INFO ] Deduced a trap composed of 44 places in 511 ms of which 1 ms to minimize.
[2022-05-19 13:29:39] [INFO ] Deduced a trap composed of 43 places in 509 ms of which 1 ms to minimize.
[2022-05-19 13:29:40] [INFO ] Deduced a trap composed of 37 places in 495 ms of which 1 ms to minimize.
[2022-05-19 13:29:40] [INFO ] Deduced a trap composed of 47 places in 480 ms of which 1 ms to minimize.
[2022-05-19 13:29:41] [INFO ] Deduced a trap composed of 33 places in 487 ms of which 1 ms to minimize.
[2022-05-19 13:29:41] [INFO ] Deduced a trap composed of 48 places in 460 ms of which 1 ms to minimize.
[2022-05-19 13:29:42] [INFO ] Deduced a trap composed of 46 places in 490 ms of which 1 ms to minimize.
[2022-05-19 13:29:42] [INFO ] Deduced a trap composed of 43 places in 447 ms of which 1 ms to minimize.
[2022-05-19 13:29:42] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 13:29:42] [INFO ] After 25285ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 74 ms.
Support contains 2 out of 2952 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2952/2952 places, 2702/2702 transitions.
Drop transitions removed 598 transitions
Trivial Post-agglo rules discarded 598 transitions
Performed 598 trivial Post agglomeration. Transition count delta: 598
Iterating post reduction 0 with 598 rules applied. Total rules applied 598 place count 2952 transition count 2104
Reduce places removed 598 places and 0 transitions.
Iterating post reduction 1 with 598 rules applied. Total rules applied 1196 place count 2354 transition count 2104
Performed 401 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 401 Pre rules applied. Total rules applied 1196 place count 2354 transition count 1703
Deduced a syphon composed of 401 places in 3 ms
Reduce places removed 401 places and 0 transitions.
Iterating global reduction 2 with 802 rules applied. Total rules applied 1998 place count 1953 transition count 1703
Performed 850 Post agglomeration using F-continuation condition.Transition count delta: 850
Deduced a syphon composed of 850 places in 2 ms
Reduce places removed 850 places and 0 transitions.
Iterating global reduction 2 with 1700 rules applied. Total rules applied 3698 place count 1103 transition count 853
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3699 place count 1103 transition count 852
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 3701 place count 1102 transition count 851
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3903 place count 1001 transition count 916
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 3999 place count 953 transition count 949
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4000 place count 953 transition count 948
Partial Free-agglomeration rule applied 50 times.
Drop transitions removed 50 transitions
Iterating global reduction 4 with 50 rules applied. Total rules applied 4050 place count 953 transition count 948
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4051 place count 952 transition count 947
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 4053 place count 950 transition count 947
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 4053 place count 950 transition count 946
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 4055 place count 949 transition count 946
Applied a total of 4055 rules in 364 ms. Remains 949 /2952 variables (removed 2003) and now considering 946/2702 (removed 1756) transitions.
Finished structural reductions, in 1 iterations. Remains : 949/2952 places, 946/2702 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 163191 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :{}
Probabilistic random walk after 163191 steps, saw 104302 distinct states, run finished after 3001 ms. (steps per millisecond=54 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 946 rows 949 cols
[2022-05-19 13:29:46] [INFO ] Computed 449 place invariants in 1 ms
[2022-05-19 13:29:46] [INFO ] [Real]Absence check using 449 positive place invariants in 57 ms returned sat
[2022-05-19 13:29:47] [INFO ] After 538ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 13:29:47] [INFO ] [Nat]Absence check using 449 positive place invariants in 56 ms returned sat
[2022-05-19 13:29:47] [INFO ] After 361ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 13:29:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 13:29:47] [INFO ] After 76ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-19 13:29:47] [INFO ] After 190ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 76 ms.
[2022-05-19 13:29:47] [INFO ] After 817ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 30 ms.
Support contains 2 out of 949 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 949/949 places, 946/946 transitions.
Applied a total of 0 rules in 15 ms. Remains 949 /949 variables (removed 0) and now considering 946/946 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 949/949 places, 946/946 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 949/949 places, 946/946 transitions.
Applied a total of 0 rules in 16 ms. Remains 949 /949 variables (removed 0) and now considering 946/946 (removed 0) transitions.
// Phase 1: matrix 946 rows 949 cols
[2022-05-19 13:29:47] [INFO ] Computed 449 place invariants in 1 ms
[2022-05-19 13:29:48] [INFO ] Implicit Places using invariants in 485 ms returned [938]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 506 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 948/949 places, 946/946 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 947 transition count 945
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 947 transition count 945
Applied a total of 2 rules in 28 ms. Remains 947 /948 variables (removed 1) and now considering 945/946 (removed 1) transitions.
// Phase 1: matrix 945 rows 947 cols
[2022-05-19 13:29:48] [INFO ] Computed 448 place invariants in 2 ms
[2022-05-19 13:29:49] [INFO ] Implicit Places using invariants in 509 ms returned []
// Phase 1: matrix 945 rows 947 cols
[2022-05-19 13:29:49] [INFO ] Computed 448 place invariants in 1 ms
[2022-05-19 13:29:49] [INFO ] Implicit Places using invariants and state equation in 956 ms returned []
Implicit Place search using SMT with State Equation took 1490 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 947/949 places, 945/946 transitions.
Finished structural reductions, in 2 iterations. Remains : 947/949 places, 945/946 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 153535 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 153535 steps, saw 97846 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 945 rows 947 cols
[2022-05-19 13:29:53] [INFO ] Computed 448 place invariants in 3 ms
[2022-05-19 13:29:53] [INFO ] [Real]Absence check using 448 positive place invariants in 56 ms returned sat
[2022-05-19 13:29:53] [INFO ] After 223ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 13:29:53] [INFO ] [Nat]Absence check using 448 positive place invariants in 57 ms returned sat
[2022-05-19 13:29:53] [INFO ] After 351ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 13:29:54] [INFO ] After 469ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 73 ms.
[2022-05-19 13:29:54] [INFO ] After 760ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 24 ms.
Support contains 2 out of 947 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 947/947 places, 945/945 transitions.
Applied a total of 0 rules in 15 ms. Remains 947 /947 variables (removed 0) and now considering 945/945 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 947/947 places, 945/945 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 947/947 places, 945/945 transitions.
Applied a total of 0 rules in 16 ms. Remains 947 /947 variables (removed 0) and now considering 945/945 (removed 0) transitions.
// Phase 1: matrix 945 rows 947 cols
[2022-05-19 13:29:54] [INFO ] Computed 448 place invariants in 2 ms
[2022-05-19 13:29:54] [INFO ] Implicit Places using invariants in 483 ms returned []
// Phase 1: matrix 945 rows 947 cols
[2022-05-19 13:29:54] [INFO ] Computed 448 place invariants in 2 ms
[2022-05-19 13:29:55] [INFO ] Implicit Places using invariants and state equation in 946 ms returned []
Implicit Place search using SMT with State Equation took 1464 ms to find 0 implicit places.
[2022-05-19 13:29:55] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 945 rows 947 cols
[2022-05-19 13:29:55] [INFO ] Computed 448 place invariants in 2 ms
[2022-05-19 13:29:56] [INFO ] Dead Transitions using invariants and state equation in 452 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 947/947 places, 945/945 transitions.
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 0 with 100 rules applied. Total rules applied 100 place count 947 transition count 945
Applied a total of 100 rules in 33 ms. Remains 947 /947 variables (removed 0) and now considering 945/945 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 945 rows 947 cols
[2022-05-19 13:29:56] [INFO ] Computed 448 place invariants in 1 ms
[2022-05-19 13:29:56] [INFO ] [Real]Absence check using 448 positive place invariants in 101 ms returned sat
[2022-05-19 13:29:56] [INFO ] After 366ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 13:29:56] [INFO ] [Nat]Absence check using 448 positive place invariants in 58 ms returned sat
[2022-05-19 13:29:57] [INFO ] After 358ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 13:29:57] [INFO ] State equation strengthened by 98 read => feed constraints.
[2022-05-19 13:29:57] [INFO ] After 162ms SMT Verify possible using 98 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-19 13:29:57] [INFO ] After 309ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 89 ms.
[2022-05-19 13:29:57] [INFO ] After 1074ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-05-19 13:29:57] [INFO ] Flatten gal took : 30 ms
[2022-05-19 13:29:57] [INFO ] Flatten gal took : 35 ms
[2022-05-19 13:29:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8950418450626915832.gal : 25 ms
[2022-05-19 13:29:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10396102343147510179.prop : 106 ms
Invoking ITS tools like this :cd /tmp/redAtoms2157948612867399268;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8950418450626915832.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10396102343147510179.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality10396102343147510179.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :9 after 18
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :18 after 37
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :37 after 70
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :70 after 137
Reachability property apf3 is true.
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,293,0.44886,12912,2,2183,11,9141,6,0,4687,3355,0
Total reachable state count : 293

Verifying 2 reachability properties.
Reachability property apf0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,119,0.451863,13176,2,1185,11,9141,7,0,4692,3355,0
Reachability property apf3 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf3,119,0.452793,13176,2,1185,11,9141,8,0,4692,3355,0
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (AND (NOT p2) (NOT p1) (NOT p0))))]
Knowledge based reduction with 8 factoid took 337 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 4 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 134 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 175 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 2702 rows 2952 cols
[2022-05-19 13:29:59] [INFO ] Computed 451 place invariants in 9 ms
[2022-05-19 13:30:01] [INFO ] [Real]Absence check using 451 positive place invariants in 778 ms returned sat
[2022-05-19 13:30:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 13:30:14] [INFO ] [Real]Absence check using state equation in 12900 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p2))
// Phase 1: matrix 2702 rows 2952 cols
[2022-05-19 13:30:14] [INFO ] Computed 451 place invariants in 9 ms
[2022-05-19 13:30:16] [INFO ] [Real]Absence check using 451 positive place invariants in 797 ms returned sat
[2022-05-19 13:30:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 13:30:29] [INFO ] [Real]Absence check using state equation in 12887 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 2952 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2952/2952 places, 2702/2702 transitions.
Applied a total of 0 rules in 213 ms. Remains 2952 /2952 variables (removed 0) and now considering 2702/2702 (removed 0) transitions.
// Phase 1: matrix 2702 rows 2952 cols
[2022-05-19 13:30:29] [INFO ] Computed 451 place invariants in 6 ms
[2022-05-19 13:30:30] [INFO ] Implicit Places using invariants in 852 ms returned []
// Phase 1: matrix 2702 rows 2952 cols
[2022-05-19 13:30:30] [INFO ] Computed 451 place invariants in 6 ms
[2022-05-19 13:30:32] [INFO ] Implicit Places using invariants and state equation in 2676 ms returned []
Implicit Place search using SMT with State Equation took 3549 ms to find 0 implicit places.
// Phase 1: matrix 2702 rows 2952 cols
[2022-05-19 13:30:32] [INFO ] Computed 451 place invariants in 6 ms
[2022-05-19 13:30:34] [INFO ] Dead Transitions using invariants and state equation in 1834 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2952/2952 places, 2702/2702 transitions.
Computed a total of 798 stabilizing places and 798 stable transitions
Computed a total of 798 stabilizing places and 798 stable transitions
Detected a total of 798/2952 stabilizing places and 798/2702 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p2) (NOT p0))), (X (AND (NOT p1) (NOT p0))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT p0)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 361 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 4 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 133 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2702 rows 2952 cols
[2022-05-19 13:30:35] [INFO ] Computed 451 place invariants in 6 ms
[2022-05-19 13:30:36] [INFO ] [Real]Absence check using 451 positive place invariants in 158 ms returned sat
[2022-05-19 13:30:36] [INFO ] After 601ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 13:30:36] [INFO ] [Nat]Absence check using 451 positive place invariants in 159 ms returned sat
[2022-05-19 13:30:38] [INFO ] After 1443ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 13:30:39] [INFO ] Deduced a trap composed of 25 places in 739 ms of which 1 ms to minimize.
[2022-05-19 13:30:39] [INFO ] Deduced a trap composed of 16 places in 741 ms of which 1 ms to minimize.
[2022-05-19 13:30:40] [INFO ] Deduced a trap composed of 40 places in 693 ms of which 2 ms to minimize.
[2022-05-19 13:30:41] [INFO ] Deduced a trap composed of 25 places in 702 ms of which 2 ms to minimize.
[2022-05-19 13:30:42] [INFO ] Deduced a trap composed of 21 places in 667 ms of which 2 ms to minimize.
[2022-05-19 13:30:42] [INFO ] Deduced a trap composed of 17 places in 690 ms of which 1 ms to minimize.
[2022-05-19 13:30:43] [INFO ] Deduced a trap composed of 19 places in 677 ms of which 2 ms to minimize.
[2022-05-19 13:30:44] [INFO ] Deduced a trap composed of 16 places in 703 ms of which 2 ms to minimize.
[2022-05-19 13:30:45] [INFO ] Deduced a trap composed of 23 places in 648 ms of which 1 ms to minimize.
[2022-05-19 13:30:46] [INFO ] Deduced a trap composed of 30 places in 642 ms of which 1 ms to minimize.
[2022-05-19 13:30:46] [INFO ] Deduced a trap composed of 28 places in 646 ms of which 1 ms to minimize.
[2022-05-19 13:30:47] [INFO ] Deduced a trap composed of 37 places in 623 ms of which 1 ms to minimize.
[2022-05-19 13:30:48] [INFO ] Deduced a trap composed of 48 places in 660 ms of which 1 ms to minimize.
[2022-05-19 13:30:48] [INFO ] Deduced a trap composed of 37 places in 611 ms of which 1 ms to minimize.
[2022-05-19 13:30:49] [INFO ] Deduced a trap composed of 39 places in 605 ms of which 2 ms to minimize.
[2022-05-19 13:30:50] [INFO ] Deduced a trap composed of 30 places in 610 ms of which 2 ms to minimize.
[2022-05-19 13:30:51] [INFO ] Deduced a trap composed of 29 places in 629 ms of which 2 ms to minimize.
[2022-05-19 13:30:51] [INFO ] Deduced a trap composed of 31 places in 578 ms of which 2 ms to minimize.
[2022-05-19 13:30:52] [INFO ] Deduced a trap composed of 25 places in 564 ms of which 2 ms to minimize.
[2022-05-19 13:30:53] [INFO ] Deduced a trap composed of 32 places in 570 ms of which 1 ms to minimize.
[2022-05-19 13:30:53] [INFO ] Deduced a trap composed of 35 places in 578 ms of which 2 ms to minimize.
[2022-05-19 13:30:54] [INFO ] Deduced a trap composed of 34 places in 573 ms of which 1 ms to minimize.
[2022-05-19 13:30:54] [INFO ] Deduced a trap composed of 21 places in 523 ms of which 1 ms to minimize.
[2022-05-19 13:30:55] [INFO ] Deduced a trap composed of 39 places in 522 ms of which 1 ms to minimize.
[2022-05-19 13:30:56] [INFO ] Deduced a trap composed of 35 places in 551 ms of which 1 ms to minimize.
[2022-05-19 13:30:56] [INFO ] Deduced a trap composed of 38 places in 528 ms of which 1 ms to minimize.
[2022-05-19 13:30:57] [INFO ] Deduced a trap composed of 44 places in 527 ms of which 1 ms to minimize.
[2022-05-19 13:30:58] [INFO ] Deduced a trap composed of 43 places in 501 ms of which 1 ms to minimize.
[2022-05-19 13:30:58] [INFO ] Deduced a trap composed of 37 places in 493 ms of which 1 ms to minimize.
[2022-05-19 13:30:59] [INFO ] Deduced a trap composed of 47 places in 571 ms of which 1 ms to minimize.
[2022-05-19 13:30:59] [INFO ] Deduced a trap composed of 33 places in 508 ms of which 2 ms to minimize.
[2022-05-19 13:31:00] [INFO ] Deduced a trap composed of 48 places in 491 ms of which 1 ms to minimize.
[2022-05-19 13:31:01] [INFO ] Deduced a trap composed of 46 places in 465 ms of which 1 ms to minimize.
[2022-05-19 13:31:01] [INFO ] Deduced a trap composed of 43 places in 462 ms of which 2 ms to minimize.
[2022-05-19 13:31:01] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 13:31:01] [INFO ] After 25372ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 72 ms.
Support contains 2 out of 2952 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2952/2952 places, 2702/2702 transitions.
Drop transitions removed 598 transitions
Trivial Post-agglo rules discarded 598 transitions
Performed 598 trivial Post agglomeration. Transition count delta: 598
Iterating post reduction 0 with 598 rules applied. Total rules applied 598 place count 2952 transition count 2104
Reduce places removed 598 places and 0 transitions.
Iterating post reduction 1 with 598 rules applied. Total rules applied 1196 place count 2354 transition count 2104
Performed 401 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 401 Pre rules applied. Total rules applied 1196 place count 2354 transition count 1703
Deduced a syphon composed of 401 places in 3 ms
Reduce places removed 401 places and 0 transitions.
Iterating global reduction 2 with 802 rules applied. Total rules applied 1998 place count 1953 transition count 1703
Performed 850 Post agglomeration using F-continuation condition.Transition count delta: 850
Deduced a syphon composed of 850 places in 1 ms
Reduce places removed 850 places and 0 transitions.
Iterating global reduction 2 with 1700 rules applied. Total rules applied 3698 place count 1103 transition count 853
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3699 place count 1103 transition count 852
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 3701 place count 1102 transition count 851
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3903 place count 1001 transition count 916
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 3999 place count 953 transition count 949
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4000 place count 953 transition count 948
Partial Free-agglomeration rule applied 50 times.
Drop transitions removed 50 transitions
Iterating global reduction 4 with 50 rules applied. Total rules applied 4050 place count 953 transition count 948
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4051 place count 952 transition count 947
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 4053 place count 950 transition count 947
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 4053 place count 950 transition count 946
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 4055 place count 949 transition count 946
Applied a total of 4055 rules in 523 ms. Remains 949 /2952 variables (removed 2003) and now considering 946/2702 (removed 1756) transitions.
Finished structural reductions, in 1 iterations. Remains : 949/2952 places, 946/2702 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 167971 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :{}
Probabilistic random walk after 167971 steps, saw 107448 distinct states, run finished after 3001 ms. (steps per millisecond=55 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 946 rows 949 cols
[2022-05-19 13:31:05] [INFO ] Computed 449 place invariants in 2 ms
[2022-05-19 13:31:05] [INFO ] [Real]Absence check using 449 positive place invariants in 57 ms returned sat
[2022-05-19 13:31:05] [INFO ] After 565ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 13:31:06] [INFO ] [Nat]Absence check using 449 positive place invariants in 56 ms returned sat
[2022-05-19 13:31:06] [INFO ] After 367ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 13:31:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 13:31:06] [INFO ] After 68ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-19 13:31:06] [INFO ] After 183ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 72 ms.
[2022-05-19 13:31:06] [INFO ] After 811ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 36 ms.
Support contains 2 out of 949 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 949/949 places, 946/946 transitions.
Applied a total of 0 rules in 51 ms. Remains 949 /949 variables (removed 0) and now considering 946/946 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 949/949 places, 946/946 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 949/949 places, 946/946 transitions.
Applied a total of 0 rules in 16 ms. Remains 949 /949 variables (removed 0) and now considering 946/946 (removed 0) transitions.
// Phase 1: matrix 946 rows 949 cols
[2022-05-19 13:31:06] [INFO ] Computed 449 place invariants in 1 ms
[2022-05-19 13:31:07] [INFO ] Implicit Places using invariants in 496 ms returned [938]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 523 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 948/949 places, 946/946 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 947 transition count 945
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 947 transition count 945
Applied a total of 2 rules in 29 ms. Remains 947 /948 variables (removed 1) and now considering 945/946 (removed 1) transitions.
// Phase 1: matrix 945 rows 947 cols
[2022-05-19 13:31:07] [INFO ] Computed 448 place invariants in 1 ms
[2022-05-19 13:31:08] [INFO ] Implicit Places using invariants in 552 ms returned []
// Phase 1: matrix 945 rows 947 cols
[2022-05-19 13:31:08] [INFO ] Computed 448 place invariants in 1 ms
[2022-05-19 13:31:09] [INFO ] Implicit Places using invariants and state equation in 1028 ms returned []
Implicit Place search using SMT with State Equation took 1602 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 947/949 places, 945/946 transitions.
Finished structural reductions, in 2 iterations. Remains : 947/949 places, 945/946 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 166551 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :{}
Probabilistic random walk after 166551 steps, saw 106285 distinct states, run finished after 3001 ms. (steps per millisecond=55 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 945 rows 947 cols
[2022-05-19 13:31:12] [INFO ] Computed 448 place invariants in 1 ms
[2022-05-19 13:31:12] [INFO ] [Real]Absence check using 448 positive place invariants in 100 ms returned sat
[2022-05-19 13:31:12] [INFO ] After 371ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 13:31:12] [INFO ] [Nat]Absence check using 448 positive place invariants in 71 ms returned sat
[2022-05-19 13:31:13] [INFO ] After 355ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 13:31:13] [INFO ] After 507ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 73 ms.
[2022-05-19 13:31:13] [INFO ] After 804ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 32 ms.
Support contains 2 out of 947 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 947/947 places, 945/945 transitions.
Applied a total of 0 rules in 15 ms. Remains 947 /947 variables (removed 0) and now considering 945/945 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 947/947 places, 945/945 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 947/947 places, 945/945 transitions.
Applied a total of 0 rules in 15 ms. Remains 947 /947 variables (removed 0) and now considering 945/945 (removed 0) transitions.
// Phase 1: matrix 945 rows 947 cols
[2022-05-19 13:31:13] [INFO ] Computed 448 place invariants in 1 ms
[2022-05-19 13:31:14] [INFO ] Implicit Places using invariants in 531 ms returned []
// Phase 1: matrix 945 rows 947 cols
[2022-05-19 13:31:14] [INFO ] Computed 448 place invariants in 1 ms
[2022-05-19 13:31:14] [INFO ] Implicit Places using invariants and state equation in 926 ms returned []
Implicit Place search using SMT with State Equation took 1486 ms to find 0 implicit places.
[2022-05-19 13:31:15] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 945 rows 947 cols
[2022-05-19 13:31:15] [INFO ] Computed 448 place invariants in 1 ms
[2022-05-19 13:31:15] [INFO ] Dead Transitions using invariants and state equation in 496 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 947/947 places, 945/945 transitions.
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 0 with 100 rules applied. Total rules applied 100 place count 947 transition count 945
Applied a total of 100 rules in 85 ms. Remains 947 /947 variables (removed 0) and now considering 945/945 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 945 rows 947 cols
[2022-05-19 13:31:15] [INFO ] Computed 448 place invariants in 1 ms
[2022-05-19 13:31:15] [INFO ] [Real]Absence check using 448 positive place invariants in 57 ms returned sat
[2022-05-19 13:31:15] [INFO ] After 288ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 13:31:16] [INFO ] [Nat]Absence check using 448 positive place invariants in 57 ms returned sat
[2022-05-19 13:31:16] [INFO ] After 354ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 13:31:16] [INFO ] State equation strengthened by 98 read => feed constraints.
[2022-05-19 13:31:16] [INFO ] After 157ms SMT Verify possible using 98 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-19 13:31:16] [INFO ] After 282ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 86 ms.
[2022-05-19 13:31:16] [INFO ] After 934ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-05-19 13:31:16] [INFO ] Flatten gal took : 41 ms
[2022-05-19 13:31:16] [INFO ] Flatten gal took : 30 ms
[2022-05-19 13:31:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2535188132943556046.gal : 4 ms
[2022-05-19 13:31:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1449832099505647216.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms11168809761699683842;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2535188132943556046.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1449832099505647216.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality1449832099505647216.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :9 after 18
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :18 after 37
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :37 after 70
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :70 after 137
Reachability property apf3 is true.
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,293,0.455841,12908,2,2183,11,9141,6,0,4687,3355,0
Total reachable state count : 293

Verifying 2 reachability properties.
Reachability property apf0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,119,0.458777,13172,2,1185,11,9141,7,0,4692,3355,0
Reachability property apf3 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf3,119,0.459739,13172,2,1185,11,9141,8,0,4692,3355,0
ITS tools runner thread asked to quit. Dying gracefully.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p2) (NOT p0))), (X (AND (NOT p1) (NOT p0))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT p0)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (AND (NOT p2) (NOT p1) (NOT p0))))]
Knowledge based reduction with 10 factoid took 461 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 4 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 134 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 117 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 2702 rows 2952 cols
[2022-05-19 13:31:18] [INFO ] Computed 451 place invariants in 8 ms
[2022-05-19 13:31:20] [INFO ] [Real]Absence check using 451 positive place invariants in 774 ms returned sat
[2022-05-19 13:31:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 13:31:33] [INFO ] [Real]Absence check using state equation in 12952 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p2))
// Phase 1: matrix 2702 rows 2952 cols
[2022-05-19 13:31:33] [INFO ] Computed 451 place invariants in 9 ms
[2022-05-19 13:31:35] [INFO ] [Real]Absence check using 451 positive place invariants in 795 ms returned sat
[2022-05-19 13:31:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 13:31:48] [INFO ] [Real]Absence check using state equation in 12900 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 129 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 89 reset in 557 ms.
Product exploration explored 100000 steps with 89 reset in 702 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 129 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 2952 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2952/2952 places, 2702/2702 transitions.
Performed 597 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 597 rules applied. Total rules applied 597 place count 2952 transition count 2702
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 202 Pre rules applied. Total rules applied 597 place count 2952 transition count 2854
Deduced a syphon composed of 799 places in 4 ms
Iterating global reduction 1 with 202 rules applied. Total rules applied 799 place count 2952 transition count 2854
Performed 998 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1797 places in 3 ms
Iterating global reduction 1 with 998 rules applied. Total rules applied 1797 place count 2952 transition count 2854
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1798 place count 2952 transition count 2853
Renaming transitions due to excessive name length > 1024 char.
Discarding 398 places :
Symmetric choice reduction at 2 with 398 rule applications. Total rules 2196 place count 2554 transition count 2455
Deduced a syphon composed of 1399 places in 2 ms
Iterating global reduction 2 with 398 rules applied. Total rules applied 2594 place count 2554 transition count 2455
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1400 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2595 place count 2554 transition count 2455
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2597 place count 2552 transition count 2453
Deduced a syphon composed of 1398 places in 2 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2599 place count 2552 transition count 2453
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -527
Deduced a syphon composed of 1499 places in 3 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2700 place count 2552 transition count 2980
Discarding 102 places :
Symmetric choice reduction at 2 with 102 rule applications. Total rules 2802 place count 2450 transition count 2776
Deduced a syphon composed of 1397 places in 2 ms
Iterating global reduction 2 with 102 rules applied. Total rules applied 2904 place count 2450 transition count 2776
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: -519
Deduced a syphon composed of 1495 places in 4 ms
Iterating global reduction 2 with 98 rules applied. Total rules applied 3002 place count 2450 transition count 3295
Discarding 98 places :
Symmetric choice reduction at 2 with 98 rule applications. Total rules 3100 place count 2352 transition count 3099
Deduced a syphon composed of 1397 places in 4 ms
Iterating global reduction 2 with 98 rules applied. Total rules applied 3198 place count 2352 transition count 3099
Deduced a syphon composed of 1397 places in 3 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 3207 place count 2352 transition count 3090
Deduced a syphon composed of 1397 places in 3 ms
Applied a total of 3207 rules in 1432 ms. Remains 2352 /2952 variables (removed 600) and now considering 3090/2702 (removed -388) transitions.
[2022-05-19 13:31:51] [INFO ] Redundant transitions in 69 ms returned []
// Phase 1: matrix 3090 rows 2352 cols
[2022-05-19 13:31:51] [INFO ] Computed 451 place invariants in 27 ms
[2022-05-19 13:31:52] [INFO ] Dead Transitions using invariants and state equation in 1582 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2352/2952 places, 3090/2702 transitions.
Finished structural reductions, in 1 iterations. Remains : 2352/2952 places, 3090/2702 transitions.
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-050B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050B-LTLFireability-14 finished in 164112 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2022-05-19 13:31:53] [INFO ] Flatten gal took : 56 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16420147924835155112
[2022-05-19 13:31:53] [INFO ] Too many transitions (2707) to apply POR reductions. Disabling POR matrices.
[2022-05-19 13:31:53] [INFO ] Applying decomposition
[2022-05-19 13:31:53] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16420147924835155112
Running compilation step : cd /tmp/ltsmin16420147924835155112;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-19 13:31:53] [INFO ] Flatten gal took : 65 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3283718563926545695.txt' '-o' '/tmp/graph3283718563926545695.bin' '-w' '/tmp/graph3283718563926545695.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3283718563926545695.bin' '-l' '-1' '-v' '-w' '/tmp/graph3283718563926545695.weights' '-q' '0' '-e' '0.001'
[2022-05-19 13:31:53] [INFO ] Decomposing Gal with order
[2022-05-19 13:31:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 13:31:54] [INFO ] Removed a total of 488 redundant transitions.
[2022-05-19 13:31:54] [INFO ] Flatten gal took : 202 ms
[2022-05-19 13:31:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2022-05-19 13:31:54] [INFO ] Time to serialize gal into /tmp/LTLFireability8675281192239930880.gal : 51 ms
[2022-05-19 13:31:54] [INFO ] Time to serialize properties into /tmp/LTLFireability7521413386137373439.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8675281192239930880.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7521413386137373439.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...267
Read 1 LTL properties
Checking formula 0 : !((F(G("(i18.i2.u417.p1314!=1)"))))
Formula 0 simplified : !FG"(i18.i2.u417.p1314!=1)"
Compilation finished in 6725 ms.
Running link step : cd /tmp/ltsmin16420147924835155112;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 68 ms.
Running LTSmin : cd /tmp/ltsmin16420147924835155112;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-19 13:55:27] [INFO ] Applying decomposition
[2022-05-19 13:55:27] [INFO ] Flatten gal took : 150 ms
[2022-05-19 13:55:27] [INFO ] Decomposing Gal with order
[2022-05-19 13:55:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 13:55:28] [INFO ] Removed a total of 146 redundant transitions.
[2022-05-19 13:55:29] [INFO ] Flatten gal took : 482 ms
[2022-05-19 13:55:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 39 ms.
[2022-05-19 13:55:29] [INFO ] Time to serialize gal into /tmp/LTLFireability3483950861439675750.gal : 110 ms
[2022-05-19 13:55:29] [INFO ] Time to serialize properties into /tmp/LTLFireability1864343777998647367.ltl : 26 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3483950861439675750.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1864343777998647367.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...267
Read 1 LTL properties
Checking formula 0 : !((F(G("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.u368.p1314!=1)...160
Formula 0 simplified : !FG"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.u368.p1314!=1)"
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.017: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.026: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.030: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.031: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.032: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.033: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.033: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.033: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.206: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.360: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.360: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 1.959: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 7.330: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 7.330: Initializing POR dependencies: labels 2708, guards 2707
pins2lts-mc-linux64( 7/ 8), 7.335: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 21.940: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 263.525: No maybe-coenabled matrix found. Turning off NESs from NDS+MC.
pins2lts-mc-linux64( 5/ 8), 762.571: LTL layer: formula: <>([]((LTLAPp0==true)))
pins2lts-mc-linux64( 5/ 8), 762.571: "<>([]((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 762.572: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 769.800: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 769.852: There are 2709 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 769.852: State length is 2958, there are 2711 groups
pins2lts-mc-linux64( 0/ 8), 769.852: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 769.852: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 769.852: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 769.852: Visible groups: 0 / 2711, labels: 1 / 2709
pins2lts-mc-linux64( 0/ 8), 769.852: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 769.852: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 0/ 8), 770.491: [Blue] ~120 levels ~960 states ~12952 transitions
pins2lts-mc-linux64( 6/ 8), 771.205: [Blue] ~240 levels ~1920 states ~25328 transitions
pins2lts-mc-linux64( 6/ 8), 772.191: [Blue] ~480 levels ~3840 states ~42512 transitions
pins2lts-mc-linux64( 6/ 8), 774.098: [Blue] ~960 levels ~7680 states ~85288 transitions
pins2lts-mc-linux64( 0/ 8), 777.959: [Blue] ~1851 levels ~15360 states ~191240 transitions
pins2lts-mc-linux64( 5/ 8), 783.501: [Blue] ~3768 levels ~30720 states ~296192 transitions
pins2lts-mc-linux64( 6/ 8), 794.350: [Blue] ~7680 levels ~61440 states ~502536 transitions
pins2lts-mc-linux64( 6/ 8), 815.294: [Blue] ~15358 levels ~122880 states ~910488 transitions
pins2lts-mc-linux64( 6/ 8), 857.974: [Blue] ~30705 levels ~245760 states ~1722520 transitions
pins2lts-mc-linux64( 5/ 8), 945.353: [Blue] ~59477 levels ~491520 states ~3541384 transitions
pins2lts-mc-linux64( 5/ 8), 1112.721: [Blue] ~119383 levels ~983040 states ~6913256 transitions
pins2lts-mc-linux64( 0/ 8), 1516.488: [Blue] ~183266 levels ~1966080 states ~14113576 transitions
pins2lts-mc-linux64( 4/ 8), 1772.109: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1772.242:
pins2lts-mc-linux64( 0/ 8), 1772.243: Explored 2387236 states 18172528 transitions, fanout: 7.612
pins2lts-mc-linux64( 0/ 8), 1772.243: Total exploration time 1002.360 sec (1002.230 sec minimum, 1002.280 sec on average)
pins2lts-mc-linux64( 0/ 8), 1772.243: States per second: 2382, Transitions per second: 18130
pins2lts-mc-linux64( 0/ 8), 1772.243:
pins2lts-mc-linux64( 0/ 8), 1772.243: State space has 13120519 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 1772.243: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1772.243: blue states: 2387236 (18.19%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1772.243: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1772.243: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1772.243:
pins2lts-mc-linux64( 0/ 8), 1772.243: Total memory used for local state coloring: 33.7MB
pins2lts-mc-linux64( 0/ 8), 1772.243:
pins2lts-mc-linux64( 0/ 8), 1772.243: Queue width: 8B, total height: 2206484, memory: 16.83MB
pins2lts-mc-linux64( 0/ 8), 1772.243: Tree memory: 356.1MB, 28.5 B/state, compr.: 0.2%
pins2lts-mc-linux64( 0/ 8), 1772.243: Tree fill ratio (roots/leafs): 9.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1772.243: Stored 2800 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1772.243: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1772.243: Est. total memory use: 372.9MB (~1040.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16420147924835155112;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16420147924835155112;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-19 14:19:03] [INFO ] Flatten gal took : 293 ms
[2022-05-19 14:19:04] [INFO ] Input system was already deterministic with 2707 transitions.
[2022-05-19 14:19:05] [INFO ] Transformed 2957 places.
[2022-05-19 14:19:05] [INFO ] Transformed 2707 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-19 14:19:06] [INFO ] Time to serialize gal into /tmp/LTLFireability8546371341484770410.gal : 22 ms
[2022-05-19 14:19:06] [INFO ] Time to serialize properties into /tmp/LTLFireability9130182954373567400.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8546371341484770410.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9130182954373567400.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...333
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G("(p1314!=1)"))))
Formula 0 simplified : !FG"(p1314!=1)"

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-050B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ShieldIIPt-PT-050B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r222-tall-165286025000332"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-050B.tgz
mv ShieldIIPt-PT-050B execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;