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.r312-tall-171662337800076.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 QuasiCertifProtocol-PT-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-171662337800076
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 20K Apr 13 03:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 13 03:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 13 03:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 101K Apr 13 03:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 16K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 54K Apr 13 04:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 429K Apr 13 04:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 13 04:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K Apr 13 04:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.4K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 149K May 18 16:43 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 QuasiCertifProtocol-PT-10-LTLFireability-00
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-01
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-02
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-03
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-04
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-05
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-06
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-07
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-08
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-09
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-10
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-11
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-12
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-13
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-14
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716664893176

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-25 19:21:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 19:21:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 19:21:34] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2024-05-25 19:21:34] [INFO ] Transformed 550 places.
[2024-05-25 19:21:34] [INFO ] Transformed 176 transitions.
[2024-05-25 19:21:34] [INFO ] Parsed PT model containing 550 places and 176 transitions and 1287 arcs in 184 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 217 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 176/176 transitions.
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 524 transition count 176
Applied a total of 26 rules in 55 ms. Remains 524 /550 variables (removed 26) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 524 cols
[2024-05-25 19:21:34] [INFO ] Computed 350 invariants in 36 ms
[2024-05-25 19:21:35] [INFO ] Implicit Places using invariants in 557 ms returned []
[2024-05-25 19:21:35] [INFO ] Invariant cache hit.
[2024-05-25 19:21:35] [INFO ] Implicit Places using invariants and state equation in 527 ms returned [303, 304, 311, 312, 313, 315, 316, 317, 318, 355]
Discarding 10 places :
Implicit Place search using SMT with State Equation took 1124 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 514/550 places, 176/176 transitions.
Applied a total of 0 rules in 8 ms. Remains 514 /514 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1206 ms. Remains : 514/550 places, 176/176 transitions.
Support contains 217 out of 514 places after structural reductions.
[2024-05-25 19:21:36] [INFO ] Flatten gal took : 55 ms
[2024-05-25 19:21:36] [INFO ] Flatten gal took : 29 ms
[2024-05-25 19:21:36] [INFO ] Input system was already deterministic with 176 transitions.
RANDOM walk for 40000 steps (2768 resets) in 1765 ms. (22 steps per ms) remains 14/17 properties
BEST_FIRST walk for 40004 steps (324 resets) in 184 ms. (216 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (315 resets) in 163 ms. (243 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (243 resets) in 119 ms. (333 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (315 resets) in 115 ms. (344 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (240 resets) in 295 ms. (135 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (326 resets) in 217 ms. (183 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (327 resets) in 60 ms. (655 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (322 resets) in 53 ms. (740 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (328 resets) in 75 ms. (526 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (328 resets) in 76 ms. (519 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (324 resets) in 46 ms. (851 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (323 resets) in 193 ms. (206 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (235 resets) in 47 ms. (833 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (236 resets) in 59 ms. (666 steps per ms) remains 14/14 properties
// Phase 1: matrix 176 rows 514 cols
[2024-05-25 19:21:37] [INFO ] Computed 340 invariants in 7 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 144/359 variables, 140/240 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/359 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 98/457 variables, 90/330 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 172/629 variables, 457/787 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/629 variables, 0/787 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem AtomicPropp10 is UNSAT
At refinement iteration 8 (OVERLAPS) 60/689 variables, 56/843 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/689 variables, 10/853 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/689 variables, 0/853 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 1/690 variables, 1/854 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/690 variables, 0/854 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 0/690 variables, 0/854 constraints. Problems are: Problem set: 1 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 690/690 variables, and 854 constraints, problems are : Problem set: 1 solved, 13 unsolved in 1654 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 100/100 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/100 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 144/359 variables, 140/240 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/359 variables, 0/240 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 98/457 variables, 90/330 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/330 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 172/629 variables, 457/787 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/629 variables, 4/791 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/629 variables, 0/791 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 60/689 variables, 56/847 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/689 variables, 10/857 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/689 variables, 9/866 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/689 variables, 0/866 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 1/690 variables, 1/867 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/690 variables, 0/867 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 15 (OVERLAPS) 0/690 variables, 0/867 constraints. Problems are: Problem set: 1 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 690/690 variables, and 867 constraints, problems are : Problem set: 1 solved, 13 unsolved in 3767 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 13/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 5498ms problems are : Problem set: 1 solved, 13 unsolved
Fused 13 Parikh solutions to 12 different solutions.
Finished Parikh walk after 84 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=42 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 13 properties in 368 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 514 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 514 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Applied a total of 0 rules in 11 ms. Remains 514 /514 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-05-25 19:21:43] [INFO ] Invariant cache hit.
[2024-05-25 19:21:44] [INFO ] Implicit Places using invariants in 345 ms returned []
[2024-05-25 19:21:44] [INFO ] Invariant cache hit.
[2024-05-25 19:21:44] [INFO ] Implicit Places using invariants and state equation in 706 ms returned [309]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1068 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/514 places, 176/176 transitions.
Applied a total of 0 rules in 11 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1091 ms. Remains : 513/514 places, 176/176 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-03
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-03 finished in 1311 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(!p0))&&F(p1))))'
Support contains 23 out of 514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Applied a total of 0 rules in 7 ms. Remains 514 /514 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-05-25 19:21:45] [INFO ] Invariant cache hit.
[2024-05-25 19:21:45] [INFO ] Implicit Places using invariants in 325 ms returned []
[2024-05-25 19:21:45] [INFO ] Invariant cache hit.
[2024-05-25 19:21:46] [INFO ] Implicit Places using invariants and state equation in 670 ms returned [309]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1014 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/514 places, 176/176 transitions.
Applied a total of 0 rules in 5 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1026 ms. Remains : 513/514 places, 176/176 transitions.
Stuttering acceptance computed with spot in 258 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-04
Product exploration explored 100000 steps with 33333 reset in 278 ms.
Product exploration explored 100000 steps with 33333 reset in 224 ms.
Computed a total of 513 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X p1)), (X (X (NOT p0))), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 16 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-04 finished in 1937 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(X(X(X(G(!p1))))))))'
Support contains 34 out of 514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Applied a total of 0 rules in 5 ms. Remains 514 /514 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-05-25 19:21:46] [INFO ] Invariant cache hit.
[2024-05-25 19:21:47] [INFO ] Implicit Places using invariants in 332 ms returned []
[2024-05-25 19:21:47] [INFO ] Invariant cache hit.
[2024-05-25 19:21:47] [INFO ] Implicit Places using invariants and state equation in 510 ms returned [309]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 845 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/514 places, 176/176 transitions.
Applied a total of 0 rules in 5 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 855 ms. Remains : 513/514 places, 176/176 transitions.
Stuttering acceptance computed with spot in 446 ms :[true, p1, (AND p1 (NOT p0)), (NOT p0), p1, (AND (NOT p0) p1), p1, (AND p1 (NOT p0)), p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-05
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-05 finished in 1319 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 34 out of 514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Graph (complete) has 2041 edges and 514 vertex of which 502 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.4 ms
Discarding 12 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 500 transition count 172
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 500 transition count 172
Applied a total of 4 rules in 53 ms. Remains 500 /514 variables (removed 14) and now considering 172/176 (removed 4) transitions.
// Phase 1: matrix 172 rows 500 cols
[2024-05-25 19:21:48] [INFO ] Computed 330 invariants in 5 ms
[2024-05-25 19:21:48] [INFO ] Implicit Places using invariants in 446 ms returned []
[2024-05-25 19:21:48] [INFO ] Invariant cache hit.
[2024-05-25 19:21:49] [INFO ] Implicit Places using invariants and state equation in 527 ms returned [307, 419, 420, 421, 422, 423, 424, 476, 479, 480, 481, 482]
Discarding 12 places :
Implicit Place search using SMT with State Equation took 976 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 488/514 places, 172/176 transitions.
Applied a total of 0 rules in 20 ms. Remains 488 /488 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1050 ms. Remains : 488/514 places, 172/176 transitions.
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-06
Product exploration explored 100000 steps with 6766 reset in 572 ms.
Product exploration explored 100000 steps with 6771 reset in 579 ms.
Computed a total of 488 stabilizing places and 172 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 488 transition count 172
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 12 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-06 finished in 2369 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 145 out of 514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 512 transition count 174
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 512 transition count 174
Applied a total of 3 rules in 49 ms. Remains 512 /514 variables (removed 2) and now considering 174/176 (removed 2) transitions.
// Phase 1: matrix 174 rows 512 cols
[2024-05-25 19:21:50] [INFO ] Computed 340 invariants in 3 ms
[2024-05-25 19:21:51] [INFO ] Implicit Places using invariants in 379 ms returned []
[2024-05-25 19:21:51] [INFO ] Invariant cache hit.
[2024-05-25 19:21:51] [INFO ] Implicit Places using invariants and state equation in 474 ms returned [308, 420, 421, 422, 423, 424, 425, 477, 480, 481, 482, 483]
Discarding 12 places :
Implicit Place search using SMT with State Equation took 856 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 500/514 places, 174/176 transitions.
Applied a total of 0 rules in 12 ms. Remains 500 /500 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 917 ms. Remains : 500/514 places, 174/176 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-07
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-07 finished in 1056 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Graph (complete) has 2041 edges and 514 vertex of which 502 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 ms
Discarding 12 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 499 transition count 171
Applied a total of 5 rules in 25 ms. Remains 499 /514 variables (removed 15) and now considering 171/176 (removed 5) transitions.
// Phase 1: matrix 171 rows 499 cols
[2024-05-25 19:21:51] [INFO ] Computed 330 invariants in 6 ms
[2024-05-25 19:21:52] [INFO ] Implicit Places using invariants in 392 ms returned []
[2024-05-25 19:21:52] [INFO ] Invariant cache hit.
[2024-05-25 19:21:52] [INFO ] Implicit Places using invariants and state equation in 685 ms returned [306, 418, 419, 420, 421, 422, 423, 475, 478, 479, 480, 481]
Discarding 12 places :
Implicit Place search using SMT with State Equation took 1080 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 487/514 places, 171/176 transitions.
Applied a total of 0 rules in 15 ms. Remains 487 /487 variables (removed 0) and now considering 171/171 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1120 ms. Remains : 487/514 places, 171/176 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-08
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-08 finished in 1198 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Graph (complete) has 2041 edges and 514 vertex of which 1 are kept as prefixes of interest. Removing 513 places using SCC suffix rule.1 ms
Discarding 513 places :
Also discarding 175 output transitions
Drop transitions (Output transitions of discarded places.) removed 175 transitions
Applied a total of 1 rules in 2 ms. Remains 1 /514 variables (removed 513) and now considering 1/176 (removed 175) transitions.
// Phase 1: matrix 1 rows 1 cols
[2024-05-25 19:21:52] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 19:21:52] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-25 19:21:52] [INFO ] Invariant cache hit.
[2024-05-25 19:21:52] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2024-05-25 19:21:52] [INFO ] Redundant transitions in 0 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1/514 places, 1/176 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 40 ms. Remains : 1/514 places, 1/176 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-09
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-09 finished in 81 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 12 out of 514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Graph (complete) has 2041 edges and 514 vertex of which 502 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.3 ms
Discarding 12 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 499 transition count 171
Applied a total of 5 rules in 28 ms. Remains 499 /514 variables (removed 15) and now considering 171/176 (removed 5) transitions.
// Phase 1: matrix 171 rows 499 cols
[2024-05-25 19:21:53] [INFO ] Computed 330 invariants in 3 ms
[2024-05-25 19:21:53] [INFO ] Implicit Places using invariants in 333 ms returned []
[2024-05-25 19:21:53] [INFO ] Invariant cache hit.
[2024-05-25 19:21:54] [INFO ] Implicit Places using invariants and state equation in 727 ms returned [306, 418, 419, 420, 421, 422, 423, 475, 478, 479, 480, 481]
Discarding 12 places :
Implicit Place search using SMT with State Equation took 1062 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 487/514 places, 171/176 transitions.
Applied a total of 0 rules in 15 ms. Remains 487 /487 variables (removed 0) and now considering 171/171 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1105 ms. Remains : 487/514 places, 171/176 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-11
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-11 finished in 1196 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(p1 U (p2||G(p1)))))))'
Support contains 16 out of 514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Graph (complete) has 2041 edges and 514 vertex of which 502 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 ms
Discarding 12 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 502 transition count 174
Applied a total of 2 rules in 24 ms. Remains 502 /514 variables (removed 12) and now considering 174/176 (removed 2) transitions.
// Phase 1: matrix 174 rows 502 cols
[2024-05-25 19:21:54] [INFO ] Computed 330 invariants in 5 ms
[2024-05-25 19:21:54] [INFO ] Implicit Places using invariants in 332 ms returned []
[2024-05-25 19:21:54] [INFO ] Invariant cache hit.
[2024-05-25 19:21:55] [INFO ] Implicit Places using invariants and state equation in 710 ms returned []
Implicit Place search using SMT with State Equation took 1044 ms to find 0 implicit places.
[2024-05-25 19:21:55] [INFO ] Redundant transitions in 16 ms returned []
Running 162 sub problems to find dead transitions.
[2024-05-25 19:21:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 330/330 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (OVERLAPS) 174/675 variables, 501/831 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/675 variables, 0/831 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (OVERLAPS) 1/676 variables, 1/832 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/676 variables, 0/832 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (OVERLAPS) 0/676 variables, 0/832 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 676/676 variables, and 832 constraints, problems are : Problem set: 0 solved, 162 unsolved in 11752 ms.
Refiners :[Generalized P Invariants (flows): 330/330 constraints, State Equation: 502/502 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 162 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 330/330 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (OVERLAPS) 174/675 variables, 501/831 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/675 variables, 162/993 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/675 variables, 0/993 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (OVERLAPS) 1/676 variables, 1/994 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/676 variables, 0/994 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 7 (OVERLAPS) 0/676 variables, 0/994 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Int declared 676/676 variables, and 994 constraints, problems are : Problem set: 0 solved, 162 unsolved in 19728 ms.
Refiners :[Generalized P Invariants (flows): 330/330 constraints, State Equation: 502/502 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 0/0 constraints]
After SMT, in 31617ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 31624ms
Starting structural reductions in SI_LTL mode, iteration 1 : 502/514 places, 174/176 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32719 ms. Remains : 502/514 places, 174/176 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-13
Product exploration explored 100000 steps with 6928 reset in 243 ms.
Product exploration explored 100000 steps with 6926 reset in 241 ms.
Computed a total of 502 stabilizing places and 174 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 502 transition count 174
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 (NOT p0) p1), (X p2), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p1)), (F (G p2)), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 13 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-13 finished in 33403 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0||G(!p1)))&&X(X(F(p2))))))'
Support contains 4 out of 514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Applied a total of 0 rules in 5 ms. Remains 514 /514 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 514 cols
[2024-05-25 19:22:27] [INFO ] Computed 340 invariants in 3 ms
[2024-05-25 19:22:27] [INFO ] Implicit Places using invariants in 319 ms returned []
[2024-05-25 19:22:27] [INFO ] Invariant cache hit.
[2024-05-25 19:22:28] [INFO ] Implicit Places using invariants and state equation in 540 ms returned [309]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 875 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/514 places, 176/176 transitions.
Applied a total of 0 rules in 6 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 886 ms. Remains : 513/514 places, 176/176 transitions.
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (OR (NOT p2) (AND (NOT p0) p1)), true, p1, (AND p1 (NOT p0)), (NOT p2), (NOT p2)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-15 finished in 1119 ms.
All properties solved by simple procedures.
Total runtime 54347 ms.

BK_STOP 1716664949054

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -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="QuasiCertifProtocol-PT-10"
export BK_EXAMINATION="LTLFireability"
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 QuasiCertifProtocol-PT-10, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r312-tall-171662337800076"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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