About the Execution of ITS-Tools for StigmergyCommit-PT-04b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
945.560 | 207825.00 | 315089.00 | 519.60 | TFFTTFFTTTTTFTFF | 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.r294-smll-165463872500135.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 StigmergyCommit-PT-04b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r294-smll-165463872500135
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.1K May 30 14:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 30 14:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 30 14:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 30 14:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 25 13:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 25 13:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 25 13:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 25 13:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 11K May 30 15:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K May 30 15:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 30 14:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K May 30 14:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 25 13:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 25 13:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 12:20 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 12:20 instance
-rw-r--r-- 1 mcc users 6 May 29 12:20 iscolored
-rw-r--r-- 1 mcc users 627K May 29 12:20 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 StigmergyCommit-PT-04b-ReachabilityFireability-00
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityFireability-01
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityFireability-02
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityFireability-03
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityFireability-04
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityFireability-05
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityFireability-06
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityFireability-07
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityFireability-08
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityFireability-09
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityFireability-10
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityFireability-11
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityFireability-12
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityFireability-13
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityFireability-14
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1654776423168
Running Version 202205111006
[2022-06-09 12:07:04] [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-09 12:07:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 12:07:05] [INFO ] Load time of PNML (sax parser for PT used): 353 ms
[2022-06-09 12:07:05] [INFO ] Transformed 1534 places.
[2022-06-09 12:07:05] [INFO ] Transformed 2136 transitions.
[2022-06-09 12:07:05] [INFO ] Found NUPN structural information;
[2022-06-09 12:07:05] [INFO ] Parsed PT model containing 1534 places and 2136 transitions in 545 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 108 resets, run finished after 876 ms. (steps per millisecond=11 ) properties (out of 16) seen :5
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 2136 rows 1534 cols
[2022-06-09 12:07:07] [INFO ] Computed 6 place invariants in 53 ms
[2022-06-09 12:07:09] [INFO ] [Real]Absence check using 6 positive place invariants in 34 ms returned sat
[2022-06-09 12:07:09] [INFO ] After 1351ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:10
[2022-06-09 12:07:10] [INFO ] [Nat]Absence check using 6 positive place invariants in 17 ms returned sat
[2022-06-09 12:07:14] [INFO ] After 3699ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :7
[2022-06-09 12:07:16] [INFO ] Deduced a trap composed of 397 places in 1339 ms of which 13 ms to minimize.
[2022-06-09 12:07:17] [INFO ] Deduced a trap composed of 399 places in 1058 ms of which 3 ms to minimize.
[2022-06-09 12:07:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 2613 ms
[2022-06-09 12:07:19] [INFO ] Deduced a trap composed of 398 places in 1115 ms of which 3 ms to minimize.
[2022-06-09 12:07:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 1213 ms
[2022-06-09 12:07:21] [INFO ] Deduced a trap composed of 399 places in 922 ms of which 2 ms to minimize.
[2022-06-09 12:07:22] [INFO ] Deduced a trap composed of 398 places in 733 ms of which 2 ms to minimize.
[2022-06-09 12:07:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2050 ms
[2022-06-09 12:07:24] [INFO ] Deduced a trap composed of 299 places in 1050 ms of which 2 ms to minimize.
[2022-06-09 12:07:25] [INFO ] Deduced a trap composed of 396 places in 700 ms of which 1 ms to minimize.
[2022-06-09 12:07:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2130 ms
[2022-06-09 12:07:25] [INFO ] After 14536ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :5
Attempting to minimize the solution found.
Minimization took 2111 ms.
[2022-06-09 12:07:27] [INFO ] After 17697ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :5
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 5 different solutions.
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 1481 ms.
Support contains 71 out of 1534 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1534/1534 places, 2136/2136 transitions.
Graph (trivial) has 1377 edges and 1534 vertex of which 91 / 1534 are part of one of the 14 SCC in 10 ms
Free SCC test removed 77 places
Drop transitions removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Graph (complete) has 2179 edges and 1457 vertex of which 1449 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.19 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 1013 transitions
Trivial Post-agglo rules discarded 1013 transitions
Performed 1013 trivial Post agglomeration. Transition count delta: 1013
Iterating post reduction 0 with 1017 rules applied. Total rules applied 1019 place count 1449 transition count 1018
Reduce places removed 1013 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 1038 rules applied. Total rules applied 2057 place count 436 transition count 993
Reduce places removed 11 places and 0 transitions.
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Iterating post reduction 2 with 54 rules applied. Total rules applied 2111 place count 425 transition count 950
Reduce places removed 43 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 46 rules applied. Total rules applied 2157 place count 382 transition count 947
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 64 Pre rules applied. Total rules applied 2157 place count 382 transition count 883
Deduced a syphon composed of 64 places in 2 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 4 with 128 rules applied. Total rules applied 2285 place count 318 transition count 883
Discarding 62 places :
Symmetric choice reduction at 4 with 62 rule applications. Total rules 2347 place count 256 transition count 821
Iterating global reduction 4 with 62 rules applied. Total rules applied 2409 place count 256 transition count 821
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2411 place count 256 transition count 819
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 2430 place count 237 transition count 791
Iterating global reduction 5 with 19 rules applied. Total rules applied 2449 place count 237 transition count 791
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2453 place count 237 transition count 787
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 2459 place count 231 transition count 781
Iterating global reduction 6 with 6 rules applied. Total rules applied 2465 place count 231 transition count 781
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 2470 place count 226 transition count 776
Iterating global reduction 6 with 5 rules applied. Total rules applied 2475 place count 226 transition count 776
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 2479 place count 226 transition count 772
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 7 with 40 rules applied. Total rules applied 2519 place count 206 transition count 752
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 2524 place count 201 transition count 747
Iterating global reduction 7 with 5 rules applied. Total rules applied 2529 place count 201 transition count 747
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2533 place count 197 transition count 743
Iterating global reduction 7 with 4 rules applied. Total rules applied 2537 place count 197 transition count 743
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2541 place count 193 transition count 739
Iterating global reduction 7 with 4 rules applied. Total rules applied 2545 place count 193 transition count 739
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 2557 place count 187 transition count 757
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 2560 place count 187 transition count 754
Free-agglomeration rule applied 30 times.
Iterating global reduction 8 with 30 rules applied. Total rules applied 2590 place count 187 transition count 724
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 8 with 30 rules applied. Total rules applied 2620 place count 157 transition count 724
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 2621 place count 157 transition count 723
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 2628 place count 157 transition count 723
Applied a total of 2628 rules in 603 ms. Remains 157 /1534 variables (removed 1377) and now considering 723/2136 (removed 1413) transitions.
Finished structural reductions, in 1 iterations. Remains : 157/1534 places, 723/2136 transitions.
Incomplete random walk after 1000000 steps, including 57465 resets, run finished after 15944 ms. (steps per millisecond=62 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 8279 resets, run finished after 2601 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 8282 resets, run finished after 2699 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Interrupted Best-First random walk after 779564 steps, including 6431 resets, run timeout after 5001 ms. (steps per millisecond=155 ) properties seen 0
Interrupted probabilistic random walk after 18671315 steps, run timeout after 78001 ms. (steps per millisecond=239 ) properties seen :{1=1}
Probabilistic random walk after 18671315 steps, saw 3107128 distinct states, run finished after 78005 ms. (steps per millisecond=239 ) properties seen :1
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 723 rows 157 cols
[2022-06-09 12:09:13] [INFO ] Computed 6 place invariants in 6 ms
[2022-06-09 12:09:14] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-06-09 12:09:14] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-09 12:09:14] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-06-09 12:09:14] [INFO ] After 519ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-09 12:09:14] [INFO ] State equation strengthened by 165 read => feed constraints.
[2022-06-09 12:09:15] [INFO ] After 417ms SMT Verify possible using 165 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-09 12:09:15] [INFO ] Deduced a trap composed of 45 places in 229 ms of which 1 ms to minimize.
[2022-06-09 12:09:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 273 ms
[2022-06-09 12:09:15] [INFO ] After 996ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 290 ms.
[2022-06-09 12:09:16] [INFO ] After 1902ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 127 ms.
Support contains 70 out of 157 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 157/157 places, 723/723 transitions.
Graph (trivial) has 5 edges and 157 vertex of which 2 / 157 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 156 transition count 720
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 155 transition count 719
Applied a total of 4 rules in 50 ms. Remains 155 /157 variables (removed 2) and now considering 719/723 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 155/157 places, 719/723 transitions.
Incomplete random walk after 1000000 steps, including 57335 resets, run finished after 11716 ms. (steps per millisecond=85 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 8270 resets, run finished after 1760 ms. (steps per millisecond=568 ) properties (out of 2) seen :0
Interrupted Best-First random walk after 952939 steps, including 7828 resets, run timeout after 5001 ms. (steps per millisecond=190 ) properties seen 0
Interrupted probabilistic random walk after 12558218 steps, run timeout after 54001 ms. (steps per millisecond=232 ) properties seen :{}
Probabilistic random walk after 12558218 steps, saw 2120335 distinct states, run finished after 54003 ms. (steps per millisecond=232 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 719 rows 155 cols
[2022-06-09 12:10:28] [INFO ] Computed 6 place invariants in 10 ms
[2022-06-09 12:10:28] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2022-06-09 12:10:28] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-09 12:10:28] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-06-09 12:10:29] [INFO ] After 545ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-09 12:10:29] [INFO ] State equation strengthened by 165 read => feed constraints.
[2022-06-09 12:10:29] [INFO ] After 422ms SMT Verify possible using 165 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-09 12:10:30] [INFO ] Deduced a trap composed of 42 places in 235 ms of which 1 ms to minimize.
[2022-06-09 12:10:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 283 ms
[2022-06-09 12:10:30] [INFO ] After 1016ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 312 ms.
[2022-06-09 12:10:30] [INFO ] After 1972ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 148 steps, including 9 resets, run visited all 2 properties in 3 ms. (steps per millisecond=49 )
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 4 ms.
All properties solved without resorting to model-checking.
Total runtime 205873 ms.
BK_STOP 1654776630993
--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination 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="StigmergyCommit-PT-04b"
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 StigmergyCommit-PT-04b, 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 r294-smll-165463872500135"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-04b.tgz
mv StigmergyCommit-PT-04b 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 '
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 ;