About the Execution of GreatSPN+red for FlexibleBarrier-PT-12a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
559.292 | 77494.00 | 101934.00 | 264.50 | TFFFFFTFFFFFFTFF | normal |
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.r179-tall-171640600700068.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 greatspnxred
Input is FlexibleBarrier-PT-12a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640600700068
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 22 14:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 13 09:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 13 09:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 13 09:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 13 09:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 128K May 18 16:42 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 FlexibleBarrier-PT-12a-LTLFireability-00
FORMULA_NAME FlexibleBarrier-PT-12a-LTLFireability-01
FORMULA_NAME FlexibleBarrier-PT-12a-LTLFireability-02
FORMULA_NAME FlexibleBarrier-PT-12a-LTLFireability-03
FORMULA_NAME FlexibleBarrier-PT-12a-LTLFireability-04
FORMULA_NAME FlexibleBarrier-PT-12a-LTLFireability-05
FORMULA_NAME FlexibleBarrier-PT-12a-LTLFireability-06
FORMULA_NAME FlexibleBarrier-PT-12a-LTLFireability-07
FORMULA_NAME FlexibleBarrier-PT-12a-LTLFireability-08
FORMULA_NAME FlexibleBarrier-PT-12a-LTLFireability-09
FORMULA_NAME FlexibleBarrier-PT-12a-LTLFireability-10
FORMULA_NAME FlexibleBarrier-PT-12a-LTLFireability-11
FORMULA_NAME FlexibleBarrier-PT-12a-LTLFireability-12
FORMULA_NAME FlexibleBarrier-PT-12a-LTLFireability-13
FORMULA_NAME FlexibleBarrier-PT-12a-LTLFireability-14
FORMULA_NAME FlexibleBarrier-PT-12a-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716419332102
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-12a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 23:08:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 23:08:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 23:08:53] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2024-05-22 23:08:53] [INFO ] Transformed 147 places.
[2024-05-22 23:08:53] [INFO ] Transformed 448 transitions.
[2024-05-22 23:08:53] [INFO ] Found NUPN structural information;
[2024-05-22 23:08:53] [INFO ] Parsed PT model containing 147 places and 448 transitions and 2045 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.
Ensure Unique test removed 122 transitions
Reduce redundant transitions removed 122 transitions.
FORMULA FlexibleBarrier-PT-12a-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-12a-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-12a-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-12a-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 326/326 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 147 transition count 314
Applied a total of 12 rules in 31 ms. Remains 147 /147 variables (removed 0) and now considering 314/326 (removed 12) transitions.
// Phase 1: matrix 314 rows 147 cols
[2024-05-22 23:08:53] [INFO ] Computed 14 invariants in 8 ms
[2024-05-22 23:08:53] [INFO ] Implicit Places using invariants in 228 ms returned []
[2024-05-22 23:08:53] [INFO ] Invariant cache hit.
[2024-05-22 23:08:53] [INFO ] State equation strengthened by 193 read => feed constraints.
[2024-05-22 23:08:54] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
Running 313 sub problems to find dead transitions.
[2024-05-22 23:08:54] [INFO ] Invariant cache hit.
[2024-05-22 23:08:54] [INFO ] State equation strengthened by 193 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 146/146 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 14/160 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (OVERLAPS) 314/461 variables, 147/308 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 193/501 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/461 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (OVERLAPS) 0/461 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 313 unsolved
No progress, stopping.
After SMT solving in domain Real declared 461/461 variables, and 501 constraints, problems are : Problem set: 0 solved, 313 unsolved in 10731 ms.
Refiners :[Domain max(s): 147/147 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 147/147 constraints, ReadFeed: 193/193 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 313 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 146/146 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 14/160 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (OVERLAPS) 314/461 variables, 147/308 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 193/501 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/461 variables, 313/814 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/461 variables, 0/814 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 9 (OVERLAPS) 0/461 variables, 0/814 constraints. Problems are: Problem set: 0 solved, 313 unsolved
No progress, stopping.
After SMT solving in domain Int declared 461/461 variables, and 814 constraints, problems are : Problem set: 0 solved, 313 unsolved in 9756 ms.
Refiners :[Domain max(s): 147/147 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 147/147 constraints, ReadFeed: 193/193 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 0/0 constraints]
After SMT, in 20705ms problems are : Problem set: 0 solved, 313 unsolved
Search for dead transitions found 0 dead transitions in 20724ms
Starting structural reductions in LTL mode, iteration 1 : 147/147 places, 314/326 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21253 ms. Remains : 147/147 places, 314/326 transitions.
Support contains 28 out of 147 places after structural reductions.
[2024-05-22 23:09:14] [INFO ] Flatten gal took : 48 ms
[2024-05-22 23:09:15] [INFO ] Flatten gal took : 23 ms
[2024-05-22 23:09:15] [INFO ] Input system was already deterministic with 314 transitions.
Reduction of identical properties reduced properties to check from 29 to 27
RANDOM walk for 40000 steps (8 resets) in 1116 ms. (35 steps per ms) remains 1/27 properties
BEST_FIRST walk for 40004 steps (8 resets) in 220 ms. (181 steps per ms) remains 1/1 properties
[2024-05-22 23:09:15] [INFO ] Invariant cache hit.
[2024-05-22 23:09:15] [INFO ] State equation strengthened by 193 read => feed constraints.
Problem AtomicPropp14 is UNSAT
After SMT solving in domain Real declared 3/461 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 36 ms.
Refiners :[Domain max(s): 0/147 constraints, Positive P Invariants (semi-flows): 0/14 constraints, State Equation: 0/147 constraints, ReadFeed: 0/193 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 47ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 3 stabilizing places and 1 stable transitions
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(p1)||p0))||(F(p2) U p3)))'
Support contains 4 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 314/314 transitions.
Applied a total of 0 rules in 5 ms. Remains 147 /147 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2024-05-22 23:09:15] [INFO ] Invariant cache hit.
[2024-05-22 23:09:16] [INFO ] Implicit Places using invariants in 92 ms returned [146]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 95 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 146/147 places, 314/314 transitions.
Applied a total of 0 rules in 4 ms. Remains 146 /146 variables (removed 0) and now considering 314/314 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 104 ms. Remains : 146/147 places, 314/314 transitions.
Stuttering acceptance computed with spot in 465 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p2) p3 (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p3), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : FlexibleBarrier-PT-12a-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 622 ms.
Product exploration explored 100000 steps with 50000 reset in 453 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p2) p0 p1), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p3 (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p1)))), (X (NOT (AND p3 (NOT p2) (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND (NOT p3) (NOT p0) p1))), (X p1), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p3) (NOT p2) p1))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (AND (NOT p3) p1))), (X (X (NOT (AND (NOT p3) p1)))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 23 ms. Reduced automaton from 7 states, 17 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-12a-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-12a-LTLFireability-00 finished in 1747 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((p0||G(p1))))'
Support contains 4 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 314/314 transitions.
Applied a total of 0 rules in 5 ms. Remains 147 /147 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2024-05-22 23:09:17] [INFO ] Invariant cache hit.
[2024-05-22 23:09:17] [INFO ] Implicit Places using invariants in 80 ms returned [146]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 84 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 146/147 places, 314/314 transitions.
Applied a total of 0 rules in 3 ms. Remains 146 /146 variables (removed 0) and now considering 314/314 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 92 ms. Remains : 146/147 places, 314/314 transitions.
Stuttering acceptance computed with spot in 128 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-12a-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-12a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12a-LTLFireability-01 finished in 242 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' '!((p0 U G((p1&&X((!p2&&X(F(!p3))))))))'
Support contains 8 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 314/314 transitions.
Applied a total of 0 rules in 3 ms. Remains 147 /147 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2024-05-22 23:09:17] [INFO ] Invariant cache hit.
[2024-05-22 23:09:17] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-22 23:09:17] [INFO ] Invariant cache hit.
[2024-05-22 23:09:18] [INFO ] State equation strengthened by 193 read => feed constraints.
[2024-05-22 23:09:18] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
Running 313 sub problems to find dead transitions.
[2024-05-22 23:09:18] [INFO ] Invariant cache hit.
[2024-05-22 23:09:18] [INFO ] State equation strengthened by 193 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 146/146 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 14/160 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (OVERLAPS) 314/461 variables, 147/308 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 193/501 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/461 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (OVERLAPS) 0/461 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 313 unsolved
No progress, stopping.
After SMT solving in domain Real declared 461/461 variables, and 501 constraints, problems are : Problem set: 0 solved, 313 unsolved in 10625 ms.
Refiners :[Domain max(s): 147/147 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 147/147 constraints, ReadFeed: 193/193 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 313 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 146/146 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 14/160 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (OVERLAPS) 314/461 variables, 147/308 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 193/501 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/461 variables, 313/814 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/461 variables, 0/814 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 9 (OVERLAPS) 0/461 variables, 0/814 constraints. Problems are: Problem set: 0 solved, 313 unsolved
No progress, stopping.
After SMT solving in domain Int declared 461/461 variables, and 814 constraints, problems are : Problem set: 0 solved, 313 unsolved in 9890 ms.
Refiners :[Domain max(s): 147/147 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 147/147 constraints, ReadFeed: 193/193 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 0/0 constraints]
After SMT, in 20652ms problems are : Problem set: 0 solved, 313 unsolved
Search for dead transitions found 0 dead transitions in 20659ms
Finished structural reductions in LTL mode , in 1 iterations and 20916 ms. Remains : 147/147 places, 314/314 transitions.
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p1) p2 p3), true, (OR (NOT p1) p3 p2), (OR p3 p2), p3]
Running random walk in product with property : FlexibleBarrier-PT-12a-LTLFireability-02
Entered a terminal (fully accepting) state of product in 50 steps with 12 reset in 1 ms.
FORMULA FlexibleBarrier-PT-12a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12a-LTLFireability-02 finished in 21157 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)||(X((p1||G(p0)))&&G((!p1||X(!p2))))||G(p1))))'
Support contains 6 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 314/314 transitions.
Applied a total of 0 rules in 5 ms. Remains 147 /147 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2024-05-22 23:09:39] [INFO ] Invariant cache hit.
[2024-05-22 23:09:39] [INFO ] Implicit Places using invariants in 75 ms returned [146]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 78 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 146/147 places, 314/314 transitions.
Applied a total of 0 rules in 2 ms. Remains 146 /146 variables (removed 0) and now considering 314/314 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 85 ms. Remains : 146/147 places, 314/314 transitions.
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, (AND (NOT p1) (NOT p0) p2)]
Running random walk in product with property : FlexibleBarrier-PT-12a-LTLFireability-03
Product exploration explored 100000 steps with 1567 reset in 405 ms.
Stack based approach found an accepted trace after 34220 steps with 463 reset with depth 4 and stack size 4 in 162 ms.
FORMULA FlexibleBarrier-PT-12a-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-12a-LTLFireability-03 finished in 835 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)))'
Support contains 2 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 314/314 transitions.
Applied a total of 0 rules in 2 ms. Remains 147 /147 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2024-05-22 23:09:39] [INFO ] Invariant cache hit.
[2024-05-22 23:09:39] [INFO ] Implicit Places using invariants in 78 ms returned [146]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 79 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 146/147 places, 314/314 transitions.
Applied a total of 0 rules in 2 ms. Remains 146 /146 variables (removed 0) and now considering 314/314 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 83 ms. Remains : 146/147 places, 314/314 transitions.
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-12a-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-12a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12a-LTLFireability-05 finished in 167 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((p0||X(F(p1)))))'
Support contains 5 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 314/314 transitions.
Applied a total of 0 rules in 3 ms. Remains 147 /147 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2024-05-22 23:09:40] [INFO ] Invariant cache hit.
[2024-05-22 23:09:40] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-22 23:09:40] [INFO ] Invariant cache hit.
[2024-05-22 23:09:40] [INFO ] State equation strengthened by 193 read => feed constraints.
[2024-05-22 23:09:40] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
Running 313 sub problems to find dead transitions.
[2024-05-22 23:09:40] [INFO ] Invariant cache hit.
[2024-05-22 23:09:40] [INFO ] State equation strengthened by 193 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 146/146 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 14/160 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (OVERLAPS) 314/461 variables, 147/308 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 193/501 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/461 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (OVERLAPS) 0/461 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 313 unsolved
No progress, stopping.
After SMT solving in domain Real declared 461/461 variables, and 501 constraints, problems are : Problem set: 0 solved, 313 unsolved in 10463 ms.
Refiners :[Domain max(s): 147/147 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 147/147 constraints, ReadFeed: 193/193 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 313 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 146/146 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 14/160 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (OVERLAPS) 314/461 variables, 147/308 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 193/501 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/461 variables, 313/814 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/461 variables, 0/814 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 9 (OVERLAPS) 0/461 variables, 0/814 constraints. Problems are: Problem set: 0 solved, 313 unsolved
No progress, stopping.
After SMT solving in domain Int declared 461/461 variables, and 814 constraints, problems are : Problem set: 0 solved, 313 unsolved in 9697 ms.
Refiners :[Domain max(s): 147/147 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 147/147 constraints, ReadFeed: 193/193 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 0/0 constraints]
After SMT, in 20272ms problems are : Problem set: 0 solved, 313 unsolved
Search for dead transitions found 0 dead transitions in 20275ms
Finished structural reductions in LTL mode , in 1 iterations and 20517 ms. Remains : 147/147 places, 314/314 transitions.
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-12a-LTLFireability-07
Product exploration explored 100000 steps with 2927 reset in 355 ms.
Stack based approach found an accepted trace after 28 steps with 2 reset with depth 10 and stack size 10 in 0 ms.
FORMULA FlexibleBarrier-PT-12a-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-12a-LTLFireability-07 finished in 21003 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((p0||G(F(!p1)))))'
Support contains 5 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 314/314 transitions.
Applied a total of 0 rules in 2 ms. Remains 147 /147 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2024-05-22 23:10:01] [INFO ] Invariant cache hit.
[2024-05-22 23:10:01] [INFO ] Implicit Places using invariants in 79 ms returned [146]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 80 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 146/147 places, 314/314 transitions.
Applied a total of 0 rules in 2 ms. Remains 146 /146 variables (removed 0) and now considering 314/314 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 85 ms. Remains : 146/147 places, 314/314 transitions.
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1]
Running random walk in product with property : FlexibleBarrier-PT-12a-LTLFireability-09
Product exploration explored 100000 steps with 1573 reset in 330 ms.
Stack based approach found an accepted trace after 6306 steps with 121 reset with depth 48 and stack size 47 in 25 ms.
FORMULA FlexibleBarrier-PT-12a-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-12a-LTLFireability-09 finished in 614 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((F((X(p0)||G(p1)))&&F(p2))))'
Support contains 6 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 314/314 transitions.
Applied a total of 0 rules in 1 ms. Remains 147 /147 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2024-05-22 23:10:01] [INFO ] Invariant cache hit.
[2024-05-22 23:10:01] [INFO ] Implicit Places using invariants in 79 ms returned [146]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 80 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 146/147 places, 314/314 transitions.
Applied a total of 0 rules in 1 ms. Remains 146 /146 variables (removed 0) and now considering 314/314 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 82 ms. Remains : 146/147 places, 314/314 transitions.
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-12a-LTLFireability-10
Product exploration explored 100000 steps with 13969 reset in 433 ms.
Stack based approach found an accepted trace after 14 steps with 1 reset with depth 12 and stack size 12 in 0 ms.
FORMULA FlexibleBarrier-PT-12a-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-12a-LTLFireability-10 finished in 715 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((F(p1)&&p0)))'
Support contains 5 out of 147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 147/147 places, 314/314 transitions.
Graph (trivial) has 110 edges and 147 vertex of which 24 / 147 are part of one of the 8 SCC in 3 ms
Free SCC test removed 16 places
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 0 with 72 rules applied. Total rules applied 73 place count 95 transition count 241
Drop transitions (Redundant composition of simpler transitions.) removed 88 transitions
Redundant transition composition rules discarded 88 transitions
Iterating global reduction 0 with 88 rules applied. Total rules applied 161 place count 95 transition count 153
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 163 place count 95 transition count 153
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 165 place count 93 transition count 151
Iterating global reduction 0 with 2 rules applied. Total rules applied 167 place count 93 transition count 151
Applied a total of 167 rules in 65 ms. Remains 93 /147 variables (removed 54) and now considering 151/314 (removed 163) transitions.
[2024-05-22 23:10:02] [INFO ] Flow matrix only has 132 transitions (discarded 19 similar events)
// Phase 1: matrix 132 rows 93 cols
[2024-05-22 23:10:02] [INFO ] Computed 14 invariants in 2 ms
[2024-05-22 23:10:02] [INFO ] Implicit Places using invariants in 88 ms returned [92]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 90 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 92/147 places, 151/314 transitions.
Graph (trivial) has 116 edges and 92 vertex of which 24 / 92 are part of one of the 8 SCC in 0 ms
Free SCC test removed 16 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 76 transition count 107
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 64 transition count 107
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 25 place count 64 transition count 95
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 49 place count 52 transition count 95
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 81 place count 36 transition count 79
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 93 place count 36 transition count 67
Applied a total of 93 rules in 15 ms. Remains 36 /92 variables (removed 56) and now considering 67/151 (removed 84) transitions.
[2024-05-22 23:10:02] [INFO ] Flow matrix only has 52 transitions (discarded 15 similar events)
// Phase 1: matrix 52 rows 36 cols
[2024-05-22 23:10:02] [INFO ] Computed 13 invariants in 0 ms
[2024-05-22 23:10:02] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-22 23:10:02] [INFO ] Flow matrix only has 52 transitions (discarded 15 similar events)
[2024-05-22 23:10:02] [INFO ] Invariant cache hit.
[2024-05-22 23:10:02] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-22 23:10:02] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 36/147 places, 67/314 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 235 ms. Remains : 36/147 places, 67/314 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-12a-LTLFireability-11
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-12a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12a-LTLFireability-11 finished in 343 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 3 out of 147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 147/147 places, 314/314 transitions.
Graph (trivial) has 115 edges and 147 vertex of which 30 / 147 are part of one of the 10 SCC in 1 ms
Free SCC test removed 20 places
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 0 with 72 rules applied. Total rules applied 73 place count 91 transition count 222
Drop transitions (Redundant composition of simpler transitions.) removed 83 transitions
Redundant transition composition rules discarded 83 transitions
Iterating global reduction 0 with 83 rules applied. Total rules applied 156 place count 91 transition count 139
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 157 place count 91 transition count 139
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 158 place count 90 transition count 138
Iterating global reduction 0 with 1 rules applied. Total rules applied 159 place count 90 transition count 138
Applied a total of 159 rules in 34 ms. Remains 90 /147 variables (removed 57) and now considering 138/314 (removed 176) transitions.
[2024-05-22 23:10:02] [INFO ] Flow matrix only has 117 transitions (discarded 21 similar events)
// Phase 1: matrix 117 rows 90 cols
[2024-05-22 23:10:02] [INFO ] Computed 14 invariants in 3 ms
[2024-05-22 23:10:02] [INFO ] Implicit Places using invariants in 100 ms returned [89]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 101 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/147 places, 138/314 transitions.
Graph (trivial) has 118 edges and 89 vertex of which 30 / 89 are part of one of the 10 SCC in 0 ms
Free SCC test removed 20 places
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 69 transition count 86
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 57 transition count 86
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 25 place count 57 transition count 74
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 49 place count 45 transition count 74
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 77 place count 31 transition count 60
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 89 place count 31 transition count 48
Applied a total of 89 rules in 14 ms. Remains 31 /89 variables (removed 58) and now considering 48/138 (removed 90) transitions.
[2024-05-22 23:10:02] [INFO ] Flow matrix only has 35 transitions (discarded 13 similar events)
// Phase 1: matrix 35 rows 31 cols
[2024-05-22 23:10:02] [INFO ] Computed 13 invariants in 0 ms
[2024-05-22 23:10:02] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-22 23:10:02] [INFO ] Flow matrix only has 35 transitions (discarded 13 similar events)
[2024-05-22 23:10:02] [INFO ] Invariant cache hit.
[2024-05-22 23:10:02] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-22 23:10:02] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 31/147 places, 48/314 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 233 ms. Remains : 31/147 places, 48/314 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-12a-LTLFireability-12
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-12a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12a-LTLFireability-12 finished in 324 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(F(p0))||G(p1))))'
Support contains 5 out of 147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 147/147 places, 314/314 transitions.
Graph (trivial) has 114 edges and 147 vertex of which 30 / 147 are part of one of the 10 SCC in 1 ms
Free SCC test removed 20 places
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 0 with 72 rules applied. Total rules applied 73 place count 91 transition count 222
Drop transitions (Redundant composition of simpler transitions.) removed 83 transitions
Redundant transition composition rules discarded 83 transitions
Iterating global reduction 0 with 83 rules applied. Total rules applied 156 place count 91 transition count 139
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 157 place count 91 transition count 139
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 158 place count 90 transition count 138
Iterating global reduction 0 with 1 rules applied. Total rules applied 159 place count 90 transition count 138
Applied a total of 159 rules in 33 ms. Remains 90 /147 variables (removed 57) and now considering 138/314 (removed 176) transitions.
[2024-05-22 23:10:03] [INFO ] Flow matrix only has 117 transitions (discarded 21 similar events)
// Phase 1: matrix 117 rows 90 cols
[2024-05-22 23:10:03] [INFO ] Computed 14 invariants in 1 ms
[2024-05-22 23:10:03] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-22 23:10:03] [INFO ] Flow matrix only has 117 transitions (discarded 21 similar events)
[2024-05-22 23:10:03] [INFO ] Invariant cache hit.
[2024-05-22 23:10:03] [INFO ] State equation strengthened by 87 read => feed constraints.
[2024-05-22 23:10:03] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2024-05-22 23:10:03] [INFO ] Redundant transitions in 23 ms returned [63]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 136 sub problems to find dead transitions.
[2024-05-22 23:10:03] [INFO ] Flow matrix only has 116 transitions (discarded 21 similar events)
// Phase 1: matrix 116 rows 90 cols
[2024-05-22 23:10:03] [INFO ] Computed 14 invariants in 1 ms
[2024-05-22 23:10:03] [INFO ] State equation strengthened by 86 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (OVERLAPS) 115/205 variables, 90/104 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 85/189 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 1/206 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (OVERLAPS) 0/206 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 190 constraints, problems are : Problem set: 0 solved, 136 unsolved in 3153 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 90/90 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (OVERLAPS) 115/205 variables, 90/104 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 85/189 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 136/325 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (OVERLAPS) 1/206 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 9 (OVERLAPS) 0/206 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 326 constraints, problems are : Problem set: 0 solved, 136 unsolved in 2729 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 90/90 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints]
After SMT, in 5903ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 5905ms
Starting structural reductions in SI_LTL mode, iteration 1 : 90/147 places, 137/314 transitions.
Applied a total of 0 rules in 10 ms. Remains 90 /90 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6109 ms. Remains : 90/147 places, 137/314 transitions.
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-12a-LTLFireability-14
Stuttering criterion allowed to conclude after 385 steps with 0 reset in 9 ms.
FORMULA FlexibleBarrier-PT-12a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12a-LTLFireability-14 finished in 6254 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(p0) U G(p1)))'
Support contains 5 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 314/314 transitions.
Applied a total of 0 rules in 2 ms. Remains 147 /147 variables (removed 0) and now considering 314/314 (removed 0) transitions.
// Phase 1: matrix 314 rows 147 cols
[2024-05-22 23:10:09] [INFO ] Computed 14 invariants in 1 ms
[2024-05-22 23:10:09] [INFO ] Implicit Places using invariants in 82 ms returned [146]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 83 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 146/147 places, 314/314 transitions.
Applied a total of 0 rules in 1 ms. Remains 146 /146 variables (removed 0) and now considering 314/314 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 86 ms. Remains : 146/147 places, 314/314 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p0)]
Running random walk in product with property : FlexibleBarrier-PT-12a-LTLFireability-15
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-12a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12a-LTLFireability-15 finished in 264 ms.
All properties solved by simple procedures.
Total runtime 76352 ms.
ITS solved all properties within timeout
BK_STOP 1716419409596
--------------------
content from stderr:
+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
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="FlexibleBarrier-PT-12a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is FlexibleBarrier-PT-12a, 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 r179-tall-171640600700068"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-12a.tgz
mv FlexibleBarrier-PT-12a 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 '
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 ;