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-165286025000318.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-040B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025000318
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.0K Apr 29 18:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Apr 29 18:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 29 18:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 29 18:28 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.8K May 9 08:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 6.9K Apr 29 18:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 29 18:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Apr 29 18:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Apr 29 18:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 686K 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-040B-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654269310668

Running Version 202205111006
[2022-06-03 15:15:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -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-06-03 15:15:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 15:15:12] [INFO ] Load time of PNML (sax parser for PT used): 193 ms
[2022-06-03 15:15:12] [INFO ] Transformed 2803 places.
[2022-06-03 15:15:12] [INFO ] Transformed 2603 transitions.
[2022-06-03 15:15:12] [INFO ] Found NUPN structural information;
[2022-06-03 15:15:12] [INFO ] Parsed PT model containing 2803 places and 2603 transitions in 408 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 657 ms. (steps per millisecond=15 ) properties (out of 11) seen :3
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 2603 rows 2803 cols
[2022-06-03 15:15:13] [INFO ] Computed 361 place invariants in 47 ms
[2022-06-03 15:15:14] [INFO ] After 968ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-06-03 15:15:15] [INFO ] [Nat]Absence check using 361 positive place invariants in 151 ms returned sat
[2022-06-03 15:15:18] [INFO ] After 3260ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :4
[2022-06-03 15:15:19] [INFO ] Deduced a trap composed of 15 places in 817 ms of which 14 ms to minimize.
[2022-06-03 15:15:20] [INFO ] Deduced a trap composed of 27 places in 765 ms of which 2 ms to minimize.
[2022-06-03 15:15:21] [INFO ] Deduced a trap composed of 27 places in 809 ms of which 2 ms to minimize.
[2022-06-03 15:15:22] [INFO ] Deduced a trap composed of 21 places in 768 ms of which 3 ms to minimize.
[2022-06-03 15:15:23] [INFO ] Deduced a trap composed of 27 places in 768 ms of which 6 ms to minimize.
[2022-06-03 15:15:23] [INFO ] Deduced a trap composed of 18 places in 718 ms of which 1 ms to minimize.
[2022-06-03 15:15:24] [INFO ] Deduced a trap composed of 26 places in 710 ms of which 2 ms to minimize.
[2022-06-03 15:15:25] [INFO ] Deduced a trap composed of 30 places in 714 ms of which 2 ms to minimize.
[2022-06-03 15:15:26] [INFO ] Deduced a trap composed of 21 places in 756 ms of which 2 ms to minimize.
[2022-06-03 15:15:27] [INFO ] Deduced a trap composed of 42 places in 707 ms of which 2 ms to minimize.
[2022-06-03 15:15:27] [INFO ] Deduced a trap composed of 17 places in 671 ms of which 1 ms to minimize.
[2022-06-03 15:15:28] [INFO ] Deduced a trap composed of 13 places in 681 ms of which 1 ms to minimize.
[2022-06-03 15:15:29] [INFO ] Deduced a trap composed of 32 places in 666 ms of which 2 ms to minimize.
[2022-06-03 15:15:30] [INFO ] Deduced a trap composed of 21 places in 683 ms of which 1 ms to minimize.
[2022-06-03 15:15:30] [INFO ] Deduced a trap composed of 21 places in 674 ms of which 1 ms to minimize.
[2022-06-03 15:15:31] [INFO ] Deduced a trap composed of 26 places in 655 ms of which 2 ms to minimize.
[2022-06-03 15:15:32] [INFO ] Deduced a trap composed of 23 places in 669 ms of which 4 ms to minimize.
[2022-06-03 15:15:33] [INFO ] Deduced a trap composed of 19 places in 666 ms of which 2 ms to minimize.
[2022-06-03 15:15:33] [INFO ] Deduced a trap composed of 24 places in 650 ms of which 1 ms to minimize.
[2022-06-03 15:15:34] [INFO ] Deduced a trap composed of 26 places in 665 ms of which 2 ms to minimize.
[2022-06-03 15:15:35] [INFO ] Deduced a trap composed of 27 places in 647 ms of which 1 ms to minimize.
[2022-06-03 15:15:36] [INFO ] Deduced a trap composed of 34 places in 606 ms of which 2 ms to minimize.
[2022-06-03 15:15:36] [INFO ] Deduced a trap composed of 32 places in 594 ms of which 2 ms to minimize.
[2022-06-03 15:15:37] [INFO ] Deduced a trap composed of 32 places in 622 ms of which 2 ms to minimize.
[2022-06-03 15:15:38] [INFO ] Deduced a trap composed of 27 places in 601 ms of which 2 ms to minimize.
[2022-06-03 15:15:38] [INFO ] Deduced a trap composed of 37 places in 612 ms of which 2 ms to minimize.
[2022-06-03 15:15:39] [INFO ] Deduced a trap composed of 41 places in 588 ms of which 1 ms to minimize.
[2022-06-03 15:15:39] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-03 15:15:39] [INFO ] After 25283ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 14886 ms.
Support contains 23 out of 2803 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2803/2803 places, 2603/2603 transitions.
Drop transitions removed 665 transitions
Trivial Post-agglo rules discarded 665 transitions
Performed 665 trivial Post agglomeration. Transition count delta: 665
Iterating post reduction 0 with 665 rules applied. Total rules applied 665 place count 2803 transition count 1938
Reduce places removed 665 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 672 rules applied. Total rules applied 1337 place count 2138 transition count 1931
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 1344 place count 2131 transition count 1931
Performed 160 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 160 Pre rules applied. Total rules applied 1344 place count 2131 transition count 1771
Deduced a syphon composed of 160 places in 6 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 3 with 320 rules applied. Total rules applied 1664 place count 1971 transition count 1771
Discarding 270 places :
Symmetric choice reduction at 3 with 270 rule applications. Total rules 1934 place count 1701 transition count 1501
Iterating global reduction 3 with 270 rules applied. Total rules applied 2204 place count 1701 transition count 1501
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 112 Pre rules applied. Total rules applied 2204 place count 1701 transition count 1389
Deduced a syphon composed of 112 places in 9 ms
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 3 with 224 rules applied. Total rules applied 2428 place count 1589 transition count 1389
Performed 680 Post agglomeration using F-continuation condition.Transition count delta: 680
Deduced a syphon composed of 680 places in 3 ms
Reduce places removed 680 places and 0 transitions.
Iterating global reduction 3 with 1360 rules applied. Total rules applied 3788 place count 909 transition count 709
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3990 place count 808 transition count 774
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 15 places in 3 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 4020 place count 793 transition count 783
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4021 place count 793 transition count 782
Partial Free-agglomeration rule applied 42 times.
Drop transitions removed 42 transitions
Iterating global reduction 4 with 42 rules applied. Total rules applied 4063 place count 793 transition count 782
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4064 place count 792 transition count 781
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4065 place count 791 transition count 781
Applied a total of 4065 rules in 1053 ms. Remains 791 /2803 variables (removed 2012) and now considering 781/2603 (removed 1822) transitions.
Finished structural reductions, in 1 iterations. Remains : 791/2803 places, 781/2603 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 17883 ms. (steps per millisecond=55 ) properties (out of 4) seen :1
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 973758 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=194 ) properties seen 1
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 948993 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=189 ) properties seen 1
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4402 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 781 rows 791 cols
[2022-06-03 15:16:27] [INFO ] Computed 360 place invariants in 8 ms
[2022-06-03 15:16:28] [INFO ] [Real]Absence check using 360 positive place invariants in 52 ms returned sat
[2022-06-03 15:16:28] [INFO ] After 458ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 15:16:28] [INFO ] [Nat]Absence check using 360 positive place invariants in 49 ms returned sat
[2022-06-03 15:16:28] [INFO ] After 274ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 15:16:28] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-06-03 15:16:28] [INFO ] After 39ms SMT Verify possible using 26 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-03 15:16:28] [INFO ] After 92ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2022-06-03 15:16:28] [INFO ] After 549ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 222 ms.
Support contains 1 out of 791 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 791/791 places, 781/781 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 791 transition count 775
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 785 transition count 775
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 12 place count 785 transition count 770
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 22 place count 780 transition count 770
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 17 rules applied. Total rules applied 39 place count 771 transition count 762
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 42 place count 771 transition count 759
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 42 place count 771 transition count 758
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 44 place count 770 transition count 758
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 56 place count 764 transition count 762
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 764 transition count 760
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 60 place count 762 transition count 760
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 65 place count 757 transition count 755
Applied a total of 65 rules in 230 ms. Remains 757 /791 variables (removed 34) and now considering 755/781 (removed 26) transitions.
Finished structural reductions, in 1 iterations. Remains : 757/791 places, 755/781 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 6794 ms. (steps per millisecond=147 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4427 ms. (steps per millisecond=225 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2884690 steps, run timeout after 33001 ms. (steps per millisecond=87 ) properties seen :{}
Probabilistic random walk after 2884690 steps, saw 2257053 distinct states, run finished after 33002 ms. (steps per millisecond=87 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 755 rows 757 cols
[2022-06-03 15:17:13] [INFO ] Computed 359 place invariants in 6 ms
[2022-06-03 15:17:13] [INFO ] [Real]Absence check using 359 positive place invariants in 52 ms returned sat
[2022-06-03 15:17:14] [INFO ] After 422ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 15:17:14] [INFO ] [Nat]Absence check using 359 positive place invariants in 47 ms returned sat
[2022-06-03 15:17:14] [INFO ] After 263ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 15:17:14] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-06-03 15:17:14] [INFO ] After 37ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-03 15:17:14] [INFO ] After 94ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2022-06-03 15:17:14] [INFO ] After 554ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 310 ms.
Support contains 1 out of 757 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 757/757 places, 755/755 transitions.
Applied a total of 0 rules in 17 ms. Remains 757 /757 variables (removed 0) and now considering 755/755 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 757/757 places, 755/755 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 757/757 places, 755/755 transitions.
Applied a total of 0 rules in 19 ms. Remains 757 /757 variables (removed 0) and now considering 755/755 (removed 0) transitions.
// Phase 1: matrix 755 rows 757 cols
[2022-06-03 15:17:14] [INFO ] Computed 359 place invariants in 2 ms
[2022-06-03 15:17:15] [INFO ] Implicit Places using invariants in 423 ms returned [746]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 426 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 756/757 places, 755/755 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 755 transition count 754
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 755 transition count 754
Applied a total of 2 rules in 28 ms. Remains 755 /756 variables (removed 1) and now considering 754/755 (removed 1) transitions.
// Phase 1: matrix 754 rows 755 cols
[2022-06-03 15:17:15] [INFO ] Computed 358 place invariants in 3 ms
[2022-06-03 15:17:15] [INFO ] Implicit Places using invariants in 464 ms returned []
// Phase 1: matrix 754 rows 755 cols
[2022-06-03 15:17:15] [INFO ] Computed 358 place invariants in 7 ms
[2022-06-03 15:17:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-03 15:17:16] [INFO ] Implicit Places using invariants and state equation in 806 ms returned []
Implicit Place search using SMT with State Equation took 1285 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 755/757 places, 754/755 transitions.
Finished structural reductions, in 2 iterations. Remains : 755/757 places, 754/755 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 6677 ms. (steps per millisecond=149 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4235 ms. (steps per millisecond=236 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2866717 steps, run timeout after 30013 ms. (steps per millisecond=95 ) properties seen :{}
Probabilistic random walk after 2866717 steps, saw 2169419 distinct states, run finished after 30013 ms. (steps per millisecond=95 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 754 rows 755 cols
[2022-06-03 15:17:57] [INFO ] Computed 358 place invariants in 3 ms
[2022-06-03 15:17:57] [INFO ] [Real]Absence check using 358 positive place invariants in 105 ms returned sat
[2022-06-03 15:17:58] [INFO ] After 527ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 15:17:58] [INFO ] [Nat]Absence check using 358 positive place invariants in 43 ms returned sat
[2022-06-03 15:17:58] [INFO ] After 243ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 15:17:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-03 15:17:58] [INFO ] After 31ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-03 15:17:58] [INFO ] After 76ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2022-06-03 15:17:58] [INFO ] After 486ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 252 ms.
Support contains 1 out of 755 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 755/755 places, 754/754 transitions.
Applied a total of 0 rules in 20 ms. Remains 755 /755 variables (removed 0) and now considering 754/754 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 755/755 places, 754/754 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 755/755 places, 754/754 transitions.
Applied a total of 0 rules in 15 ms. Remains 755 /755 variables (removed 0) and now considering 754/754 (removed 0) transitions.
// Phase 1: matrix 754 rows 755 cols
[2022-06-03 15:17:58] [INFO ] Computed 358 place invariants in 2 ms
[2022-06-03 15:17:59] [INFO ] Implicit Places using invariants in 446 ms returned []
// Phase 1: matrix 754 rows 755 cols
[2022-06-03 15:17:59] [INFO ] Computed 358 place invariants in 2 ms
[2022-06-03 15:17:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-03 15:18:00] [INFO ] Implicit Places using invariants and state equation in 762 ms returned []
Implicit Place search using SMT with State Equation took 1223 ms to find 0 implicit places.
[2022-06-03 15:18:00] [INFO ] Redundant transitions in 47 ms returned []
// Phase 1: matrix 754 rows 755 cols
[2022-06-03 15:18:00] [INFO ] Computed 358 place invariants in 2 ms
[2022-06-03 15:18:00] [INFO ] Dead Transitions using invariants and state equation in 365 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 755/755 places, 754/754 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 828 ms. (steps per millisecond=120 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 754 rows 755 cols
[2022-06-03 15:18:01] [INFO ] Computed 358 place invariants in 5 ms
[2022-06-03 15:18:01] [INFO ] [Real]Absence check using 358 positive place invariants in 46 ms returned sat
[2022-06-03 15:18:01] [INFO ] After 400ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 15:18:01] [INFO ] [Nat]Absence check using 358 positive place invariants in 47 ms returned sat
[2022-06-03 15:18:02] [INFO ] After 257ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 15:18:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-03 15:18:02] [INFO ] After 30ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-03 15:18:02] [INFO ] After 84ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2022-06-03 15:18:02] [INFO ] After 528ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 6646 ms. (steps per millisecond=150 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 4291 ms. (steps per millisecond=233 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2897844 steps, run timeout after 30001 ms. (steps per millisecond=96 ) properties seen :{}
Probabilistic random walk after 2897844 steps, saw 2192369 distinct states, run finished after 30001 ms. (steps per millisecond=96 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 754 rows 755 cols
[2022-06-03 15:18:43] [INFO ] Computed 358 place invariants in 7 ms
[2022-06-03 15:18:43] [INFO ] [Real]Absence check using 358 positive place invariants in 47 ms returned sat
[2022-06-03 15:18:43] [INFO ] After 418ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 15:18:43] [INFO ] [Nat]Absence check using 358 positive place invariants in 46 ms returned sat
[2022-06-03 15:18:44] [INFO ] After 260ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 15:18:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-03 15:18:44] [INFO ] After 32ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-03 15:18:44] [INFO ] After 79ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2022-06-03 15:18:44] [INFO ] After 512ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 223 ms.
Support contains 1 out of 755 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 755/755 places, 754/754 transitions.
Applied a total of 0 rules in 15 ms. Remains 755 /755 variables (removed 0) and now considering 754/754 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 755/755 places, 754/754 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 755/755 places, 754/754 transitions.
Applied a total of 0 rules in 16 ms. Remains 755 /755 variables (removed 0) and now considering 754/754 (removed 0) transitions.
// Phase 1: matrix 754 rows 755 cols
[2022-06-03 15:18:44] [INFO ] Computed 358 place invariants in 2 ms
[2022-06-03 15:18:44] [INFO ] Implicit Places using invariants in 406 ms returned []
// Phase 1: matrix 754 rows 755 cols
[2022-06-03 15:18:44] [INFO ] Computed 358 place invariants in 19 ms
[2022-06-03 15:18:45] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-03 15:18:45] [INFO ] Implicit Places using invariants and state equation in 807 ms returned []
Implicit Place search using SMT with State Equation took 1215 ms to find 0 implicit places.
[2022-06-03 15:18:45] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 754 rows 755 cols
[2022-06-03 15:18:45] [INFO ] Computed 358 place invariants in 4 ms
[2022-06-03 15:18:46] [INFO ] Dead Transitions using invariants and state equation in 357 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 755/755 places, 754/754 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 654 ms. (steps per millisecond=152 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 754 rows 755 cols
[2022-06-03 15:18:46] [INFO ] Computed 358 place invariants in 7 ms
[2022-06-03 15:18:46] [INFO ] [Real]Absence check using 358 positive place invariants in 44 ms returned sat
[2022-06-03 15:18:47] [INFO ] After 408ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 15:18:47] [INFO ] [Nat]Absence check using 358 positive place invariants in 45 ms returned sat
[2022-06-03 15:18:47] [INFO ] After 264ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 15:18:47] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-03 15:18:47] [INFO ] After 35ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-03 15:18:47] [INFO ] After 88ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2022-06-03 15:18:47] [INFO ] After 534ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 294064 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :{}
Probabilistic random walk after 294064 steps, saw 221551 distinct states, run finished after 3001 ms. (steps per millisecond=97 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 754 rows 755 cols
[2022-06-03 15:18:50] [INFO ] Computed 358 place invariants in 3 ms
[2022-06-03 15:18:50] [INFO ] [Real]Absence check using 358 positive place invariants in 46 ms returned sat
[2022-06-03 15:18:51] [INFO ] After 401ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 15:18:51] [INFO ] [Nat]Absence check using 358 positive place invariants in 46 ms returned sat
[2022-06-03 15:18:51] [INFO ] After 254ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 15:18:51] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-03 15:18:51] [INFO ] After 41ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-03 15:18:51] [INFO ] After 88ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2022-06-03 15:18:51] [INFO ] After 516ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 755 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 755/755 places, 754/754 transitions.
Applied a total of 0 rules in 14 ms. Remains 755 /755 variables (removed 0) and now considering 754/754 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 755/755 places, 754/754 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 293324 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :{}
Probabilistic random walk after 293324 steps, saw 221017 distinct states, run finished after 3001 ms. (steps per millisecond=97 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 754 rows 755 cols
[2022-06-03 15:18:54] [INFO ] Computed 358 place invariants in 4 ms
[2022-06-03 15:18:55] [INFO ] [Real]Absence check using 358 positive place invariants in 47 ms returned sat
[2022-06-03 15:18:55] [INFO ] After 418ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 15:18:55] [INFO ] [Nat]Absence check using 358 positive place invariants in 47 ms returned sat
[2022-06-03 15:18:55] [INFO ] After 252ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 15:18:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-03 15:18:55] [INFO ] After 31ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-03 15:18:55] [INFO ] After 79ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2022-06-03 15:18:55] [INFO ] After 508ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 755 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 755/755 places, 754/754 transitions.
Applied a total of 0 rules in 15 ms. Remains 755 /755 variables (removed 0) and now considering 754/754 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 755/755 places, 754/754 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 755/755 places, 754/754 transitions.
Applied a total of 0 rules in 14 ms. Remains 755 /755 variables (removed 0) and now considering 754/754 (removed 0) transitions.
// Phase 1: matrix 754 rows 755 cols
[2022-06-03 15:18:55] [INFO ] Computed 358 place invariants in 4 ms
[2022-06-03 15:18:56] [INFO ] Implicit Places using invariants in 393 ms returned []
// Phase 1: matrix 754 rows 755 cols
[2022-06-03 15:18:56] [INFO ] Computed 358 place invariants in 4 ms
[2022-06-03 15:18:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-03 15:18:57] [INFO ] Implicit Places using invariants and state equation in 761 ms returned []
Implicit Place search using SMT with State Equation took 1158 ms to find 0 implicit places.
[2022-06-03 15:18:57] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 754 rows 755 cols
[2022-06-03 15:18:57] [INFO ] Computed 358 place invariants in 2 ms
[2022-06-03 15:18:57] [INFO ] Dead Transitions using invariants and state equation in 359 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 755/755 places, 754/754 transitions.
Partial Free-agglomeration rule applied 80 times.
Drop transitions removed 80 transitions
Iterating global reduction 0 with 80 rules applied. Total rules applied 80 place count 755 transition count 754
Applied a total of 80 rules in 31 ms. Remains 755 /755 variables (removed 0) and now considering 754/754 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 754 rows 755 cols
[2022-06-03 15:18:57] [INFO ] Computed 358 place invariants in 4 ms
[2022-06-03 15:18:57] [INFO ] [Real]Absence check using 358 positive place invariants in 48 ms returned sat
[2022-06-03 15:18:57] [INFO ] After 408ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 15:18:57] [INFO ] [Nat]Absence check using 358 positive place invariants in 48 ms returned sat
[2022-06-03 15:18:58] [INFO ] After 258ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 15:18:58] [INFO ] State equation strengthened by 78 read => feed constraints.
[2022-06-03 15:18:58] [INFO ] After 48ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-03 15:18:58] [INFO ] After 103ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2022-06-03 15:18:58] [INFO ] After 548ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-03 15:18:58] [INFO ] Flatten gal took : 106 ms
[2022-06-03 15:18:58] [INFO ] Flatten gal took : 59 ms
[2022-06-03 15:18:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality270268229877478367.gal : 28 ms
[2022-06-03 15:18:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17818551085361204191.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms10688456584586675821;'/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/ReachabilityCardinality270268229877478367.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17818551085361204191.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/ReachabilityCardinality17818551085361204191.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 331
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :331 after 4967
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :4967 after 65934
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :65934 after 7.63787e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :7.63787e+06 after 1.34639e+08
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.34639e+08 after 3.64392e+10
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :3.64392e+10 after 2.47402e+15
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2.47402e+15 after 9.72101e+18
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :9.72101e+18 after 2.54771e+27
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :2.54771e+27 after 7.23346e+37
Invariant property AtomicProp does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65537 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,4.37131e+52,13.0233,333820,2,21025,21,1.1227e+06,6,0,3738,2.57102e+06,0
Total reachable state count : 4.37131040352153633549812376273208088989e+52

Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,4.3784e+43,13.0282,333820,2,4663,21,1.1227e+06,7,0,3741,2.57102e+06,0
Partial Free-agglomeration rule applied 80 times.
Drop transitions removed 80 transitions
Iterating global reduction 0 with 80 rules applied. Total rules applied 80 place count 755 transition count 754
Applied a total of 80 rules in 28 ms. Remains 755 /755 variables (removed 0) and now considering 754/754 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 754 rows 755 cols
[2022-06-03 15:19:11] [INFO ] Computed 358 place invariants in 5 ms
[2022-06-03 15:19:12] [INFO ] [Real]Absence check using 358 positive place invariants in 52 ms returned sat
[2022-06-03 15:19:12] [INFO ] After 455ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 15:19:12] [INFO ] [Nat]Absence check using 358 positive place invariants in 47 ms returned sat
[2022-06-03 15:19:12] [INFO ] After 255ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 15:19:12] [INFO ] State equation strengthened by 78 read => feed constraints.
[2022-06-03 15:19:12] [INFO ] After 53ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-03 15:19:12] [INFO ] After 111ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2022-06-03 15:19:12] [INFO ] After 552ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-03 15:19:12] [INFO ] Flatten gal took : 49 ms
[2022-06-03 15:19:12] [INFO ] Flatten gal took : 46 ms
[2022-06-03 15:19:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6368879189236425245.gal : 7 ms
[2022-06-03 15:19:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14937906455575993849.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6368879189236425245.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14937906455575993849.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/ReachabilityCardinality14937906455575993849.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 331
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :331 after 4967
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :4967 after 65934
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :65934 after 7.63787e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :7.63787e+06 after 1.34639e+08
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.34639e+08 after 3.64392e+10
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :3.64392e+10 after 2.47402e+15
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2.47402e+15 after 9.72101e+18
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :9.72101e+18 after 2.54771e+27
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :2.54771e+27 after 7.23346e+37
Reachability property ShieldIIPt-PT-040B-ReachabilityCardinality-14 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65537 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,4.37131e+52,13.0257,334252,2,21025,21,1.1227e+06,6,0,3738,2.57102e+06,0
Total reachable state count : 4.37131040352153633549812376273208088989e+52

Verifying 1 reachability properties.
Reachability property ShieldIIPt-PT-040B-ReachabilityCardinality-14 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
ShieldIIPt-PT-040B-ReachabilityCardinality-14,4.3784e+43,13.0306,334252,2,4663,21,1.1227e+06,7,0,3741,2.57102e+06,0
[2022-06-03 15:19:26] [INFO ] Flatten gal took : 46 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6391825373772806471
[2022-06-03 15:19:26] [INFO ] Applying decomposition
[2022-06-03 15:19:26] [INFO ] Computing symmetric may disable matrix : 754 transitions.
[2022-06-03 15:19:26] [INFO ] Computation of Complete disable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 15:19:26] [INFO ] Computing symmetric may enable matrix : 754 transitions.
[2022-06-03 15:19:26] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 15:19:26] [INFO ] Flatten gal took : 43 ms
[2022-06-03 15:19:26] [INFO ] Flatten gal took : 119 ms
[2022-06-03 15:19:26] [INFO ] Computing Do-Not-Accords matrix : 754 transitions.
[2022-06-03 15:19:26] [INFO ] Input system was already deterministic with 754 transitions.
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/graph3452547179021182916.txt' '-o' '/tmp/graph3452547179021182916.bin' '-w' '/tmp/graph3452547179021182916.weights'
[2022-06-03 15:19:26] [INFO ] Computation of Completed DNA matrix. took 28 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3452547179021182916.bin' '-l' '-1' '-v' '-w' '/tmp/graph3452547179021182916.weights' '-q' '0' '-e' '0.001'
[2022-06-03 15:19:26] [INFO ] Built C files in 247ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6391825373772806471
[2022-06-03 15:19:26] [INFO ] Decomposing Gal with order
Running compilation step : cd /tmp/ltsmin6391825373772806471;'/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-06-03 15:19:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 15:19:26] [INFO ] Ran tautology test, simplified 0 / 1 in 441 ms.
[2022-06-03 15:19:26] [INFO ] Removed a total of 905 redundant transitions.
[2022-06-03 15:19:26] [INFO ] BMC solution for property ShieldIIPt-PT-040B-ReachabilityCardinality-14(UNSAT) depth K=0 took 16 ms
[2022-06-03 15:19:26] [INFO ] BMC solution for property ShieldIIPt-PT-040B-ReachabilityCardinality-14(UNSAT) depth K=1 took 1 ms
[2022-06-03 15:19:26] [INFO ] Flatten gal took : 206 ms
[2022-06-03 15:19:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 362 labels/synchronizations in 46 ms.
[2022-06-03 15:19:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3426039569045599397.gal : 13 ms
[2022-06-03 15:19:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4780555453333062174.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3426039569045599397.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4780555453333062174.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...298
[2022-06-03 15:19:27] [INFO ] BMC solution for property ShieldIIPt-PT-040B-ReachabilityCardinality-14(UNSAT) depth K=2 took 254 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 754 rows 755 cols
[2022-06-03 15:19:27] [INFO ] Computed 358 place invariants in 2 ms
[2022-06-03 15:19:27] [INFO ] Computed 358 place invariants in 2 ms
Loading property file /tmp/ReachabilityCardinality4780555453333062174.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
[2022-06-03 15:19:27] [INFO ] BMC solution for property ShieldIIPt-PT-040B-ReachabilityCardinality-14(UNSAT) depth K=3 took 495 ms
[2022-06-03 15:19:28] [INFO ] Proved 755 variables to be positive in 975 ms
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :34816 after 2.17112e+67
[2022-06-03 15:19:28] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPt-PT-040B-ReachabilityCardinality-14
[2022-06-03 15:19:28] [INFO ] KInduction solution for property ShieldIIPt-PT-040B-ReachabilityCardinality-14(SAT) depth K=0 took 156 ms
Compilation finished in 2353 ms.
Running link step : cd /tmp/ltsmin6391825373772806471;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin6391825373772806471;'/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' '-i' 'ShieldIIPtPT040BReachabilityCardinality14==true'
[2022-06-03 15:19:28] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPt-PT-040B-ReachabilityCardinality-14
[2022-06-03 15:19:28] [INFO ] KInduction solution for property ShieldIIPt-PT-040B-ReachabilityCardinality-14(SAT) depth K=1 took 624 ms
[2022-06-03 15:19:46] [INFO ] BMC solution for property ShieldIIPt-PT-040B-ReachabilityCardinality-14(UNSAT) depth K=4 took 19092 ms
[2022-06-03 15:22:09] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPt-PT-040B-ReachabilityCardinality-14
[2022-06-03 15:22:09] [INFO ] KInduction solution for property ShieldIIPt-PT-040B-ReachabilityCardinality-14(SAT) depth K=2 took 160089 ms
[2022-06-03 15:26:00] [INFO ] BMC solution for property ShieldIIPt-PT-040B-ReachabilityCardinality-14(UNSAT) depth K=5 took 374108 ms
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 7/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.015: Loading model from ./gal.so
pins2lts-mc-linux64( 4/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.022: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.029: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.039: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.033: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.037: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.052: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.052: Initializing POR dependencies: labels 755, guards 754
pins2lts-mc-linux64( 1/ 8), 0.052: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.054: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 4.684: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 3/ 8), 4.804: "ShieldIIPtPT040BReachabilityCardinality14==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 4.804: "ShieldIIPtPT040BReachabilityCardinality14==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 4.804: "ShieldIIPtPT040BReachabilityCardinality14==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 4.804: "ShieldIIPtPT040BReachabilityCardinality14==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 4.812: "ShieldIIPtPT040BReachabilityCardinality14==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 4.803: "ShieldIIPtPT040BReachabilityCardinality14==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 4.804: "ShieldIIPtPT040BReachabilityCardinality14==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 4.812: "ShieldIIPtPT040BReachabilityCardinality14==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 4.812: There are 755 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 4.812: State length is 755, there are 754 groups
pins2lts-mc-linux64( 0/ 8), 4.812: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 4.812: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 4.812: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 4.812: Visible groups: 0 / 754, labels: 1 / 755
pins2lts-mc-linux64( 0/ 8), 4.812: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 4.812: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 4.910: ~9 levels ~960 states ~2288 transitions
pins2lts-mc-linux64( 0/ 8), 5.004: ~10 levels ~1920 states ~5776 transitions
pins2lts-mc-linux64( 5/ 8), 5.174: ~8 levels ~3840 states ~12976 transitions
pins2lts-mc-linux64( 1/ 8), 5.459: ~8 levels ~7680 states ~29320 transitions
pins2lts-mc-linux64( 1/ 8), 6.015: ~9 levels ~15360 states ~65656 transitions
pins2lts-mc-linux64( 1/ 8), 6.975: ~10 levels ~30720 states ~136280 transitions
pins2lts-mc-linux64( 1/ 8), 8.992: ~11 levels ~61440 states ~297640 transitions
pins2lts-mc-linux64( 2/ 8), 13.137: ~13 levels ~122880 states ~689296 transitions
pins2lts-mc-linux64( 5/ 8), 20.718: ~13 levels ~245760 states ~1296296 transitions
pins2lts-mc-linux64( 2/ 8), 35.778: ~16 levels ~491520 states ~3059096 transitions
pins2lts-mc-linux64( 5/ 8), 65.334: ~15 levels ~983040 states ~5733840 transitions
pins2lts-mc-linux64( 5/ 8), 128.238: ~16 levels ~1966080 states ~12397040 transitions
pins2lts-mc-linux64( 5/ 8), 254.843: ~17 levels ~3932160 states ~25790936 transitions
pins2lts-mc-linux64( 3/ 8), 406.409: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 406.606:
pins2lts-mc-linux64( 0/ 8), 406.606: mean standard work distribution: 2.7% (states) 1.9% (transitions)
pins2lts-mc-linux64( 0/ 8), 406.606:
pins2lts-mc-linux64( 0/ 8), 406.606: Explored 5763050 states 42374958 transitions, fanout: 7.353
pins2lts-mc-linux64( 0/ 8), 406.606: Total exploration time 401.790 sec (401.610 sec minimum, 401.685 sec on average)
pins2lts-mc-linux64( 0/ 8), 406.606: States per second: 14343, Transitions per second: 105465
pins2lts-mc-linux64( 0/ 8), 406.606: Ignoring proviso: 3854445
pins2lts-mc-linux64( 0/ 8), 406.606:
pins2lts-mc-linux64( 0/ 8), 406.606: Queue width: 8B, total height: 5866060, memory: 44.75MB
pins2lts-mc-linux64( 0/ 8), 406.606: Tree memory: 344.7MB, 31.1 B/state, compr.: 1.0%
pins2lts-mc-linux64( 0/ 8), 406.606: Tree fill ratio (roots/leafs): 8.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 406.606: Stored 761 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 406.606: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 406.606: Est. total memory use: 389.5MB (~1068.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6391825373772806471;'/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' '-i' 'ShieldIIPtPT040BReachabilityCardinality14==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6391825373772806471;'/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' '-i' 'ShieldIIPtPT040BReachabilityCardinality14==true'
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)
[2022-06-03 15:28:22] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPt-PT-040B-ReachabilityCardinality-14
[2022-06-03 15:28:22] [INFO ] KInduction solution for property ShieldIIPt-PT-040B-ReachabilityCardinality-14(SAT) depth K=3 took 373075 ms
[2022-06-03 15:36:07] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPt-PT-040B-ReachabilityCardinality-14
[2022-06-03 15:36:07] [INFO ] KInduction solution for property ShieldIIPt-PT-040B-ReachabilityCardinality-14(SAT) depth K=4 took 465591 ms
Reachability property ShieldIIPt-PT-040B-ReachabilityCardinality-14 is true.
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 17 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\_mod\_flat,1.97143e+111,780.654,6362792,2226,26,8.79997e+06,136,592,3.145e+07,34,373,0
Total reachable state count : 1.971429356489565672960872377306406229112e+111

Verifying 1 reachability properties.
Reachability property ShieldIIPt-PT-040B-ReachabilityCardinality-14 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
ShieldIIPt-PT-040B-ReachabilityCardinality-14,4.19197e+66,780.656,6362792,297,20,8.79997e+06,136,597,3.145e+07,37,373,0
[2022-06-03 15:36:47] [WARNING] Interrupting SMT solver.
[2022-06-03 15:36:47] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:385)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:164)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-03 15:36:47] [WARNING] Unexpected error occurred while running SMT. Was verifying ShieldIIPt-PT-040B-ReachabilityCardinality-14 SMT depth 6
java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:411)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:164)
at java.base/java.lang.Thread.run(Thread.java:829)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:385)
... 2 more
[2022-06-03 15:36:47] [INFO ] During BMC, SMT solver timed out at depth 6
[2022-06-03 15:36:47] [INFO ] BMC solving timed out (3600000 secs) at depth 6
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:587)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:306)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-03 15:36:47] [WARNING] Unexpected error occurred while running SMT. Was verifying ShieldIIPt-PT-040B-ReachabilityCardinality-14 K-induction depth 5
Exception in thread "Thread-9" java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:344)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
at java.base/java.lang.Thread.run(Thread.java:829)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:587)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:306)
... 2 more
[2022-06-03 15:36:47] [INFO ] SMT solved 0/ 1 properties. Interrupting SMT analysis.
Total runtime 1295585 ms.

BK_STOP 1654270607436

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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-040B"
export BK_EXAMINATION="ReachabilityCardinality"
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-040B, examination is ReachabilityCardinality"
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-165286025000318"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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