Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r289-tajo-171654445600284.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is PolyORBLF-PT-S04J04T10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445600284
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.7M
-rw-r--r-- 1 mcc users 27K Apr 11 17:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 154K Apr 11 17:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 111K Apr 11 17:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 530K Apr 11 17:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 12K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 45K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 19K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 11 17:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Apr 11 17:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 263K Apr 11 17:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.2M Apr 11 17:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.7K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 4.2M 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 PolyORBLF-PT-S04J04T10-LTLFireability-00
FORMULA_NAME PolyORBLF-PT-S04J04T10-LTLFireability-01
FORMULA_NAME PolyORBLF-PT-S04J04T10-LTLFireability-02
FORMULA_NAME PolyORBLF-PT-S04J04T10-LTLFireability-03
FORMULA_NAME PolyORBLF-PT-S04J04T10-LTLFireability-04
FORMULA_NAME PolyORBLF-PT-S04J04T10-LTLFireability-05
FORMULA_NAME PolyORBLF-PT-S04J04T10-LTLFireability-06
FORMULA_NAME PolyORBLF-PT-S04J04T10-LTLFireability-07
FORMULA_NAME PolyORBLF-PT-S04J04T10-LTLFireability-08
FORMULA_NAME PolyORBLF-PT-S04J04T10-LTLFireability-09
FORMULA_NAME PolyORBLF-PT-S04J04T10-LTLFireability-10
FORMULA_NAME PolyORBLF-PT-S04J04T10-LTLFireability-11
FORMULA_NAME PolyORBLF-PT-S04J04T10-LTLFireability-12
FORMULA_NAME PolyORBLF-PT-S04J04T10-LTLFireability-13
FORMULA_NAME PolyORBLF-PT-S04J04T10-LTLFireability-14
FORMULA_NAME PolyORBLF-PT-S04J04T10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716866238104

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S04J04T10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 03:17:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 03:17:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 03:17:20] [INFO ] Load time of PNML (sax parser for PT used): 698 ms
[2024-05-28 03:17:20] [INFO ] Transformed 870 places.
[2024-05-28 03:17:20] [INFO ] Transformed 5034 transitions.
[2024-05-28 03:17:20] [INFO ] Parsed PT model containing 870 places and 5034 transitions and 34774 arcs in 935 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 69 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 2710 transitions
Reduce redundant transitions removed 2710 transitions.
FORMULA PolyORBLF-PT-S04J04T10-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T10-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T10-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T10-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 275 out of 870 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 870/870 places, 2324/2324 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 866 transition count 2324
Applied a total of 4 rules in 209 ms. Remains 866 /870 variables (removed 4) and now considering 2324/2324 (removed 0) transitions.
Running 2320 sub problems to find dead transitions.
[2024-05-28 03:17:21] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
// Phase 1: matrix 2284 rows 866 cols
[2024-05-28 03:17:21] [INFO ] Computed 54 invariants in 107 ms
[2024-05-28 03:17:21] [INFO ] State equation strengthened by 200 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/862 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2320 unsolved
SMT process timed out in 33051ms, After SMT, problems are : Problem set: 0 solved, 2320 unsolved
Search for dead transitions found 0 dead transitions in 33148ms
[2024-05-28 03:17:54] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
[2024-05-28 03:17:54] [INFO ] Invariant cache hit.
[2024-05-28 03:17:55] [INFO ] Implicit Places using invariants in 848 ms returned [166, 282, 366, 367, 402, 516, 539, 633]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 871 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 858/870 places, 2324/2324 transitions.
Applied a total of 0 rules in 37 ms. Remains 858 /858 variables (removed 0) and now considering 2324/2324 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34383 ms. Remains : 858/870 places, 2324/2324 transitions.
Support contains 275 out of 858 places after structural reductions.
[2024-05-28 03:17:55] [INFO ] Flatten gal took : 268 ms
[2024-05-28 03:17:56] [INFO ] Flatten gal took : 274 ms
[2024-05-28 03:17:56] [INFO ] Input system was already deterministic with 2324 transitions.
Support contains 264 out of 858 places (down from 275) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 26 to 25
RANDOM walk for 40000 steps (9 resets) in 2477 ms. (16 steps per ms) remains 1/25 properties
BEST_FIRST walk for 40002 steps (8 resets) in 222 ms. (179 steps per ms) remains 1/1 properties
[2024-05-28 03:17:57] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
// Phase 1: matrix 2284 rows 858 cols
[2024-05-28 03:17:57] [INFO ] Computed 46 invariants in 66 ms
[2024-05-28 03:17:57] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 174/178 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/188 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp23 is UNSAT
After SMT solving in domain Real declared 823/3142 variables, and 27 constraints, problems are : Problem set: 1 solved, 0 unsolved in 456 ms.
Refiners :[Positive P Invariants (semi-flows): 8/14 constraints, Generalized P Invariants (flows): 19/32 constraints, State Equation: 0/858 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 561ms 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.
FORMULA PolyORBLF-PT-S04J04T10-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 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' '!(F(G(p0)))'
Support contains 42 out of 858 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 858/858 places, 2324/2324 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 858 transition count 2234
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 180 place count 768 transition count 2234
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 180 place count 768 transition count 2174
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 300 place count 708 transition count 2174
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 305 place count 703 transition count 2169
Iterating global reduction 2 with 5 rules applied. Total rules applied 310 place count 703 transition count 2169
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 2 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 510 place count 603 transition count 2069
Applied a total of 510 rules in 338 ms. Remains 603 /858 variables (removed 255) and now considering 2069/2324 (removed 255) transitions.
Running 2065 sub problems to find dead transitions.
[2024-05-28 03:17:59] [INFO ] Flow matrix only has 2029 transitions (discarded 40 similar events)
// Phase 1: matrix 2029 rows 603 cols
[2024-05-28 03:17:59] [INFO ] Computed 46 invariants in 32 ms
[2024-05-28 03:17:59] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/599 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2065 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/599 variables, 27/41 constraints. Problems are: Problem set: 0 solved, 2065 unsolved
[2024-05-28 03:18:30] [INFO ] Deduced a trap composed of 246 places in 361 ms of which 25 ms to minimize.
[2024-05-28 03:18:30] [INFO ] Deduced a trap composed of 23 places in 283 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 599/2632 variables, and 43 constraints, problems are : Problem set: 0 solved, 2065 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 27/31 constraints, State Equation: 0/603 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2065/2065 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2065 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/599 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2065 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/599 variables, 27/41 constraints. Problems are: Problem set: 0 solved, 2065 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/599 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 2065 unsolved
[2024-05-28 03:18:39] [INFO ] Deduced a trap composed of 50 places in 257 ms of which 3 ms to minimize.
[2024-05-28 03:18:39] [INFO ] Deduced a trap composed of 50 places in 135 ms of which 3 ms to minimize.
[2024-05-28 03:18:39] [INFO ] Deduced a trap composed of 51 places in 116 ms of which 2 ms to minimize.
[2024-05-28 03:18:39] [INFO ] Deduced a trap composed of 51 places in 83 ms of which 1 ms to minimize.
[2024-05-28 03:18:39] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 1 ms to minimize.
[2024-05-28 03:18:40] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 1 ms to minimize.
[2024-05-28 03:18:40] [INFO ] Deduced a trap composed of 51 places in 66 ms of which 1 ms to minimize.
[2024-05-28 03:18:40] [INFO ] Deduced a trap composed of 43 places in 400 ms of which 4 ms to minimize.
[2024-05-28 03:18:41] [INFO ] Deduced a trap composed of 89 places in 449 ms of which 5 ms to minimize.
[2024-05-28 03:18:41] [INFO ] Deduced a trap composed of 91 places in 388 ms of which 3 ms to minimize.
[2024-05-28 03:18:42] [INFO ] Deduced a trap composed of 93 places in 369 ms of which 3 ms to minimize.
[2024-05-28 03:18:42] [INFO ] Deduced a trap composed of 89 places in 316 ms of which 3 ms to minimize.
[2024-05-28 03:18:42] [INFO ] Deduced a trap composed of 89 places in 352 ms of which 4 ms to minimize.
[2024-05-28 03:18:43] [INFO ] Deduced a trap composed of 87 places in 320 ms of which 3 ms to minimize.
[2024-05-28 03:18:45] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 1 ms to minimize.
[2024-05-28 03:18:45] [INFO ] Deduced a trap composed of 51 places in 60 ms of which 1 ms to minimize.
[2024-05-28 03:18:48] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 599/2632 variables, and 60 constraints, problems are : Problem set: 0 solved, 2065 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 27/31 constraints, State Equation: 0/603 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2065 constraints, Known Traps: 19/19 constraints]
After SMT, in 53009ms problems are : Problem set: 0 solved, 2065 unsolved
Search for dead transitions found 0 dead transitions in 53029ms
[2024-05-28 03:18:52] [INFO ] Flow matrix only has 2029 transitions (discarded 40 similar events)
[2024-05-28 03:18:52] [INFO ] Invariant cache hit.
[2024-05-28 03:18:52] [INFO ] Implicit Places using invariants in 827 ms returned [498, 595]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 837 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 601/858 places, 2069/2324 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 600 transition count 2068
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 600 transition count 2068
Applied a total of 2 rules in 80 ms. Remains 600 /601 variables (removed 1) and now considering 2068/2069 (removed 1) transitions.
[2024-05-28 03:18:52] [INFO ] Flow matrix only has 2028 transitions (discarded 40 similar events)
// Phase 1: matrix 2028 rows 600 cols
[2024-05-28 03:18:53] [INFO ] Computed 44 invariants in 34 ms
[2024-05-28 03:18:53] [INFO ] Implicit Places using invariants in 751 ms returned []
[2024-05-28 03:18:53] [INFO ] Flow matrix only has 2028 transitions (discarded 40 similar events)
[2024-05-28 03:18:53] [INFO ] Invariant cache hit.
[2024-05-28 03:18:55] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-28 03:19:19] [INFO ] Implicit Places using invariants and state equation in 25423 ms returned []
Implicit Place search using SMT with State Equation took 26190 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 600/858 places, 2068/2324 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 80480 ms. Remains : 600/858 places, 2068/2324 transitions.
Stuttering acceptance computed with spot in 219 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J04T10-LTLFireability-00
Product exploration explored 100000 steps with 2 reset in 1356 ms.
Stack based approach found an accepted trace after 2286 steps with 0 reset with depth 2287 and stack size 2287 in 31 ms.
FORMULA PolyORBLF-PT-S04J04T10-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-PT-S04J04T10-LTLFireability-00 finished in 82190 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&&X(F(p1)))||G(F(p1)))))||(G(!p2)&&F(((!p0&&X(F(p1)))||G(F(p1))))))))'
Support contains 68 out of 858 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 858/858 places, 2324/2324 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 848 transition count 2314
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 848 transition count 2314
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 838 transition count 2304
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 838 transition count 2304
Applied a total of 40 rules in 110 ms. Remains 838 /858 variables (removed 20) and now considering 2304/2324 (removed 20) transitions.
Running 2300 sub problems to find dead transitions.
[2024-05-28 03:19:20] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
// Phase 1: matrix 2264 rows 838 cols
[2024-05-28 03:19:21] [INFO ] Computed 46 invariants in 79 ms
[2024-05-28 03:19:21] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/834 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
SMT process timed out in 33226ms, After SMT, problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 33255ms
[2024-05-28 03:19:54] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-05-28 03:19:54] [INFO ] Invariant cache hit.
[2024-05-28 03:19:54] [INFO ] Implicit Places using invariants in 722 ms returned [704, 828]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 730 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 836/858 places, 2304/2324 transitions.
Applied a total of 0 rules in 18 ms. Remains 836 /836 variables (removed 0) and now considering 2304/2304 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34123 ms. Remains : 836/858 places, 2304/2324 transitions.
Stuttering acceptance computed with spot in 210 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2), (NOT p1)]
Running random walk in product with property : PolyORBLF-PT-S04J04T10-LTLFireability-01
Product exploration explored 100000 steps with 1085 reset in 1249 ms.
Product exploration explored 100000 steps with 1132 reset in 1326 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (OR (NOT p1) (NOT p0))), (X (OR (NOT p1) (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (OR (NOT p1) (NOT p0)))), (X (X (OR (NOT p1) (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 175 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2), (NOT p1)]
RANDOM walk for 40000 steps (9 resets) in 870 ms. (45 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 969 ms. (41 steps per ms) remains 1/1 properties
[2024-05-28 03:19:58] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
// Phase 1: matrix 2264 rows 836 cols
[2024-05-28 03:19:58] [INFO ] Computed 44 invariants in 42 ms
[2024-05-28 03:19:58] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 190/248 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/248 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 112/360 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 456/816 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 03:19:59] [INFO ] Deduced a trap composed of 74 places in 452 ms of which 7 ms to minimize.
[2024-05-28 03:19:59] [INFO ] Deduced a trap composed of 74 places in 256 ms of which 5 ms to minimize.
[2024-05-28 03:20:00] [INFO ] Deduced a trap composed of 74 places in 249 ms of which 2 ms to minimize.
[2024-05-28 03:20:00] [INFO ] Deduced a trap composed of 75 places in 181 ms of which 3 ms to minimize.
[2024-05-28 03:20:00] [INFO ] Deduced a trap composed of 74 places in 128 ms of which 2 ms to minimize.
[2024-05-28 03:20:00] [INFO ] Deduced a trap composed of 74 places in 119 ms of which 2 ms to minimize.
[2024-05-28 03:20:00] [INFO ] Deduced a trap composed of 74 places in 77 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/816 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/816 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3/819 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/819 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf3 is UNSAT
After SMT solving in domain Real declared 834/3100 variables, and 50 constraints, problems are : Problem set: 1 solved, 0 unsolved in 2198 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/836 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 2333ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (OR (NOT p1) (NOT p0))), (X (OR (NOT p1) (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (OR (NOT p1) (NOT p0)))), (X (X (OR (NOT p1) (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p2) p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p2))), (F (NOT p1)), (F p0), (F p2), (F (NOT (OR (AND (NOT p0) (NOT p2)) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 16 factoid took 337 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2), (NOT p1)]
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2), (NOT p1)]
Support contains 68 out of 836 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 836/836 places, 2304/2304 transitions.
Applied a total of 0 rules in 18 ms. Remains 836 /836 variables (removed 0) and now considering 2304/2304 (removed 0) transitions.
Running 2300 sub problems to find dead transitions.
[2024-05-28 03:20:01] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-05-28 03:20:01] [INFO ] Invariant cache hit.
[2024-05-28 03:20:01] [INFO ] State equation strengthened by 200 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 1.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 2.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 0.0)
(s28 1.0)
(s29 1.0)
(s30 0.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 0.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 0.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 0.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 0.0)
(s80 1.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 0.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 1.0)
(s114 1.0)
(s115 0.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 1.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s142 1.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 0.0)
(s154 1.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 0.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 0.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 1.0)
(s180 0.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 0.0)
(s192 1.0)
(s193 0.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 0.0)
(s198 1.0)
(s199 0.0)
(s200 0.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 0.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 0.0)
(s216 1.0)
(s217 0.0)
(s218 0.0)
(s219 1.0)
(s220 0.0)
(s221 0.0)
(s222 1.0)
(s223 1.0)
(s224 0.0)
(s225 1.0)
(s226 0.0)
(s227 0.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 0.0)
(s232 1.0)
(s233 1.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 0.0)
(s247 0.0)
(s248 1.0)
(s249 0.0)
(s250 0.0)
(s251 1.0)
(s252 0.0)
(s253 1.0)
(s254 1.0)
(s255 0.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 0.0)
(s260 1.0)
(s261 4.0)
(s262 1.0)
(s263 1.0)
(s264 0.0)
(s265 1.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 0.0)
(s275 1.0)
(s276 0.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 0.0)
(s281 1.0)
(s282 1.0)
(s283 0.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 0.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 0.0)
(s298 1.0)
(s299 1.0)
(s300 0.0)
(s301 1.0)
(s302 0.0)
(s303 1.0)
(s304 0.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 0.0)
(s309 0.0)
(s310 1.0)
(s311 1.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 0.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 0.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 0.0)
(s336 1.0)
(s337 0.0)
(s338 1.0)
(s339 1.0)
(s340 9.0)
(s341 1.0)
(s342 0.0)
(s343 0.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 0.0)
(s348 1.0)
(s349 1.0)
(s350 0.0)
(s351 0.0)
(s352 1.0)
(s353 0.0)
(s354 0.0)
(s355 1.0)
(s356 0.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 0.0)
(s362 0.0)
(s363 1.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 1.0)
(s368 0.0)
(s369 1.0)
(s370 0.0)
(s371 1.0)
(s372 0.0)
(s373 1.0)
(s374 0.0)
(s375 1.0)
(s376 0.0)
(s377 1.0)
(s378 1.0)
(s379 0.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 0.0)
(s386 1.0)
(s387 0.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 1.0)
(s397 0.0)
(s398 1.0)
(s399 0.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 0.0)
(s404 1.0)
(s405 1.0)
(s406 0.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 0.0)
(s415 1.0)
(s416 0.0)
(s417 1.0)
(s418 1.0)
(s419 0.0)
(s420 1.0)
(s421 0.0)
(s422 0.0)
(s423 1.0)
(s424 0.0)
(s425 1.0)
(s426 0.0)
(s427 0.0)
(s428 1.0)
(s429 0.0)
(s430 1.0)
(s431 1.0)
(s432 0.0)
(s433 1.0)
(s434 1.0)
(s435 0.0)
(s436 1.0)
(s437 1.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/832 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
SMT process timed out in 34926ms, After SMT, problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 34949ms
[2024-05-28 03:20:36] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-05-28 03:20:36] [INFO ] Invariant cache hit.
[2024-05-28 03:20:37] [INFO ] Implicit Places using invariants in 739 ms returned []
[2024-05-28 03:20:37] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-05-28 03:20:37] [INFO ] Invariant cache hit.
[2024-05-28 03:20:38] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-28 03:21:09] [INFO ] Performed 770/836 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-28 03:21:10] [INFO ] Implicit Places using invariants and state equation in 33201 ms returned []
Implicit Place search using SMT with State Equation took 33969 ms to find 0 implicit places.
Running 2300 sub problems to find dead transitions.
[2024-05-28 03:21:10] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-05-28 03:21:10] [INFO ] Invariant cache hit.
[2024-05-28 03:21:10] [INFO ] State equation strengthened by 200 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-PT-S04J04T10

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 870
TRANSITIONS: 5034
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.258s, Sys 0.009s]


SAVING FILE /home/mcc/execution/model (.net / .def) ...
EXPORT TIME: [User 0.039s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 884
MODEL NAME: /home/mcc/execution/model
870 places, 5034 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//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//../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="PolyORBLF-PT-S04J04T10"
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 PolyORBLF-PT-S04J04T10, 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 r289-tajo-171654445600284"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S04J04T10.tgz
mv PolyORBLF-PT-S04J04T10 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 ;