Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r550-tall-171734898900253.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is FireWire-PT-11, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734898900253
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 6.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 7.7K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 125K Jun 2 16:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FireWire-PT-11-UpperBounds-00
FORMULA_NAME FireWire-PT-11-UpperBounds-01
FORMULA_NAME FireWire-PT-11-UpperBounds-02
FORMULA_NAME FireWire-PT-11-UpperBounds-03
FORMULA_NAME FireWire-PT-11-UpperBounds-04
FORMULA_NAME FireWire-PT-11-UpperBounds-05
FORMULA_NAME FireWire-PT-11-UpperBounds-06
FORMULA_NAME FireWire-PT-11-UpperBounds-07
FORMULA_NAME FireWire-PT-11-UpperBounds-08
FORMULA_NAME FireWire-PT-11-UpperBounds-09
FORMULA_NAME FireWire-PT-11-UpperBounds-10
FORMULA_NAME FireWire-PT-11-UpperBounds-11
FORMULA_NAME FireWire-PT-11-UpperBounds-12
FORMULA_NAME FireWire-PT-11-UpperBounds-13
FORMULA_NAME FireWire-PT-11-UpperBounds-14
FORMULA_NAME FireWire-PT-11-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717362771177

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-11
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-06-02 21:12:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 21:12:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:12:52] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2024-06-02 21:12:52] [INFO ] Transformed 169 places.
[2024-06-02 21:12:52] [INFO ] Transformed 508 transitions.
[2024-06-02 21:12:52] [INFO ] Found NUPN structural information;
[2024-06-02 21:12:52] [INFO ] Parsed PT model containing 169 places and 508 transitions and 1883 arcs in 182 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 65 transitions
Reduce redundant transitions removed 65 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-02 21:12:52] [INFO ] Flow matrix only has 405 transitions (discarded 38 similar events)
// Phase 1: matrix 405 rows 169 cols
[2024-06-02 21:12:52] [INFO ] Computed 10 invariants in 19 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (266 resets) in 48 ms. (204 steps per ms)
FORMULA FireWire-PT-11-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-11-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-11-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-11-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-11-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-11-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-11-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-11-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-11-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-11-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-11-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-11-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-11-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30003 steps (158 resets) in 31 ms. (937 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-06-02 21:12:52] [INFO ] Flow matrix only has 405 transitions (discarded 38 similar events)
[2024-06-02 21:12:52] [INFO ] Invariant cache hit.
[2024-06-02 21:12:52] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-02 21:12:52] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2024-06-02 21:12:52] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 21:12:53] [INFO ] [Real]Added 58 Read/Feed constraints in 15 ms returned sat
[2024-06-02 21:12:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:12:53] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-02 21:12:53] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2024-06-02 21:12:53] [INFO ] [Nat]Added 58 Read/Feed constraints in 25 ms returned sat
[2024-06-02 21:12:53] [INFO ] Computed and/alt/rep : 172/623/172 causal constraints (skipped 232 transitions) in 55 ms.
[2024-06-02 21:12:53] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 10 ms to minimize.
[2024-06-02 21:12:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2024-06-02 21:12:53] [INFO ] Added : 57 causal constraints over 13 iterations in 569 ms. Result :sat
Minimization took 244 ms.
[2024-06-02 21:12:54] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-02 21:12:54] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2024-06-02 21:12:54] [INFO ] [Real]Added 58 Read/Feed constraints in 32 ms returned sat
[2024-06-02 21:12:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:12:54] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-02 21:12:54] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2024-06-02 21:12:54] [INFO ] [Nat]Added 58 Read/Feed constraints in 35 ms returned sat
[2024-06-02 21:12:54] [INFO ] Computed and/alt/rep : 172/623/172 causal constraints (skipped 232 transitions) in 38 ms.
[2024-06-02 21:12:54] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 2 ms to minimize.
[2024-06-02 21:12:55] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 1 ms to minimize.
[2024-06-02 21:12:55] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 1 ms to minimize.
[2024-06-02 21:12:55] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 2 ms to minimize.
[2024-06-02 21:12:55] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 490 ms
[2024-06-02 21:12:55] [INFO ] Added : 49 causal constraints over 11 iterations in 875 ms. Result :sat
Minimization took 189 ms.
[2024-06-02 21:12:55] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-02 21:12:55] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2024-06-02 21:12:55] [INFO ] [Real]Added 58 Read/Feed constraints in 16 ms returned sat
[2024-06-02 21:12:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:12:55] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-02 21:12:55] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2024-06-02 21:12:55] [INFO ] [Nat]Added 58 Read/Feed constraints in 29 ms returned sat
[2024-06-02 21:12:55] [INFO ] Computed and/alt/rep : 172/623/172 causal constraints (skipped 232 transitions) in 55 ms.
[2024-06-02 21:12:56] [INFO ] Added : 40 causal constraints over 10 iterations in 287 ms. Result :sat
Minimization took 146 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
FORMULA FireWire-PT-11-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 169 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 443/443 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 169 transition count 440
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 3 place count 169 transition count 434
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 15 place count 163 transition count 434
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 160 transition count 428
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 160 transition count 428
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 27 place count 157 transition count 437
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 33 place count 157 transition count 431
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 42 place count 157 transition count 422
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 48 place count 157 transition count 431
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 63 place count 151 transition count 422
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 69 place count 151 transition count 416
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 70 place count 150 transition count 415
Applied a total of 70 rules in 113 ms. Remains 150 /169 variables (removed 19) and now considering 415/443 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 150/169 places, 415/443 transitions.
[2024-06-02 21:12:56] [INFO ] Flow matrix only has 378 transitions (discarded 37 similar events)
// Phase 1: matrix 378 rows 150 cols
[2024-06-02 21:12:56] [INFO ] Computed 10 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (32244 resets) in 1523 ms. (656 steps per ms)
BEST_FIRST walk for 2000002 steps (13624 resets) in 930 ms. (2148 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-06-02 21:12:59] [INFO ] Flow matrix only has 378 transitions (discarded 37 similar events)
[2024-06-02 21:12:59] [INFO ] Invariant cache hit.
[2024-06-02 21:12:59] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 21:12:59] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2024-06-02 21:12:59] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 21:12:59] [INFO ] [Real]Added 56 Read/Feed constraints in 12 ms returned sat
[2024-06-02 21:12:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:12:59] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 21:12:59] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-06-02 21:12:59] [INFO ] [Nat]Added 56 Read/Feed constraints in 31 ms returned sat
[2024-06-02 21:12:59] [INFO ] Computed and/alt/rep : 157/575/157 causal constraints (skipped 215 transitions) in 27 ms.
[2024-06-02 21:12:59] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-06-02 21:12:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2024-06-02 21:12:59] [INFO ] Added : 16 causal constraints over 4 iterations in 204 ms. Result :sat
Minimization took 144 ms.
[2024-06-02 21:12:59] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 21:12:59] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2024-06-02 21:12:59] [INFO ] [Real]Added 56 Read/Feed constraints in 10 ms returned sat
[2024-06-02 21:12:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:12:59] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 21:13:00] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2024-06-02 21:13:00] [INFO ] [Nat]Added 56 Read/Feed constraints in 24 ms returned sat
[2024-06-02 21:13:00] [INFO ] Computed and/alt/rep : 157/575/157 causal constraints (skipped 215 transitions) in 37 ms.
[2024-06-02 21:13:00] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2024-06-02 21:13:00] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
[2024-06-02 21:13:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 132 ms
[2024-06-02 21:13:00] [INFO ] Added : 33 causal constraints over 9 iterations in 360 ms. Result :sat
Minimization took 151 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 415/415 transitions.
Applied a total of 0 rules in 9 ms. Remains 150 /150 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 150/150 places, 415/415 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 415/415 transitions.
Applied a total of 0 rules in 9 ms. Remains 150 /150 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-06-02 21:13:00] [INFO ] Flow matrix only has 378 transitions (discarded 37 similar events)
[2024-06-02 21:13:00] [INFO ] Invariant cache hit.
[2024-06-02 21:13:00] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-02 21:13:00] [INFO ] Flow matrix only has 378 transitions (discarded 37 similar events)
[2024-06-02 21:13:00] [INFO ] Invariant cache hit.
[2024-06-02 21:13:00] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 21:13:00] [INFO ] Implicit Places using invariants and state equation in 240 ms returned [56, 102, 148]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 327 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 147/150 places, 415/415 transitions.
Applied a total of 0 rules in 10 ms. Remains 147 /147 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 357 ms. Remains : 147/150 places, 415/415 transitions.
[2024-06-02 21:13:00] [INFO ] Flow matrix only has 378 transitions (discarded 37 similar events)
// Phase 1: matrix 378 rows 147 cols
[2024-06-02 21:13:00] [INFO ] Computed 7 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (32089 resets) in 1442 ms. (693 steps per ms)
FORMULA FireWire-PT-11-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-11-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (6767 resets) in 436 ms. (2288 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2024-06-02 21:13:03] [INFO ] Flatten gal took : 68 ms
[2024-06-02 21:13:03] [INFO ] Flatten gal took : 27 ms
[2024-06-02 21:13:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1279488270127324327.gal : 47 ms
[2024-06-02 21:13:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17493104135854127609.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1279488270127324327.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17493104135854127609.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 10934 ms.

BK_STOP 1717362783267

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="FireWire-PT-11"
export BK_EXAMINATION="UpperBounds"
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-5568"
echo " Executing tool itstools"
echo " Input is FireWire-PT-11, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r550-tall-171734898900253"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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