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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 720K
-rw-r--r-- 1 mcc users 7.9K Apr 29 18:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 29 18:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Apr 29 18:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Apr 29 18:39 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.7K May 9 08:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 29 19:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Apr 29 19:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 29 19:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Apr 29 19:11 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 212K 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-040A-ReachabilityFireability-00
FORMULA_NAME ShieldIIPt-PT-040A-ReachabilityFireability-01
FORMULA_NAME ShieldIIPt-PT-040A-ReachabilityFireability-02
FORMULA_NAME ShieldIIPt-PT-040A-ReachabilityFireability-03
FORMULA_NAME ShieldIIPt-PT-040A-ReachabilityFireability-04
FORMULA_NAME ShieldIIPt-PT-040A-ReachabilityFireability-05
FORMULA_NAME ShieldIIPt-PT-040A-ReachabilityFireability-06
FORMULA_NAME ShieldIIPt-PT-040A-ReachabilityFireability-07
FORMULA_NAME ShieldIIPt-PT-040A-ReachabilityFireability-08
FORMULA_NAME ShieldIIPt-PT-040A-ReachabilityFireability-09
FORMULA_NAME ShieldIIPt-PT-040A-ReachabilityFireability-10
FORMULA_NAME ShieldIIPt-PT-040A-ReachabilityFireability-11
FORMULA_NAME ShieldIIPt-PT-040A-ReachabilityFireability-12
FORMULA_NAME ShieldIIPt-PT-040A-ReachabilityFireability-13
FORMULA_NAME ShieldIIPt-PT-040A-ReachabilityFireability-14
FORMULA_NAME ShieldIIPt-PT-040A-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654269170729

