fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r222-tall-165286025300478
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for ShieldPPPs-PT-030B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10126.084 3600000.00 13666400.00 555.00 TTFFTTFTFTTTTT?T normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 952K
-rw-r--r-- 1 mcc users 6.4K Apr 30 03:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 30 03:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 30 03:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 30 03:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 9 08:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 30 03:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 30 03:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 30 03:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 30 03:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:53 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 528K 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 ShieldPPPs-PT-030B-ReachabilityCardinality-00
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-01
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-02
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-03
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-04
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-05
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-06
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-07
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-08
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-09
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-10
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-11
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-12
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-13
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-14
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654272688826

Running Version 202205111006
[2022-06-03 16:11:29] [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 16:11:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 16:11:30] [INFO ] Load time of PNML (sax parser for PT used): 181 ms
[2022-06-03 16:11:30] [INFO ] Transformed 2043 places.
[2022-06-03 16:11:30] [INFO ] Transformed 1893 transitions.
[2022-06-03 16:11:30] [INFO ] Found NUPN structural information;
[2022-06-03 16:11:30] [INFO ] Parsed PT model containing 2043 places and 1893 transitions in 359 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 631 ms. (steps per millisecond=15 ) properties (out of 15) seen :4
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 1893 rows 2043 cols
[2022-06-03 16:11:31] [INFO ] Computed 331 place invariants in 56 ms
[2022-06-03 16:11:32] [INFO ] After 905ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2022-06-03 16:11:33] [INFO ] [Nat]Absence check using 331 positive place invariants in 116 ms returned sat
[2022-06-03 16:11:34] [INFO ] After 1044ms SMT Verify possible using state equation in natural domain returned unsat :9 sat :2
[2022-06-03 16:11:35] [INFO ] Deduced a trap composed of 23 places in 675 ms of which 8 ms to minimize.
[2022-06-03 16:11:35] [INFO ] Deduced a trap composed of 10 places in 557 ms of which 3 ms to minimize.
[2022-06-03 16:11:36] [INFO ] Deduced a trap composed of 23 places in 538 ms of which 2 ms to minimize.
[2022-06-03 16:11:37] [INFO ] Deduced a trap composed of 18 places in 527 ms of which 3 ms to minimize.
[2022-06-03 16:11:37] [INFO ] Deduced a trap composed of 16 places in 511 ms of which 2 ms to minimize.
[2022-06-03 16:11:38] [INFO ] Deduced a trap composed of 26 places in 575 ms of which 1 ms to minimize.
[2022-06-03 16:11:38] [INFO ] Deduced a trap composed of 24 places in 526 ms of which 2 ms to minimize.
[2022-06-03 16:11:39] [INFO ] Deduced a trap composed of 22 places in 526 ms of which 1 ms to minimize.
[2022-06-03 16:11:40] [INFO ] Deduced a trap composed of 28 places in 527 ms of which 2 ms to minimize.
[2022-06-03 16:11:40] [INFO ] Deduced a trap composed of 45 places in 512 ms of which 2 ms to minimize.
[2022-06-03 16:11:41] [INFO ] Deduced a trap composed of 44 places in 500 ms of which 2 ms to minimize.
[2022-06-03 16:11:41] [INFO ] Deduced a trap composed of 40 places in 513 ms of which 2 ms to minimize.
[2022-06-03 16:11:42] [INFO ] Deduced a trap composed of 32 places in 485 ms of which 1 ms to minimize.
[2022-06-03 16:11:43] [INFO ] Deduced a trap composed of 32 places in 495 ms of which 1 ms to minimize.
[2022-06-03 16:11:43] [INFO ] Deduced a trap composed of 26 places in 491 ms of which 1 ms to minimize.
[2022-06-03 16:11:44] [INFO ] Deduced a trap composed of 24 places in 484 ms of which 1 ms to minimize.
[2022-06-03 16:11:44] [INFO ] Deduced a trap composed of 29 places in 463 ms of which 1 ms to minimize.
[2022-06-03 16:11:45] [INFO ] Deduced a trap composed of 49 places in 450 ms of which 1 ms to minimize.
[2022-06-03 16:11:45] [INFO ] Deduced a trap composed of 42 places in 461 ms of which 1 ms to minimize.
[2022-06-03 16:11:46] [INFO ] Deduced a trap composed of 14 places in 455 ms of which 2 ms to minimize.
[2022-06-03 16:11:46] [INFO ] Deduced a trap composed of 32 places in 435 ms of which 1 ms to minimize.
[2022-06-03 16:11:47] [INFO ] Deduced a trap composed of 23 places in 445 ms of which 2 ms to minimize.
[2022-06-03 16:11:47] [INFO ] Deduced a trap composed of 54 places in 441 ms of which 1 ms to minimize.
[2022-06-03 16:11:48] [INFO ] Deduced a trap composed of 36 places in 413 ms of which 1 ms to minimize.
[2022-06-03 16:11:48] [INFO ] Deduced a trap composed of 28 places in 456 ms of which 2 ms to minimize.
[2022-06-03 16:11:49] [INFO ] Deduced a trap composed of 34 places in 430 ms of which 1 ms to minimize.
[2022-06-03 16:11:49] [INFO ] Deduced a trap composed of 41 places in 415 ms of which 1 ms to minimize.
[2022-06-03 16:11:50] [INFO ] Deduced a trap composed of 53 places in 412 ms of which 1 ms to minimize.
[2022-06-03 16:11:50] [INFO ] Deduced a trap composed of 57 places in 410 ms of which 1 ms to minimize.
[2022-06-03 16:11:51] [INFO ] Deduced a trap composed of 38 places in 401 ms of which 1 ms to minimize.
[2022-06-03 16:11:51] [INFO ] Deduced a trap composed of 35 places in 416 ms of which 1 ms to minimize.
[2022-06-03 16:11:52] [INFO ] Deduced a trap composed of 37 places in 434 ms of which 1 ms to minimize.
[2022-06-03 16:11:52] [INFO ] Deduced a trap composed of 54 places in 433 ms of which 1 ms to minimize.
[2022-06-03 16:11:53] [INFO ] Deduced a trap composed of 33 places in 422 ms of which 3 ms to minimize.
[2022-06-03 16:11:53] [INFO ] Deduced a trap composed of 23 places in 414 ms of which 2 ms to minimize.
[2022-06-03 16:11:54] [INFO ] Deduced a trap composed of 36 places in 400 ms of which 2 ms to minimize.
[2022-06-03 16:11:54] [INFO ] Deduced a trap composed of 31 places in 398 ms of which 1 ms to minimize.
[2022-06-03 16:11:55] [INFO ] Deduced a trap composed of 32 places in 397 ms of which 2 ms to minimize.
[2022-06-03 16:11:55] [INFO ] Deduced a trap composed of 37 places in 432 ms of which 1 ms to minimize.
[2022-06-03 16:11:56] [INFO ] Deduced a trap composed of 41 places in 410 ms of which 2 ms to minimize.
[2022-06-03 16:11:56] [INFO ] Deduced a trap composed of 39 places in 416 ms of which 2 ms to minimize.
[2022-06-03 16:11:57] [INFO ] Deduced a trap composed of 38 places in 394 ms of which 1 ms to minimize.
[2022-06-03 16:11:57] [INFO ] Deduced a trap composed of 47 places in 412 ms of which 3 ms to minimize.
[2022-06-03 16:11:57] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-03 16:11:57] [INFO ] After 25046ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2708 ms.
Support contains 33 out of 2043 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2043/2043 places, 1893/1893 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 2043 transition count 1692
Reduce places removed 201 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 208 rules applied. Total rules applied 409 place count 1842 transition count 1685
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 416 place count 1835 transition count 1685
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 150 Pre rules applied. Total rules applied 416 place count 1835 transition count 1535
Deduced a syphon composed of 150 places in 9 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 3 with 300 rules applied. Total rules applied 716 place count 1685 transition count 1535
Discarding 202 places :
Symmetric choice reduction at 3 with 202 rule applications. Total rules 918 place count 1483 transition count 1333
Iterating global reduction 3 with 202 rules applied. Total rules applied 1120 place count 1483 transition count 1333
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 84 Pre rules applied. Total rules applied 1120 place count 1483 transition count 1249
Deduced a syphon composed of 84 places in 3 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 1288 place count 1399 transition count 1249
Performed 434 Post agglomeration using F-continuation condition.Transition count delta: 434
Deduced a syphon composed of 434 places in 2 ms
Reduce places removed 434 places and 0 transitions.
Iterating global reduction 3 with 868 rules applied. Total rules applied 2156 place count 965 transition count 815
Partial Free-agglomeration rule applied 254 times.
Drop transitions removed 254 transitions
Iterating global reduction 3 with 254 rules applied. Total rules applied 2410 place count 965 transition count 815
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2411 place count 964 transition count 814
Applied a total of 2411 rules in 752 ms. Remains 964 /2043 variables (removed 1079) and now considering 814/1893 (removed 1079) transitions.
Finished structural reductions, in 1 iterations. Remains : 964/2043 places, 814/1893 transitions.
Incomplete random walk after 1000000 steps, including 164 resets, run finished after 12288 ms. (steps per millisecond=81 ) properties (out of 2) seen :1
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 933950 steps, including 4 resets, run timeout after 5001 ms. (steps per millisecond=186 ) properties seen 0
Running SMT prover for 1 properties.
// Phase 1: matrix 814 rows 964 cols
[2022-06-03 16:12:18] [INFO ] Computed 331 place invariants in 35 ms
[2022-06-03 16:12:18] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 16:12:18] [INFO ] [Nat]Absence check using 312 positive place invariants in 52 ms returned sat
[2022-06-03 16:12:18] [INFO ] [Nat]Absence check using 312 positive and 19 generalized place invariants in 3 ms returned sat
[2022-06-03 16:12:21] [INFO ] After 2239ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 16:12:24] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 1 ms to minimize.
[2022-06-03 16:12:24] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 1 ms to minimize.
[2022-06-03 16:12:25] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 0 ms to minimize.
[2022-06-03 16:12:25] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 0 ms to minimize.
[2022-06-03 16:12:25] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2022-06-03 16:12:25] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 0 ms to minimize.
[2022-06-03 16:12:25] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
[2022-06-03 16:12:26] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2022-06-03 16:12:26] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 1 ms to minimize.
[2022-06-03 16:12:26] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 1 ms to minimize.
[2022-06-03 16:12:26] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 0 ms to minimize.
[2022-06-03 16:12:26] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2022-06-03 16:12:26] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2022-06-03 16:12:26] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 0 ms to minimize.
[2022-06-03 16:12:27] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2302 ms
[2022-06-03 16:12:27] [INFO ] After 8280ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2181 ms.
[2022-06-03 16:12:29] [INFO ] After 10640ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 955 ms.
Support contains 29 out of 964 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 964/964 places, 814/814 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 961 transition count 811
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 960 transition count 810
Applied a total of 7 rules in 304 ms. Remains 960 /964 variables (removed 4) and now considering 810/814 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 960/964 places, 810/814 transitions.
Incomplete random walk after 1000000 steps, including 163 resets, run finished after 8487 ms. (steps per millisecond=117 ) properties (out of 1) seen :0
Interrupted Best-First random walk after 915745 steps, including 3 resets, run timeout after 5001 ms. (steps per millisecond=183 ) properties seen 0
Interrupted probabilistic random walk after 2706523 steps, run timeout after 39001 ms. (steps per millisecond=69 ) properties seen :{}
Probabilistic random walk after 2706523 steps, saw 1371797 distinct states, run finished after 39003 ms. (steps per millisecond=69 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 810 rows 960 cols
[2022-06-03 16:13:23] [INFO ] Computed 331 place invariants in 18 ms
[2022-06-03 16:13:23] [INFO ] After 157ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 16:13:23] [INFO ] [Nat]Absence check using 315 positive place invariants in 50 ms returned sat
[2022-06-03 16:13:23] [INFO ] [Nat]Absence check using 315 positive and 16 generalized place invariants in 2 ms returned sat
[2022-06-03 16:13:25] [INFO ] After 1964ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 16:13:32] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 1 ms to minimize.
[2022-06-03 16:13:32] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2022-06-03 16:13:32] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 1 ms to minimize.
[2022-06-03 16:13:32] [INFO ] Deduced a trap composed of 6 places in 88 ms of which 0 ms to minimize.
[2022-06-03 16:13:32] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 0 ms to minimize.
[2022-06-03 16:13:32] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 1 ms to minimize.
[2022-06-03 16:13:33] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 0 ms to minimize.
[2022-06-03 16:13:33] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 1 ms to minimize.
[2022-06-03 16:13:33] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 2 ms to minimize.
[2022-06-03 16:13:33] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 2 ms to minimize.
[2022-06-03 16:13:33] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2022-06-03 16:13:33] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2022-06-03 16:13:33] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 0 ms to minimize.
[2022-06-03 16:13:34] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 0 ms to minimize.
[2022-06-03 16:13:34] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 0 ms to minimize.
[2022-06-03 16:13:34] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2022-06-03 16:13:34] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
[2022-06-03 16:13:34] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
[2022-06-03 16:13:34] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 0 ms to minimize.
[2022-06-03 16:13:34] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
[2022-06-03 16:13:35] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 0 ms to minimize.
[2022-06-03 16:13:35] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 0 ms to minimize.
[2022-06-03 16:13:35] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 11 ms to minimize.
[2022-06-03 16:13:35] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 0 ms to minimize.
[2022-06-03 16:13:35] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 0 ms to minimize.
[2022-06-03 16:13:35] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 0 ms to minimize.
[2022-06-03 16:13:35] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 0 ms to minimize.
[2022-06-03 16:13:36] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2022-06-03 16:13:36] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2022-06-03 16:13:36] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2022-06-03 16:13:36] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 0 ms to minimize.
[2022-06-03 16:13:36] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2022-06-03 16:13:36] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 4559 ms
[2022-06-03 16:13:36] [INFO ] After 13382ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4547 ms.
[2022-06-03 16:13:41] [INFO ] After 18105ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 714 ms.
Support contains 29 out of 960 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 960/960 places, 810/810 transitions.
Applied a total of 0 rules in 31 ms. Remains 960 /960 variables (removed 0) and now considering 810/810 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 960/960 places, 810/810 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 960/960 places, 810/810 transitions.
Applied a total of 0 rules in 29 ms. Remains 960 /960 variables (removed 0) and now considering 810/810 (removed 0) transitions.
// Phase 1: matrix 810 rows 960 cols
[2022-06-03 16:13:42] [INFO ] Computed 331 place invariants in 12 ms
[2022-06-03 16:13:42] [INFO ] Implicit Places using invariants in 502 ms returned []
// Phase 1: matrix 810 rows 960 cols
[2022-06-03 16:13:42] [INFO ] Computed 331 place invariants in 4 ms
[2022-06-03 16:13:43] [INFO ] Implicit Places using invariants and state equation in 1061 ms returned []
Implicit Place search using SMT with State Equation took 1563 ms to find 0 implicit places.
[2022-06-03 16:13:43] [INFO ] Redundant transitions in 49 ms returned []
// Phase 1: matrix 810 rows 960 cols
[2022-06-03 16:13:43] [INFO ] Computed 331 place invariants in 5 ms
[2022-06-03 16:13:44] [INFO ] Dead Transitions using invariants and state equation in 400 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 960/960 places, 810/810 transitions.
Incomplete random walk after 1000000 steps, including 163 resets, run finished after 8382 ms. (steps per millisecond=119 ) properties (out of 1) seen :0
Interrupted Best-First random walk after 956822 steps, including 4 resets, run timeout after 5001 ms. (steps per millisecond=191 ) properties seen 0
Interrupted probabilistic random walk after 2832583 steps, run timeout after 39001 ms. (steps per millisecond=72 ) properties seen :{}
Probabilistic random walk after 2832583 steps, saw 1388878 distinct states, run finished after 39006 ms. (steps per millisecond=72 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 810 rows 960 cols
[2022-06-03 16:14:36] [INFO ] Computed 331 place invariants in 9 ms
[2022-06-03 16:14:36] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 16:14:36] [INFO ] [Nat]Absence check using 315 positive place invariants in 46 ms returned sat
[2022-06-03 16:14:36] [INFO ] [Nat]Absence check using 315 positive and 16 generalized place invariants in 4 ms returned sat
[2022-06-03 16:14:38] [INFO ] After 1958ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 16:14:45] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 0 ms to minimize.
[2022-06-03 16:14:45] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2022-06-03 16:14:46] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 0 ms to minimize.
[2022-06-03 16:14:46] [INFO ] Deduced a trap composed of 6 places in 88 ms of which 0 ms to minimize.
[2022-06-03 16:14:46] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 0 ms to minimize.
[2022-06-03 16:14:46] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 0 ms to minimize.
[2022-06-03 16:14:46] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 0 ms to minimize.
[2022-06-03 16:14:46] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 0 ms to minimize.
[2022-06-03 16:14:46] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 0 ms to minimize.
[2022-06-03 16:14:46] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 0 ms to minimize.
[2022-06-03 16:14:47] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2022-06-03 16:14:47] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2022-06-03 16:14:47] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 1 ms to minimize.
[2022-06-03 16:14:47] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2022-06-03 16:14:47] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 0 ms to minimize.
[2022-06-03 16:14:47] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 0 ms to minimize.
[2022-06-03 16:14:47] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 0 ms to minimize.
[2022-06-03 16:14:47] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 0 ms to minimize.
[2022-06-03 16:14:48] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 0 ms to minimize.
[2022-06-03 16:14:48] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 0 ms to minimize.
[2022-06-03 16:14:48] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 1 ms to minimize.
[2022-06-03 16:14:48] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 0 ms to minimize.
[2022-06-03 16:14:48] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 0 ms to minimize.
[2022-06-03 16:14:49] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
[2022-06-03 16:14:49] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
[2022-06-03 16:14:49] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 0 ms to minimize.
[2022-06-03 16:14:49] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2022-06-03 16:14:49] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 0 ms to minimize.
[2022-06-03 16:14:49] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 5 ms to minimize.
[2022-06-03 16:14:49] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2022-06-03 16:14:50] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2022-06-03 16:14:50] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2022-06-03 16:14:50] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 4521 ms
[2022-06-03 16:14:50] [INFO ] After 13410ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4605 ms.
[2022-06-03 16:14:54] [INFO ] After 18182ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 733 ms.
Support contains 29 out of 960 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 960/960 places, 810/810 transitions.
Applied a total of 0 rules in 27 ms. Remains 960 /960 variables (removed 0) and now considering 810/810 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 960/960 places, 810/810 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 960/960 places, 810/810 transitions.
Applied a total of 0 rules in 27 ms. Remains 960 /960 variables (removed 0) and now considering 810/810 (removed 0) transitions.
// Phase 1: matrix 810 rows 960 cols
[2022-06-03 16:14:55] [INFO ] Computed 331 place invariants in 5 ms
[2022-06-03 16:14:56] [INFO ] Implicit Places using invariants in 588 ms returned []
// Phase 1: matrix 810 rows 960 cols
[2022-06-03 16:14:56] [INFO ] Computed 331 place invariants in 5 ms
[2022-06-03 16:14:57] [INFO ] Implicit Places using invariants and state equation in 1080 ms returned []
Implicit Place search using SMT with State Equation took 1669 ms to find 0 implicit places.
[2022-06-03 16:14:57] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 810 rows 960 cols
[2022-06-03 16:14:57] [INFO ] Computed 331 place invariants in 5 ms
[2022-06-03 16:14:57] [INFO ] Dead Transitions using invariants and state equation in 396 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 960/960 places, 810/810 transitions.
Applied a total of 0 rules in 23 ms. Remains 960 /960 variables (removed 0) and now considering 810/810 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 810 rows 960 cols
[2022-06-03 16:14:57] [INFO ] Computed 331 place invariants in 5 ms
[2022-06-03 16:14:57] [INFO ] After 207ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 16:14:58] [INFO ] [Nat]Absence check using 315 positive place invariants in 50 ms returned sat
[2022-06-03 16:14:58] [INFO ] [Nat]Absence check using 315 positive and 16 generalized place invariants in 2 ms returned sat
[2022-06-03 16:14:59] [INFO ] After 1919ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 16:15:06] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 1 ms to minimize.
[2022-06-03 16:15:07] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2022-06-03 16:15:07] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 0 ms to minimize.
[2022-06-03 16:15:07] [INFO ] Deduced a trap composed of 6 places in 88 ms of which 0 ms to minimize.
[2022-06-03 16:15:07] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 1 ms to minimize.
[2022-06-03 16:15:07] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 1 ms to minimize.
[2022-06-03 16:15:07] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 1 ms to minimize.
[2022-06-03 16:15:07] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 0 ms to minimize.
[2022-06-03 16:15:08] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2022-06-03 16:15:08] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 0 ms to minimize.
[2022-06-03 16:15:08] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 0 ms to minimize.
[2022-06-03 16:15:08] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2022-06-03 16:15:08] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
[2022-06-03 16:15:08] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 0 ms to minimize.
[2022-06-03 16:15:08] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2022-06-03 16:15:08] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2022-06-03 16:15:09] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 0 ms to minimize.
[2022-06-03 16:15:09] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 0 ms to minimize.
[2022-06-03 16:15:09] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 0 ms to minimize.
[2022-06-03 16:15:09] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 0 ms to minimize.
[2022-06-03 16:15:09] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 0 ms to minimize.
[2022-06-03 16:15:09] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 0 ms to minimize.
[2022-06-03 16:15:09] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 0 ms to minimize.
[2022-06-03 16:15:10] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 0 ms to minimize.
[2022-06-03 16:15:10] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 0 ms to minimize.
[2022-06-03 16:15:10] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 0 ms to minimize.
[2022-06-03 16:15:10] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 0 ms to minimize.
[2022-06-03 16:15:10] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 0 ms to minimize.
[2022-06-03 16:15:11] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 0 ms to minimize.
[2022-06-03 16:15:11] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2022-06-03 16:15:11] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
[2022-06-03 16:15:11] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 0 ms to minimize.
[2022-06-03 16:15:11] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 4558 ms
[2022-06-03 16:15:11] [INFO ] After 13316ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4530 ms.
[2022-06-03 16:15:15] [INFO ] After 18022ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-03 16:15:16] [INFO ] Flatten gal took : 140 ms
[2022-06-03 16:15:16] [INFO ] Flatten gal took : 65 ms
[2022-06-03 16:15:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2777862851471280216.gal : 19 ms
[2022-06-03 16:15:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14216968380599849796.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2777862851471280216.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14216968380599849796.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/ReachabilityCardinality14216968380599849796.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 12
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :12 after 40
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :40 after 116
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :116 after 462
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :462 after 15842
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :15842 after 16244
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :16244 after 20072
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :20072 after 545742
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :545742 after 1.2123e+06
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.2123e+06 after 6.23821e+08
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :6.23821e+08 after 6.1416e+09
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :6.1416e+09 after 3.40296e+12
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :3.40296e+12 after 1.80547e+16
Detected timeout of ITS tools.
[2022-06-03 16:15:31] [INFO ] Flatten gal took : 56 ms
[2022-06-03 16:15:31] [INFO ] Applying decomposition
[2022-06-03 16:15:31] [INFO ] Flatten gal took : 52 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph16529309023141903298.txt' '-o' '/tmp/graph16529309023141903298.bin' '-w' '/tmp/graph16529309023141903298.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16529309023141903298.bin' '-l' '-1' '-v' '-w' '/tmp/graph16529309023141903298.weights' '-q' '0' '-e' '0.001'
[2022-06-03 16:15:31] [INFO ] Decomposing Gal with order
[2022-06-03 16:15:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 16:15:32] [INFO ] Removed a total of 422 redundant transitions.
[2022-06-03 16:15:32] [INFO ] Flatten gal took : 269 ms
[2022-06-03 16:15:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 723 labels/synchronizations in 63 ms.
[2022-06-03 16:15:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18440968431010187401.gal : 21 ms
[2022-06-03 16:15:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2846870993586890447.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/ReachabilityCardinality18440968431010187401.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2846870993586890447.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality2846870993586890447.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
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :2 after 23
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :23 after 79
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :79 after 245784
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :5.60208e+09 after 3.01179e+28
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1215698045178697603
[2022-06-03 16:15:47] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1215698045178697603
Running compilation step : cd /tmp/ltsmin1215698045178697603;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1705 ms.
Running link step : cd /tmp/ltsmin1215698045178697603;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin1215698045178697603;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'ShieldPPPsPT030BReachabilityCardinality14==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-03 16:16:02] [INFO ] Flatten gal took : 38 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7160542352740106940
[2022-06-03 16:16:02] [INFO ] Computing symmetric may disable matrix : 810 transitions.
[2022-06-03 16:16:02] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 16:16:02] [INFO ] Computing symmetric may enable matrix : 810 transitions.
[2022-06-03 16:16:02] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 16:16:02] [INFO ] Applying decomposition
[2022-06-03 16:16:02] [INFO ] Flatten gal took : 59 ms
[2022-06-03 16:16:02] [INFO ] Flatten gal took : 98 ms
[2022-06-03 16:16:02] [INFO ] Input system was already deterministic with 810 transitions.
[2022-06-03 16:16:02] [INFO ] Computing Do-Not-Accords matrix : 810 transitions.
[2022-06-03 16:16:02] [INFO ] Computation of Completed DNA matrix. took 39 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 16:16:02] [INFO ] Built C files in 274ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7160542352740106940
Running compilation step : cd /tmp/ltsmin7160542352740106940;'/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'
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/graph6183311649779984434.txt' '-o' '/tmp/graph6183311649779984434.bin' '-w' '/tmp/graph6183311649779984434.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6183311649779984434.bin' '-l' '-1' '-v' '-w' '/tmp/graph6183311649779984434.weights' '-q' '0' '-e' '0.001'
[2022-06-03 16:16:02] [INFO ] Decomposing Gal with order
[2022-06-03 16:16:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 16:16:03] [INFO ] Removed a total of 397 redundant transitions.
[2022-06-03 16:16:03] [INFO ] Ran tautology test, simplified 0 / 1 in 504 ms.
[2022-06-03 16:16:03] [INFO ] Flatten gal took : 168 ms
[2022-06-03 16:16:03] [INFO ] BMC solution for property ShieldPPPs-PT-030B-ReachabilityCardinality-14(UNSAT) depth K=0 took 28 ms
[2022-06-03 16:16:03] [INFO ] BMC solution for property ShieldPPPs-PT-030B-ReachabilityCardinality-14(UNSAT) depth K=1 took 12 ms
[2022-06-03 16:16:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 762 labels/synchronizations in 58 ms.
[2022-06-03 16:16:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4780275013895954477.gal : 14 ms
[2022-06-03 16:16:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15641196986729136515.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/ReachabilityCardinality4780275013895954477.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15641196986729136515.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality15641196986729136515.prop.
SDD proceeding with computation,1 properties remain. new max is 4
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 810 rows 960 cols
SDD size :1 after 7
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :7 after 7
[2022-06-03 16:16:03] [INFO ] Computed 331 place invariants in 5 ms
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :7 after 9
[2022-06-03 16:16:03] [INFO ] Computed 331 place invariants in 5 ms
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :9 after 9
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :9 after 79
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :79 after 924
[2022-06-03 16:16:04] [INFO ] BMC solution for property ShieldPPPs-PT-030B-ReachabilityCardinality-14(UNSAT) depth K=2 took 935 ms
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :5.79348e+06 after 4.01275e+18
[2022-06-03 16:16:05] [INFO ] Proved 960 variables to be positive in 1589 ms
[2022-06-03 16:16:05] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPs-PT-030B-ReachabilityCardinality-14
[2022-06-03 16:16:05] [INFO ] KInduction solution for property ShieldPPPs-PT-030B-ReachabilityCardinality-14(SAT) depth K=0 took 160 ms
Compilation finished in 2832 ms.
Running link step : cd /tmp/ltsmin7160542352740106940;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin7160542352740106940;'/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' 'ShieldPPPsPT030BReachabilityCardinality14==true'
[2022-06-03 16:16:06] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPs-PT-030B-ReachabilityCardinality-14
[2022-06-03 16:16:06] [INFO ] KInduction solution for property ShieldPPPs-PT-030B-ReachabilityCardinality-14(SAT) depth K=1 took 677 ms
[2022-06-03 16:18:30] [INFO ] BMC solution for property ShieldPPPs-PT-030B-ReachabilityCardinality-14(UNSAT) depth K=3 took 145693 ms
[2022-06-03 16:32:52] [INFO ] BMC solution for property ShieldPPPs-PT-030B-ReachabilityCardinality-14(UNSAT) depth K=4 took 862147 ms
[2022-06-03 16:33:35] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPs-PT-030B-ReachabilityCardinality-14
[2022-06-03 16:33:35] [INFO ] KInduction solution for property ShieldPPPs-PT-030B-ReachabilityCardinality-14(SAT) depth K=2 took 1048796 ms
Detected timeout of ITS tools.
[2022-06-03 16:37:33] [INFO ] Applying decomposition
[2022-06-03 16:37:33] [INFO ] Flatten gal took : 132 ms
[2022-06-03 16:37:34] [INFO ] Decomposing Gal with order
[2022-06-03 16:37:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 16:37:34] [INFO ] Removed a total of 422 redundant transitions.
[2022-06-03 16:37:34] [INFO ] Flatten gal took : 264 ms
[2022-06-03 16:37:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 723 labels/synchronizations in 161 ms.
[2022-06-03 16:37:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11167780100083926516.gal : 45 ms
[2022-06-03 16:37:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17440492519771691144.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11167780100083926516.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17440492519771691144.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...300
Loading property file /tmp/ReachabilityCardinality17440492519771691144.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
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :2 after 47
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :47 after 79
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :79 after 2.70253e+09
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2.70253e+09 after 1.00503e+37
Detected timeout of ITS tools.
[2022-06-03 16:59:05] [INFO ] Flatten gal took : 116 ms
[2022-06-03 16:59:05] [INFO ] Input system was already deterministic with 810 transitions.
[2022-06-03 16:59:05] [INFO ] Transformed 960 places.
[2022-06-03 16:59:05] [INFO ] Transformed 810 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-03 16:59:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9548962058587678030.gal : 4 ms
[2022-06-03 16:59:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8876939863996979286.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9548962058587678030.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8876939863996979286.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--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...364
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/ReachabilityCardinality8876939863996979286.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :7 after 35
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :35 after 161
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :161 after 311
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :311 after 2257
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2257 after 3775
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :3775 after 27514
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :27514 after 3.22153e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3.22153e+06 after 5.68559e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :5.68559e+06 after 1.26701e+07
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.26701e+07 after 3.4805e+08
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :3.4805e+08 after 3.42025e+10
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :3.42025e+10 after 6.54189e+10
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :6.54189e+10 after 4.86988e+11
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :4.86988e+11 after 6.41682e+14
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :6.41682e+14 after 1.14228e+15
SDD proceeding with computation,1 properties remain. new max is 524288
SDD size :1.14228e+15 after 4.79087e+18

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ 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="ShieldPPPs-PT-030B"
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 ShieldPPPs-PT-030B, 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-165286025300478"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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