Running Version 202205111006
[2022-06-03 15:12:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -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:12:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 15:12:52] [INFO ] Load time of PNML (sax parser for PT used): 131 ms
[2022-06-03 15:12:52] [INFO ] Transformed 763 places.
[2022-06-03 15:12:52] [INFO ] Transformed 563 transitions.
[2022-06-03 15:12:52] [INFO ] Found NUPN structural information;
[2022-06-03 15:12:52] [INFO ] Parsed PT model containing 763 places and 563 transitions in 249 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 771 ms. (steps per millisecond=12 ) properties (out of 16) seen :6
FORMULA ShieldIIPt-PT-040A-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040A-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040A-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040A-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040A-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040A-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 562 rows 763 cols
[2022-06-03 15:12:54] [INFO ] Computed 361 place invariants in 26 ms
[2022-06-03 15:12:54] [INFO ] After 578ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-06-03 15:12:55] [INFO ] [Nat]Absence check using 361 positive place invariants in 91 ms returned sat
[2022-06-03 15:12:57] [INFO ] After 1774ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2022-06-03 15:12:59] [INFO ] After 3638ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 2869 ms.
[2022-06-03 15:13:01] [INFO ] After 7062ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
FORMULA ShieldIIPt-PT-040A-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-040A-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-040A-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-040A-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-040A-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-040A-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-040A-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 7 properties in 43666 ms.
Support contains 187 out of 763 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 763/763 places, 562/562 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 763 transition count 561
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 762 transition count 561
Partial Free-agglomeration rule applied 52 times.
Drop transitions removed 52 transitions
Iterating global reduction 0 with 52 rules applied. Total rules applied 54 place count 762 transition count 561
Applied a total of 54 rules in 152 ms. Remains 762 /763 variables (removed 1) and now considering 561/562 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 762/763 places, 561/562 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 20571 ms. (steps per millisecond=48 ) properties (out of 3) seen :0
Interrupted Best-First random walk after 750545 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=150 ) properties seen 0
Interrupted Best-First random walk after 580197 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=116 ) properties seen 0
Interrupted Best-First random walk after 753459 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=150 ) properties seen 0
Probabilistic random walk exhausted memory after 3038964 steps, saw 2926327 distinct states, run finished after 79132 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 561 rows 762 cols
[2022-06-03 15:15:40] [INFO ] Computed 361 place invariants in 10 ms
[2022-06-03 15:15:40] [INFO ] After 212ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-03 15:15:41] [INFO ] [Nat]Absence check using 361 positive place invariants in 58 ms returned sat
[2022-06-03 15:15:42] [INFO ] After 829ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-03 15:15:42] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-06-03 15:15:42] [INFO ] After 726ms SMT Verify possible using 23 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-06-03 15:15:43] [INFO ] After 1536ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 505 ms.
[2022-06-03 15:15:44] [INFO ] After 3172ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 11519 ms.
Support contains 187 out of 762 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 762/762 places, 561/561 transitions.
Applied a total of 0 rules in 38 ms. Remains 762 /762 variables (removed 0) and now considering 561/561 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 762/762 places, 561/561 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 762/762 places, 561/561 transitions.
Applied a total of 0 rules in 36 ms. Remains 762 /762 variables (removed 0) and now considering 561/561 (removed 0) transitions.
// Phase 1: matrix 561 rows 762 cols
[2022-06-03 15:15:55] [INFO ] Computed 361 place invariants in 6 ms
[2022-06-03 15:15:56] [INFO ] Implicit Places using invariants in 467 ms returned [753]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 476 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 761/762 places, 561/561 transitions.
Applied a total of 0 rules in 24 ms. Remains 761 /761 variables (removed 0) and now considering 561/561 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 761/762 places, 561/561 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 20627 ms. (steps per millisecond=48 ) properties (out of 3) seen :0
Interrupted Best-First random walk after 749663 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=149 ) properties seen 0
Interrupted Best-First random walk after 554953 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=110 ) properties seen 0
Interrupted Best-First random walk after 750327 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=150 ) properties seen 0
Probabilistic random walk exhausted memory after 3046595 steps, saw 2942151 distinct states, run finished after 86595 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 561 rows 761 cols
[2022-06-03 15:17:58] [INFO ] Computed 360 place invariants in 6 ms
[2022-06-03 15:17:58] [INFO ] After 218ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-03 15:17:58] [INFO ] [Nat]Absence check using 360 positive place invariants in 62 ms returned sat
[2022-06-03 15:17:59] [INFO ] After 971ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-03 15:17:59] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-06-03 15:18:00] [INFO ] After 689ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-06-03 15:18:01] [INFO ] After 1360ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 816 ms.
[2022-06-03 15:18:02] [INFO ] After 3420ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
FORMULA ShieldIIPt-PT-040A-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 6419 ms.
Support contains 157 out of 761 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 761/761 places, 561/561 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 760 transition count 560
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 9 place count 760 transition count 560
Applied a total of 9 rules in 48 ms. Remains 760 /761 variables (removed 1) and now considering 560/561 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 760/761 places, 560/561 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 11598 ms. (steps per millisecond=86 ) properties (out of 2) seen :0
Interrupted Best-First random walk after 828033 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=165 ) properties seen 0
Interrupted Best-First random walk after 623715 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=124 ) properties seen 0
Probabilistic random walk exhausted memory after 3071047 steps, saw 2944944 distinct states, run finished after 54452 ms. (steps per millisecond=56 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 560 rows 760 cols
[2022-06-03 15:19:24] [INFO ] Computed 360 place invariants in 4 ms
[2022-06-03 15:19:24] [INFO ] After 161ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 15:19:25] [INFO ] [Nat]Absence check using 360 positive place invariants in 52 ms returned sat
[2022-06-03 15:19:25] [INFO ] After 658ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 15:19:25] [INFO ] State equation strengthened by 29 read => feed constraints.
[2022-06-03 15:19:26] [INFO ] After 647ms SMT Verify possible using 29 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-03 15:19:27] [INFO ] After 1148ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 481 ms.
[2022-06-03 15:19:27] [INFO ] After 2516ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4878 ms.
Support contains 157 out of 760 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 760/760 places, 560/560 transitions.
Applied a total of 0 rules in 18 ms. Remains 760 /760 variables (removed 0) and now considering 560/560 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 760/760 places, 560/560 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 760/760 places, 560/560 transitions.
Applied a total of 0 rules in 17 ms. Remains 760 /760 variables (removed 0) and now considering 560/560 (removed 0) transitions.
// Phase 1: matrix 560 rows 760 cols
[2022-06-03 15:19:32] [INFO ] Computed 360 place invariants in 7 ms
[2022-06-03 15:19:32] [INFO ] Implicit Places using invariants in 386 ms returned [753]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 388 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 759/760 places, 560/560 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 759 transition count 559
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 758 transition count 559
Applied a total of 2 rules in 32 ms. Remains 758 /759 variables (removed 1) and now considering 559/560 (removed 1) transitions.
// Phase 1: matrix 559 rows 758 cols
[2022-06-03 15:19:32] [INFO ] Computed 359 place invariants in 4 ms
[2022-06-03 15:19:33] [INFO ] Implicit Places using invariants in 406 ms returned [747]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 408 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 757/760 places, 559/560 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 756 transition count 558
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 756 transition count 558
Applied a total of 2 rules in 51 ms. Remains 756 /757 variables (removed 1) and now considering 558/559 (removed 1) transitions.
// Phase 1: matrix 558 rows 756 cols
[2022-06-03 15:19:33] [INFO ] Computed 358 place invariants in 7 ms
[2022-06-03 15:19:33] [INFO ] Implicit Places using invariants in 318 ms returned []
// Phase 1: matrix 558 rows 756 cols
[2022-06-03 15:19:33] [INFO ] Computed 358 place invariants in 7 ms
[2022-06-03 15:19:33] [INFO ] State equation strengthened by 27 read => feed constraints.
[2022-06-03 15:19:34] [INFO ] Implicit Places using invariants and state equation in 913 ms returned []
Implicit Place search using SMT with State Equation took 1233 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 756/760 places, 558/560 transitions.
Finished structural reductions, in 3 iterations. Remains : 756/760 places, 558/560 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 13315 ms. (steps per millisecond=75 ) properties (out of 2) seen :0
Interrupted Best-First random walk after 802899 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=160 ) properties seen 0
Interrupted Best-First random walk after 621787 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=124 ) properties seen 0
Probabilistic random walk exhausted memory after 3086389 steps, saw 2960961 distinct states, run finished after 53249 ms. (steps per millisecond=57 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 558 rows 756 cols
[2022-06-03 15:20:51] [INFO ] Computed 358 place invariants in 3 ms
[2022-06-03 15:20:51] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 15:20:51] [INFO ] [Nat]Absence check using 358 positive place invariants in 52 ms returned sat
[2022-06-03 15:20:52] [INFO ] After 741ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 15:20:52] [INFO ] State equation strengthened by 27 read => feed constraints.
[2022-06-03 15:20:52] [INFO ] After 473ms SMT Verify possible using 27 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-03 15:20:53] [INFO ] After 968ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 541 ms.
[2022-06-03 15:20:53] [INFO ] After 2499ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4068 ms.
Support contains 157 out of 756 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 756/756 places, 558/558 transitions.
Applied a total of 0 rules in 26 ms. Remains 756 /756 variables (removed 0) and now considering 558/558 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 756/756 places, 558/558 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 756/756 places, 558/558 transitions.
Applied a total of 0 rules in 16 ms. Remains 756 /756 variables (removed 0) and now considering 558/558 (removed 0) transitions.
// Phase 1: matrix 558 rows 756 cols
[2022-06-03 15:20:57] [INFO ] Computed 358 place invariants in 2 ms
[2022-06-03 15:20:58] [INFO ] Implicit Places using invariants in 324 ms returned []
// Phase 1: matrix 558 rows 756 cols
[2022-06-03 15:20:58] [INFO ] Computed 358 place invariants in 2 ms
[2022-06-03 15:20:58] [INFO ] State equation strengthened by 27 read => feed constraints.
[2022-06-03 15:20:59] [INFO ] Implicit Places using invariants and state equation in 920 ms returned []
Implicit Place search using SMT with State Equation took 1245 ms to find 0 implicit places.
[2022-06-03 15:20:59] [INFO ] Redundant transitions in 40 ms returned []
// Phase 1: matrix 558 rows 756 cols
[2022-06-03 15:20:59] [INFO ] Computed 358 place invariants in 2 ms
[2022-06-03 15:20:59] [INFO ] Dead Transitions using invariants and state equation in 316 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 756/756 places, 558/558 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 12312 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Interrupted Best-First random walk after 804474 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=160 ) properties seen 0
Interrupted Best-First random walk after 612399 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=122 ) properties seen 0
Probabilistic random walk exhausted memory after 3086603 steps, saw 2961160 distinct states, run finished after 53820 ms. (steps per millisecond=57 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 558 rows 756 cols
[2022-06-03 15:22:15] [INFO ] Computed 358 place invariants in 3 ms
[2022-06-03 15:22:15] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 15:22:16] [INFO ] [Nat]Absence check using 358 positive place invariants in 53 ms returned sat
[2022-06-03 15:22:16] [INFO ] After 756ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 15:22:16] [INFO ] State equation strengthened by 27 read => feed constraints.
[2022-06-03 15:22:17] [INFO ] After 467ms SMT Verify possible using 27 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-03 15:22:17] [INFO ] After 953ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 519 ms.
[2022-06-03 15:22:18] [INFO ] After 2449ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4154 ms.
Support contains 157 out of 756 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 756/756 places, 558/558 transitions.
Applied a total of 0 rules in 19 ms. Remains 756 /756 variables (removed 0) and now considering 558/558 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 756/756 places, 558/558 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 756/756 places, 558/558 transitions.
Applied a total of 0 rules in 22 ms. Remains 756 /756 variables (removed 0) and now considering 558/558 (removed 0) transitions.
// Phase 1: matrix 558 rows 756 cols
[2022-06-03 15:22:22] [INFO ] Computed 358 place invariants in 4 ms
[2022-06-03 15:22:22] [INFO ] Implicit Places using invariants in 334 ms returned []
// Phase 1: matrix 558 rows 756 cols
[2022-06-03 15:22:22] [INFO ] Computed 358 place invariants in 7 ms
[2022-06-03 15:22:23] [INFO ] State equation strengthened by 27 read => feed constraints.
[2022-06-03 15:22:23] [INFO ] Implicit Places using invariants and state equation in 940 ms returned []
Implicit Place search using SMT with State Equation took 1276 ms to find 0 implicit places.
[2022-06-03 15:22:23] [INFO ] Redundant transitions in 18 ms returned []
// Phase 1: matrix 558 rows 756 cols
[2022-06-03 15:22:23] [INFO ] Computed 358 place invariants in 2 ms
[2022-06-03 15:22:24] [INFO ] Dead Transitions using invariants and state equation in 341 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 756/756 places, 558/558 transitions.
Partial Free-agglomeration rule applied 20 times.
Drop transitions removed 20 transitions
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 756 transition count 558
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 756 transition count 538
Applied a total of 40 rules in 57 ms. Remains 756 /756 variables (removed 0) and now considering 538/558 (removed 20) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 538 rows 756 cols
[2022-06-03 15:22:24] [INFO ] Computed 358 place invariants in 1 ms
[2022-06-03 15:22:24] [INFO ] After 177ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 15:22:24] [INFO ] [Nat]Absence check using 358 positive place invariants in 50 ms returned sat
[2022-06-03 15:22:25] [INFO ] After 644ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 15:22:25] [INFO ] After 1122ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 490 ms.
[2022-06-03 15:22:26] [INFO ] After 1887ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-06-03 15:22:26] [INFO ] Flatten gal took : 150 ms
[2022-06-03 15:22:26] [INFO ] Flatten gal took : 69 ms
[2022-06-03 15:22:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11578117869888390310.gal : 22 ms
[2022-06-03 15:22:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2079075362794747833.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/ReachabilityCardinality11578117869888390310.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2079075362794747833.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/ReachabilityCardinality2079075362794747833.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :3 after 6
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :6 after 14
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :14 after 27
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :27 after 53
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :53 after 102
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :102 after 349
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :349 after 10856
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :10856 after 245043
Detected timeout of ITS tools.
[2022-06-03 15:22:41] [INFO ] Flatten gal took : 48 ms
[2022-06-03 15:22:41] [INFO ] Applying decomposition
[2022-06-03 15:22:41] [INFO ] Flatten gal took : 44 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/graph17680189444999111532.txt' '-o' '/tmp/graph17680189444999111532.bin' '-w' '/tmp/graph17680189444999111532.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17680189444999111532.bin' '-l' '-1' '-v' '-w' '/tmp/graph17680189444999111532.weights' '-q' '0' '-e' '0.001'
[2022-06-03 15:22:42] [INFO ] Decomposing Gal with order
[2022-06-03 15:22:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 15:22:42] [INFO ] Removed a total of 149 redundant transitions.
[2022-06-03 15:22:42] [INFO ] Flatten gal took : 125 ms
[2022-06-03 15:22:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 40 ms.
[2022-06-03 15:22:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6789292069841301693.gal : 33 ms
[2022-06-03 15:22:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10433754628461765580.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/ReachabilityCardinality6789292069841301693.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10433754628461765580.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/ReachabilityCardinality10433754628461765580.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :34817 after 34817
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :34817 after 34817
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :34817 after 69633
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9799531357541749525
[2022-06-03 15:22:57] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9799531357541749525
Running compilation step : cd /tmp/ltsmin9799531357541749525;'/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 1118 ms.
Running link step : cd /tmp/ltsmin9799531357541749525;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin9799531357541749525;'/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' 'ShieldIIPtPT040AReachabilityFireability04==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-03 15:23:12] [INFO ] Flatten gal took : 39 ms
Using solver Z3 to compute partial order matrices.
[2022-06-03 15:23:12] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin8265128439186409228
[2022-06-03 15:23:12] [INFO ] Computing symmetric may disable matrix : 558 transitions.
[2022-06-03 15:23:12] [INFO ] Computation of Complete disable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 15:23:12] [INFO ] Computing symmetric may enable matrix : 558 transitions.
[2022-06-03 15:23:12] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 15:23:12] [INFO ] Flatten gal took : 69 ms
[2022-06-03 15:23:12] [INFO ] Flatten gal took : 106 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/graph5853771573327009269.txt' '-o' '/tmp/graph5853771573327009269.bin' '-w' '/tmp/graph5853771573327009269.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5853771573327009269.bin' '-l' '-1' '-v' '-w' '/tmp/graph5853771573327009269.weights' '-q' '0' '-e' '0.001'
[2022-06-03 15:23:13] [INFO ] Decomposing Gal with order
[2022-06-03 15:23:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 15:23:13] [INFO ] Input system was already deterministic with 558 transitions.
[2022-06-03 15:23:13] [INFO ] Removed a total of 150 redundant transitions.
[2022-06-03 15:23:13] [INFO ] Computing Do-Not-Accords matrix : 558 transitions.
[2022-06-03 15:23:13] [INFO ] Flatten gal took : 47 ms
[2022-06-03 15:23:13] [INFO ] Computation of Completed DNA matrix. took 55 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 15:23:13] [INFO ] Built C files in 344ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8265128439186409228
Running compilation step : cd /tmp/ltsmin8265128439186409228;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' '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:23:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 37 ms.
[2022-06-03 15:23:13] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability193721257179562925.gal : 7 ms
[2022-06-03 15:23:13] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability3678267946224877060.prop : 3 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/ReachabilityFireability193721257179562925.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability3678267946224877060.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...297
Loading property file /tmp/ReachabilityFireability3678267946224877060.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 32
[2022-06-03 15:23:13] [INFO ] Ran tautology test, simplified 0 / 2 in 469 ms.
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :32 after 32
[2022-06-03 15:23:13] [INFO ] BMC solution for property ShieldIIPt-PT-040A-ReachabilityFireability-04(UNSAT) depth K=0 took 13 ms
[2022-06-03 15:23:13] [INFO ] BMC solution for property ShieldIIPt-PT-040A-ReachabilityFireability-07(UNSAT) depth K=0 took 1 ms
[2022-06-03 15:23:13] [INFO ] BMC solution for property ShieldIIPt-PT-040A-ReachabilityFireability-04(UNSAT) depth K=1 took 6 ms
[2022-06-03 15:23:13] [INFO ] BMC solution for property ShieldIIPt-PT-040A-ReachabilityFireability-07(UNSAT) depth K=1 took 6 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 558 rows 756 cols
[2022-06-03 15:23:13] [INFO ] Computed 358 place invariants in 2 ms
[2022-06-03 15:23:13] [INFO ] Computed 358 place invariants in 3 ms
Compilation finished in 1738 ms.
Running link step : cd /tmp/ltsmin8265128439186409228;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 76 ms.
Running LTSmin : cd /tmp/ltsmin8265128439186409228;'/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' 'ShieldIIPtPT040AReachabilityFireability04==true'
[2022-06-03 15:23:16] [INFO ] BMC solution for property ShieldIIPt-PT-040A-ReachabilityFireability-04(UNSAT) depth K=2 took 2618 ms
[2022-06-03 15:23:16] [INFO ] BMC solution for property ShieldIIPt-PT-040A-ReachabilityFireability-07(UNSAT) depth K=2 took 17 ms
[2022-06-03 15:23:16] [INFO ] BMC solution for property ShieldIIPt-PT-040A-ReachabilityFireability-04(UNSAT) depth K=3 took 227 ms
[2022-06-03 15:23:16] [INFO ] BMC solution for property ShieldIIPt-PT-040A-ReachabilityFireability-07(UNSAT) depth K=3 took 8 ms
[2022-06-03 15:23:17] [INFO ] BMC solution for property ShieldIIPt-PT-040A-ReachabilityFireability-04(UNSAT) depth K=4 took 1642 ms
[2022-06-03 15:23:19] [INFO ] BMC solution for property ShieldIIPt-PT-040A-ReachabilityFireability-07(UNSAT) depth K=4 took 1727 ms
[2022-06-03 15:23:20] [INFO ] Proved 756 variables to be positive in 6618 ms
[2022-06-03 15:23:20] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPt-PT-040A-ReachabilityFireability-04
[2022-06-03 15:23:20] [INFO ] KInduction solution for property ShieldIIPt-PT-040A-ReachabilityFireability-04(SAT) depth K=0 took 342 ms
[2022-06-03 15:23:20] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPt-PT-040A-ReachabilityFireability-07
[2022-06-03 15:23:20] [INFO ] KInduction solution for property ShieldIIPt-PT-040A-ReachabilityFireability-07(SAT) depth K=0 took 316 ms
[2022-06-03 15:23:22] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPt-PT-040A-ReachabilityFireability-04
[2022-06-03 15:23:22] [INFO ] KInduction solution for property ShieldIIPt-PT-040A-ReachabilityFireability-04(SAT) depth K=1 took 1007 ms
[2022-06-03 15:23:22] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPt-PT-040A-ReachabilityFireability-07
[2022-06-03 15:23:22] [INFO ] KInduction solution for property ShieldIIPt-PT-040A-ReachabilityFireability-07(SAT) depth K=1 took 730 ms
[2022-06-03 15:23:32] [INFO ] BMC solution for property ShieldIIPt-PT-040A-ReachabilityFireability-04(UNSAT) depth K=5 took 13235 ms
[2022-06-03 15:23:42] [INFO ] BMC solution for property ShieldIIPt-PT-040A-ReachabilityFireability-07(UNSAT) depth K=5 took 9341 ms
[2022-06-03 15:24:53] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPt-PT-040A-ReachabilityFireability-04
[2022-06-03 15:24:53] [INFO ] KInduction solution for property ShieldIIPt-PT-040A-ReachabilityFireability-04(SAT) depth K=2 took 90882 ms
Reachability property ShieldIIPt-PT-040A-ReachabilityFireability-07 is true.
FORMULA ShieldIIPt-PT-040A-ReachabilityFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldIIPt-PT-040A-ReachabilityFireability-04 is true.
FORMULA ShieldIIPt-PT-040A-ReachabilityFireability-04 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 9 fixpoint passes
[2022-06-03 15:25:03] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPt-PT-040A-ReachabilityFireability-07
[2022-06-03 15:25:03] [INFO ] KInduction solution for property ShieldIIPt-PT-040A-ReachabilityFireability-07(SAT) depth K=2 took 9875 ms
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,3.63258e+107,47.7501,983164,778,43,2.08455e+06,240,652,6.04846e+06,57,762,0
Total reachable state count : 3.632583213931877205740367998201693268246e+107

Verifying 2 reachability properties.
Reachability property ShieldIIPt-PT-040A-ReachabilityFireability-04 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-040A-ReachabilityFireability-04,4.54275e+103,47.9433,983164,205,26,2.08455e+06,240,873,6.04846e+06,71,762,0
Reachability property ShieldIIPt-PT-040A-ReachabilityFireability-07 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-040A-ReachabilityFireability-07,2.34161e+94,48.6064,983164,290,31,2.08455e+06,240,1355,6.04846e+06,74,762,0
[2022-06-03 15:25:24] [WARNING] Interrupting SMT solver.
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.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:25:24] [WARNING] Unexpected error occurred while running SMT. Was verifying ShieldIIPt-PT-040A-ReachabilityFireability-04 SMT depth 6
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.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 "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
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:25:24] [INFO ] During BMC, SMT solver timed out at depth 6
[2022-06-03 15:25:24] [INFO ] BMC solving timed out (3600000 secs) at depth 6
[2022-06-03 15:25:24] [INFO ] SMT solved 0/ 2 properties. Interrupting SMT analysis.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 752342 ms.

BK_STOP 1654269924362

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

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