About the Execution of LoLa+red for ShieldPPPs-PT-040A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 869.651 | 177863.00 | 222190.00 | 63.30 | TFFFFFFTF?FTFTFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r391-oct2-167903715300483.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is ShieldPPPs-PT-040A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r391-oct2-167903715300483
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 816K
-rw-r--r-- 1 mcc users 6.7K Feb 26 02:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 02:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 02:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 02:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 02:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Feb 26 02:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 02:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 26 02:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 355K Mar 5 18:23 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 ShieldPPPs-PT-040A-LTLCardinality-00
FORMULA_NAME ShieldPPPs-PT-040A-LTLCardinality-01
FORMULA_NAME ShieldPPPs-PT-040A-LTLCardinality-02
FORMULA_NAME ShieldPPPs-PT-040A-LTLCardinality-03
FORMULA_NAME ShieldPPPs-PT-040A-LTLCardinality-04
FORMULA_NAME ShieldPPPs-PT-040A-LTLCardinality-05
FORMULA_NAME ShieldPPPs-PT-040A-LTLCardinality-06
FORMULA_NAME ShieldPPPs-PT-040A-LTLCardinality-07
FORMULA_NAME ShieldPPPs-PT-040A-LTLCardinality-08
FORMULA_NAME ShieldPPPs-PT-040A-LTLCardinality-09
FORMULA_NAME ShieldPPPs-PT-040A-LTLCardinality-10
FORMULA_NAME ShieldPPPs-PT-040A-LTLCardinality-11
FORMULA_NAME ShieldPPPs-PT-040A-LTLCardinality-12
FORMULA_NAME ShieldPPPs-PT-040A-LTLCardinality-13
FORMULA_NAME ShieldPPPs-PT-040A-LTLCardinality-14
FORMULA_NAME ShieldPPPs-PT-040A-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679276176136
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-040A
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 01:36:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 01:36:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 01:36:18] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2023-03-20 01:36:18] [INFO ] Transformed 1243 places.
[2023-03-20 01:36:18] [INFO ] Transformed 1043 transitions.
[2023-03-20 01:36:18] [INFO ] Found NUPN structural information;
[2023-03-20 01:36:18] [INFO ] Parsed PT model containing 1243 places and 1043 transitions and 4006 arcs in 230 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldPPPs-PT-040A-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-040A-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-040A-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-040A-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-040A-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-040A-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-040A-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-040A-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-040A-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-040A-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 out of 1243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1243/1243 places, 1043/1043 transitions.
Applied a total of 0 rules in 140 ms. Remains 1243 /1243 variables (removed 0) and now considering 1043/1043 (removed 0) transitions.
// Phase 1: matrix 1043 rows 1243 cols
[2023-03-20 01:36:19] [INFO ] Computed 441 place invariants in 14 ms
[2023-03-20 01:36:20] [INFO ] Implicit Places using invariants in 1145 ms returned []
[2023-03-20 01:36:20] [INFO ] Invariant cache hit.
[2023-03-20 01:36:22] [INFO ] Implicit Places using invariants and state equation in 1845 ms returned []
Implicit Place search using SMT with State Equation took 3060 ms to find 0 implicit places.
[2023-03-20 01:36:22] [INFO ] Invariant cache hit.
[2023-03-20 01:36:23] [INFO ] Dead Transitions using invariants and state equation in 883 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4090 ms. Remains : 1243/1243 places, 1043/1043 transitions.
Support contains 16 out of 1243 places after structural reductions.
[2023-03-20 01:36:23] [INFO ] Flatten gal took : 170 ms
[2023-03-20 01:36:23] [INFO ] Flatten gal took : 89 ms
[2023-03-20 01:36:23] [INFO ] Input system was already deterministic with 1043 transitions.
Finished random walk after 2045 steps, including 0 resets, run visited all 11 properties in 102 ms. (steps per millisecond=20 )
FORMULA ShieldPPPs-PT-040A-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1243/1243 places, 1043/1043 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1241 transition count 1041
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1240 transition count 1040
Applied a total of 4 rules in 210 ms. Remains 1240 /1243 variables (removed 3) and now considering 1040/1043 (removed 3) transitions.
// Phase 1: matrix 1040 rows 1240 cols
[2023-03-20 01:36:24] [INFO ] Computed 441 place invariants in 5 ms
[2023-03-20 01:36:25] [INFO ] Implicit Places using invariants in 834 ms returned []
[2023-03-20 01:36:25] [INFO ] Invariant cache hit.
[2023-03-20 01:36:26] [INFO ] Implicit Places using invariants and state equation in 1570 ms returned []
Implicit Place search using SMT with State Equation took 2425 ms to find 0 implicit places.
[2023-03-20 01:36:26] [INFO ] Redundant transitions in 46 ms returned []
[2023-03-20 01:36:26] [INFO ] Invariant cache hit.
[2023-03-20 01:36:27] [INFO ] Dead Transitions using invariants and state equation in 782 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1240/1243 places, 1040/1043 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3470 ms. Remains : 1240/1243 places, 1040/1043 transitions.
Stuttering acceptance computed with spot in 230 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-040A-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s948 0) (EQ s132 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2720 steps with 0 reset in 51 ms.
FORMULA ShieldPPPs-PT-040A-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-040A-LTLCardinality-02 finished in 3813 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||G(p1)))'
Support contains 3 out of 1243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1243/1243 places, 1043/1043 transitions.
Applied a total of 0 rules in 51 ms. Remains 1243 /1243 variables (removed 0) and now considering 1043/1043 (removed 0) transitions.
// Phase 1: matrix 1043 rows 1243 cols
[2023-03-20 01:36:27] [INFO ] Computed 441 place invariants in 4 ms
[2023-03-20 01:36:28] [INFO ] Implicit Places using invariants in 690 ms returned []
[2023-03-20 01:36:28] [INFO ] Invariant cache hit.
[2023-03-20 01:36:30] [INFO ] Implicit Places using invariants and state equation in 1929 ms returned []
Implicit Place search using SMT with State Equation took 2642 ms to find 0 implicit places.
[2023-03-20 01:36:30] [INFO ] Invariant cache hit.
[2023-03-20 01:36:31] [INFO ] Dead Transitions using invariants and state equation in 634 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3329 ms. Remains : 1243/1243 places, 1043/1043 transitions.
Stuttering acceptance computed with spot in 161 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-040A-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(EQ s343 1), p0:(AND (EQ s776 0) (EQ s128 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldPPPs-PT-040A-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-040A-LTLCardinality-03 finished in 3520 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 1243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1243/1243 places, 1043/1043 transitions.
Applied a total of 0 rules in 33 ms. Remains 1243 /1243 variables (removed 0) and now considering 1043/1043 (removed 0) transitions.
[2023-03-20 01:36:31] [INFO ] Invariant cache hit.
[2023-03-20 01:36:32] [INFO ] Implicit Places using invariants in 824 ms returned []
[2023-03-20 01:36:32] [INFO ] Invariant cache hit.
[2023-03-20 01:36:33] [INFO ] Implicit Places using invariants and state equation in 1625 ms returned []
Implicit Place search using SMT with State Equation took 2458 ms to find 0 implicit places.
[2023-03-20 01:36:33] [INFO ] Invariant cache hit.
[2023-03-20 01:36:34] [INFO ] Dead Transitions using invariants and state equation in 644 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3141 ms. Remains : 1243/1243 places, 1043/1043 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ShieldPPPs-PT-040A-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s167 0) (EQ s926 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-040A-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-040A-LTLCardinality-06 finished in 3259 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X((p1 U p2))||p0))))'
Support contains 3 out of 1243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1243/1243 places, 1043/1043 transitions.
Applied a total of 0 rules in 23 ms. Remains 1243 /1243 variables (removed 0) and now considering 1043/1043 (removed 0) transitions.
[2023-03-20 01:36:34] [INFO ] Invariant cache hit.
[2023-03-20 01:36:35] [INFO ] Implicit Places using invariants in 640 ms returned []
[2023-03-20 01:36:35] [INFO ] Invariant cache hit.
[2023-03-20 01:36:37] [INFO ] Implicit Places using invariants and state equation in 2048 ms returned []
Implicit Place search using SMT with State Equation took 2697 ms to find 0 implicit places.
[2023-03-20 01:36:37] [INFO ] Invariant cache hit.
[2023-03-20 01:36:38] [INFO ] Dead Transitions using invariants and state equation in 656 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3379 ms. Remains : 1243/1243 places, 1043/1043 transitions.
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldPPPs-PT-040A-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s230 1) (EQ s1089 1)), p2:(AND (NEQ s989 1) (EQ s230 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 858 reset in 959 ms.
Product exploration explored 100000 steps with 858 reset in 994 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 137 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=27 )
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 3 factoid took 231 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2023-03-20 01:36:40] [INFO ] Invariant cache hit.
[2023-03-20 01:36:42] [INFO ] [Real]Absence check using 441 positive place invariants in 629 ms returned sat
[2023-03-20 01:36:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 01:36:46] [INFO ] [Real]Absence check using state equation in 3991 ms returned sat
[2023-03-20 01:36:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 01:36:47] [INFO ] [Nat]Absence check using 441 positive place invariants in 225 ms returned sat
[2023-03-20 01:36:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 01:36:50] [INFO ] [Nat]Absence check using state equation in 2809 ms returned sat
[2023-03-20 01:36:50] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 4 ms to minimize.
[2023-03-20 01:36:50] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 1 ms to minimize.
[2023-03-20 01:36:51] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 0 ms to minimize.
[2023-03-20 01:36:51] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 13 ms to minimize.
[2023-03-20 01:36:51] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2023-03-20 01:36:51] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 0 ms to minimize.
[2023-03-20 01:36:51] [INFO ] Deduced a trap composed of 26 places in 171 ms of which 1 ms to minimize.
[2023-03-20 01:36:52] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 18 ms to minimize.
[2023-03-20 01:36:52] [INFO ] Deduced a trap composed of 34 places in 116 ms of which 1 ms to minimize.
[2023-03-20 01:36:52] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 1 ms to minimize.
[2023-03-20 01:36:52] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 1 ms to minimize.
[2023-03-20 01:36:52] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 0 ms to minimize.
[2023-03-20 01:36:53] [INFO ] Deduced a trap composed of 29 places in 174 ms of which 1 ms to minimize.
[2023-03-20 01:36:53] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 0 ms to minimize.
[2023-03-20 01:36:53] [INFO ] Deduced a trap composed of 38 places in 173 ms of which 1 ms to minimize.
[2023-03-20 01:36:53] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 0 ms to minimize.
[2023-03-20 01:36:54] [INFO ] Deduced a trap composed of 28 places in 140 ms of which 0 ms to minimize.
[2023-03-20 01:36:54] [INFO ] Deduced a trap composed of 34 places in 273 ms of which 1 ms to minimize.
[2023-03-20 01:36:54] [INFO ] Deduced a trap composed of 38 places in 217 ms of which 1 ms to minimize.
[2023-03-20 01:36:54] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 0 ms to minimize.
[2023-03-20 01:36:55] [INFO ] Deduced a trap composed of 41 places in 113 ms of which 15 ms to minimize.
[2023-03-20 01:36:55] [INFO ] Deduced a trap composed of 47 places in 128 ms of which 1 ms to minimize.
[2023-03-20 01:36:55] [INFO ] Deduced a trap composed of 43 places in 121 ms of which 0 ms to minimize.
[2023-03-20 01:36:55] [INFO ] Deduced a trap composed of 66 places in 92 ms of which 1 ms to minimize.
[2023-03-20 01:36:55] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 0 ms to minimize.
[2023-03-20 01:36:55] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 1 ms to minimize.
[2023-03-20 01:36:56] [INFO ] Deduced a trap composed of 29 places in 125 ms of which 1 ms to minimize.
[2023-03-20 01:36:56] [INFO ] Deduced a trap composed of 35 places in 340 ms of which 0 ms to minimize.
[2023-03-20 01:36:56] [INFO ] Deduced a trap composed of 44 places in 173 ms of which 0 ms to minimize.
[2023-03-20 01:36:57] [INFO ] Deduced a trap composed of 49 places in 130 ms of which 0 ms to minimize.
[2023-03-20 01:36:57] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 1 ms to minimize.
[2023-03-20 01:36:57] [INFO ] Deduced a trap composed of 44 places in 133 ms of which 0 ms to minimize.
[2023-03-20 01:36:57] [INFO ] Deduced a trap composed of 40 places in 152 ms of which 0 ms to minimize.
[2023-03-20 01:36:58] [INFO ] Deduced a trap composed of 23 places in 219 ms of which 15 ms to minimize.
[2023-03-20 01:36:58] [INFO ] Deduced a trap composed of 26 places in 186 ms of which 0 ms to minimize.
[2023-03-20 01:36:58] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 1 ms to minimize.
[2023-03-20 01:36:58] [INFO ] Deduced a trap composed of 46 places in 227 ms of which 0 ms to minimize.
[2023-03-20 01:36:59] [INFO ] Deduced a trap composed of 33 places in 216 ms of which 0 ms to minimize.
[2023-03-20 01:36:59] [INFO ] Deduced a trap composed of 34 places in 136 ms of which 0 ms to minimize.
[2023-03-20 01:37:00] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 0 ms to minimize.
[2023-03-20 01:37:00] [INFO ] Deduced a trap composed of 41 places in 165 ms of which 1 ms to minimize.
[2023-03-20 01:37:00] [INFO ] Deduced a trap composed of 43 places in 265 ms of which 0 ms to minimize.
[2023-03-20 01:37:00] [INFO ] Deduced a trap composed of 26 places in 143 ms of which 1 ms to minimize.
[2023-03-20 01:37:01] [INFO ] Deduced a trap composed of 23 places in 222 ms of which 0 ms to minimize.
[2023-03-20 01:37:01] [INFO ] Deduced a trap composed of 23 places in 186 ms of which 0 ms to minimize.
[2023-03-20 01:37:01] [INFO ] Deduced a trap composed of 32 places in 148 ms of which 15 ms to minimize.
[2023-03-20 01:37:02] [INFO ] Deduced a trap composed of 55 places in 177 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 01:37:02] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND (NOT p0) (NOT p2))
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 3 out of 1243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1243/1243 places, 1043/1043 transitions.
Applied a total of 0 rules in 26 ms. Remains 1243 /1243 variables (removed 0) and now considering 1043/1043 (removed 0) transitions.
[2023-03-20 01:37:02] [INFO ] Invariant cache hit.
[2023-03-20 01:37:02] [INFO ] Implicit Places using invariants in 611 ms returned []
[2023-03-20 01:37:02] [INFO ] Invariant cache hit.
[2023-03-20 01:37:04] [INFO ] Implicit Places using invariants and state equation in 1593 ms returned []
Implicit Place search using SMT with State Equation took 2204 ms to find 0 implicit places.
[2023-03-20 01:37:04] [INFO ] Invariant cache hit.
[2023-03-20 01:37:04] [INFO ] Dead Transitions using invariants and state equation in 668 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2925 ms. Remains : 1243/1243 places, 1043/1043 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 110 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 142 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=71 )
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 2 factoid took 158 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 244 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2023-03-20 01:37:05] [INFO ] Invariant cache hit.
[2023-03-20 01:37:06] [INFO ] [Real]Absence check using 441 positive place invariants in 286 ms returned sat
[2023-03-20 01:37:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 01:37:10] [INFO ] [Real]Absence check using state equation in 4015 ms returned sat
[2023-03-20 01:37:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 01:37:11] [INFO ] [Nat]Absence check using 441 positive place invariants in 198 ms returned sat
[2023-03-20 01:37:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 01:37:14] [INFO ] [Nat]Absence check using state equation in 2751 ms returned sat
[2023-03-20 01:37:14] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2023-03-20 01:37:14] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 0 ms to minimize.
[2023-03-20 01:37:15] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2023-03-20 01:37:15] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2023-03-20 01:37:15] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2023-03-20 01:37:15] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2023-03-20 01:37:15] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 0 ms to minimize.
[2023-03-20 01:37:15] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 0 ms to minimize.
[2023-03-20 01:37:15] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2023-03-20 01:37:16] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 1 ms to minimize.
[2023-03-20 01:37:16] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2023-03-20 01:37:16] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2023-03-20 01:37:16] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 0 ms to minimize.
[2023-03-20 01:37:16] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 0 ms to minimize.
[2023-03-20 01:37:16] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 1 ms to minimize.
[2023-03-20 01:37:17] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 0 ms to minimize.
[2023-03-20 01:37:17] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 1 ms to minimize.
[2023-03-20 01:37:17] [INFO ] Deduced a trap composed of 34 places in 173 ms of which 1 ms to minimize.
[2023-03-20 01:37:17] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 7 ms to minimize.
[2023-03-20 01:37:17] [INFO ] Deduced a trap composed of 40 places in 111 ms of which 0 ms to minimize.
[2023-03-20 01:37:18] [INFO ] Deduced a trap composed of 41 places in 141 ms of which 1 ms to minimize.
[2023-03-20 01:37:18] [INFO ] Deduced a trap composed of 47 places in 152 ms of which 6 ms to minimize.
[2023-03-20 01:37:18] [INFO ] Deduced a trap composed of 43 places in 111 ms of which 4 ms to minimize.
[2023-03-20 01:37:18] [INFO ] Deduced a trap composed of 66 places in 99 ms of which 1 ms to minimize.
[2023-03-20 01:37:18] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2023-03-20 01:37:19] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 0 ms to minimize.
[2023-03-20 01:37:19] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2023-03-20 01:37:19] [INFO ] Deduced a trap composed of 35 places in 89 ms of which 0 ms to minimize.
[2023-03-20 01:37:19] [INFO ] Deduced a trap composed of 44 places in 220 ms of which 1 ms to minimize.
[2023-03-20 01:37:19] [INFO ] Deduced a trap composed of 49 places in 119 ms of which 0 ms to minimize.
[2023-03-20 01:37:20] [INFO ] Deduced a trap composed of 35 places in 122 ms of which 0 ms to minimize.
[2023-03-20 01:37:20] [INFO ] Deduced a trap composed of 44 places in 166 ms of which 0 ms to minimize.
[2023-03-20 01:37:20] [INFO ] Deduced a trap composed of 40 places in 259 ms of which 0 ms to minimize.
[2023-03-20 01:37:21] [INFO ] Deduced a trap composed of 23 places in 194 ms of which 1 ms to minimize.
[2023-03-20 01:37:21] [INFO ] Deduced a trap composed of 26 places in 142 ms of which 0 ms to minimize.
[2023-03-20 01:37:21] [INFO ] Deduced a trap composed of 31 places in 318 ms of which 15 ms to minimize.
[2023-03-20 01:37:21] [INFO ] Deduced a trap composed of 46 places in 294 ms of which 1 ms to minimize.
[2023-03-20 01:37:22] [INFO ] Deduced a trap composed of 33 places in 170 ms of which 0 ms to minimize.
[2023-03-20 01:37:22] [INFO ] Deduced a trap composed of 34 places in 250 ms of which 0 ms to minimize.
[2023-03-20 01:37:23] [INFO ] Deduced a trap composed of 37 places in 247 ms of which 0 ms to minimize.
[2023-03-20 01:37:23] [INFO ] Deduced a trap composed of 41 places in 225 ms of which 1 ms to minimize.
[2023-03-20 01:37:23] [INFO ] Deduced a trap composed of 43 places in 201 ms of which 1 ms to minimize.
[2023-03-20 01:37:24] [INFO ] Deduced a trap composed of 26 places in 248 ms of which 1 ms to minimize.
[2023-03-20 01:37:24] [INFO ] Deduced a trap composed of 23 places in 221 ms of which 0 ms to minimize.
[2023-03-20 01:37:24] [INFO ] Deduced a trap composed of 23 places in 187 ms of which 0 ms to minimize.
[2023-03-20 01:37:25] [INFO ] Deduced a trap composed of 32 places in 336 ms of which 0 ms to minimize.
[2023-03-20 01:37:25] [INFO ] Deduced a trap composed of 55 places in 294 ms of which 1 ms to minimize.
[2023-03-20 01:37:26] [INFO ] Deduced a trap composed of 46 places in 336 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 01:37:26] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND (NOT p0) (NOT p2))
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 853 reset in 960 ms.
Product exploration explored 100000 steps with 864 reset in 971 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 1243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1243/1243 places, 1043/1043 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 2 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1243 transition count 1043
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 2 rules in 228 ms. Remains 1243 /1243 variables (removed 0) and now considering 1043/1043 (removed 0) transitions.
[2023-03-20 01:37:29] [INFO ] Redundant transitions in 81 ms returned []
// Phase 1: matrix 1043 rows 1243 cols
[2023-03-20 01:37:29] [INFO ] Computed 441 place invariants in 3 ms
[2023-03-20 01:37:29] [INFO ] Dead Transitions using invariants and state equation in 781 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1243/1243 places, 1043/1043 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1112 ms. Remains : 1243/1243 places, 1043/1043 transitions.
Support contains 3 out of 1243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1243/1243 places, 1043/1043 transitions.
Applied a total of 0 rules in 30 ms. Remains 1243 /1243 variables (removed 0) and now considering 1043/1043 (removed 0) transitions.
// Phase 1: matrix 1043 rows 1243 cols
[2023-03-20 01:37:29] [INFO ] Computed 441 place invariants in 3 ms
[2023-03-20 01:37:30] [INFO ] Implicit Places using invariants in 950 ms returned []
[2023-03-20 01:37:30] [INFO ] Invariant cache hit.
[2023-03-20 01:37:33] [INFO ] Implicit Places using invariants and state equation in 2307 ms returned []
Implicit Place search using SMT with State Equation took 3281 ms to find 0 implicit places.
[2023-03-20 01:37:33] [INFO ] Invariant cache hit.
[2023-03-20 01:37:34] [INFO ] Dead Transitions using invariants and state equation in 844 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4157 ms. Remains : 1243/1243 places, 1043/1043 transitions.
Treatment of property ShieldPPPs-PT-040A-LTLCardinality-09 finished in 59464 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 1243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1243/1243 places, 1043/1043 transitions.
Applied a total of 0 rules in 25 ms. Remains 1243 /1243 variables (removed 0) and now considering 1043/1043 (removed 0) transitions.
[2023-03-20 01:37:34] [INFO ] Invariant cache hit.
[2023-03-20 01:37:34] [INFO ] Implicit Places using invariants in 701 ms returned []
[2023-03-20 01:37:34] [INFO ] Invariant cache hit.
[2023-03-20 01:37:35] [INFO ] Implicit Places using invariants and state equation in 675 ms returned []
Implicit Place search using SMT with State Equation took 1379 ms to find 0 implicit places.
[2023-03-20 01:37:35] [INFO ] Invariant cache hit.
[2023-03-20 01:37:36] [INFO ] Dead Transitions using invariants and state equation in 643 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2047 ms. Remains : 1243/1243 places, 1043/1043 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-040A-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(NEQ s744 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1352 steps with 0 reset in 19 ms.
FORMULA ShieldPPPs-PT-040A-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-040A-LTLCardinality-14 finished in 2177 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X((p1 U p2))||p0))))'
Found a Shortening insensitive property : ShieldPPPs-PT-040A-LTLCardinality-09
Stuttering acceptance computed with spot in 210 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 1243 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1243/1243 places, 1043/1043 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1241 transition count 1041
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1240 transition count 1040
Applied a total of 4 rules in 126 ms. Remains 1240 /1243 variables (removed 3) and now considering 1040/1043 (removed 3) transitions.
// Phase 1: matrix 1040 rows 1240 cols
[2023-03-20 01:37:36] [INFO ] Computed 441 place invariants in 17 ms
[2023-03-20 01:37:37] [INFO ] Implicit Places using invariants in 851 ms returned []
[2023-03-20 01:37:37] [INFO ] Invariant cache hit.
[2023-03-20 01:37:39] [INFO ] Implicit Places using invariants and state equation in 1866 ms returned []
Implicit Place search using SMT with State Equation took 2740 ms to find 0 implicit places.
[2023-03-20 01:37:39] [INFO ] Invariant cache hit.
[2023-03-20 01:37:40] [INFO ] Dead Transitions using invariants and state equation in 824 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 1240/1243 places, 1040/1043 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 3699 ms. Remains : 1240/1243 places, 1040/1043 transitions.
Running random walk in product with property : ShieldPPPs-PT-040A-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s229 1) (EQ s1088 1)), p2:(AND (NEQ s988 1) (EQ s229 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 909 reset in 752 ms.
Product exploration explored 100000 steps with 912 reset in 933 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 p0) (NOT p2)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 167 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 99 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=33 )
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 3 factoid took 155 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2023-03-20 01:37:42] [INFO ] Invariant cache hit.
[2023-03-20 01:37:43] [INFO ] [Real]Absence check using 441 positive place invariants in 288 ms returned sat
[2023-03-20 01:37:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 01:37:47] [INFO ] [Real]Absence check using state equation in 4017 ms returned sat
[2023-03-20 01:37:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 01:37:49] [INFO ] [Nat]Absence check using 441 positive place invariants in 205 ms returned sat
[2023-03-20 01:37:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 01:37:51] [INFO ] [Nat]Absence check using state equation in 2578 ms returned sat
[2023-03-20 01:37:51] [INFO ] Computed and/alt/rep : 1038/1993/1038 causal constraints (skipped 0 transitions) in 64 ms.
[2023-03-20 01:38:03] [INFO ] Added : 390 causal constraints over 78 iterations in 11349 ms. Result :unknown
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 3 out of 1240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1240/1240 places, 1040/1040 transitions.
Applied a total of 0 rules in 26 ms. Remains 1240 /1240 variables (removed 0) and now considering 1040/1040 (removed 0) transitions.
[2023-03-20 01:38:03] [INFO ] Invariant cache hit.
[2023-03-20 01:38:04] [INFO ] Implicit Places using invariants in 869 ms returned []
[2023-03-20 01:38:04] [INFO ] Invariant cache hit.
[2023-03-20 01:38:05] [INFO ] Implicit Places using invariants and state equation in 1569 ms returned []
Implicit Place search using SMT with State Equation took 2440 ms to find 0 implicit places.
[2023-03-20 01:38:05] [INFO ] Invariant cache hit.
[2023-03-20 01:38:06] [INFO ] Dead Transitions using invariants and state equation in 717 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3184 ms. Remains : 1240/1240 places, 1040/1040 transitions.
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 p0) (NOT p2)), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 105 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 132 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=33 )
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 2 factoid took 192 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2023-03-20 01:38:07] [INFO ] Invariant cache hit.
[2023-03-20 01:38:08] [INFO ] [Real]Absence check using 441 positive place invariants in 288 ms returned sat
[2023-03-20 01:38:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 01:38:12] [INFO ] [Real]Absence check using state equation in 4357 ms returned sat
[2023-03-20 01:38:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 01:38:13] [INFO ] [Nat]Absence check using 441 positive place invariants in 201 ms returned sat
[2023-03-20 01:38:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 01:38:16] [INFO ] [Nat]Absence check using state equation in 2561 ms returned sat
[2023-03-20 01:38:16] [INFO ] Computed and/alt/rep : 1038/1993/1038 causal constraints (skipped 0 transitions) in 51 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 01:38:27] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND (NOT p0) (NOT p2))
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 902 reset in 798 ms.
Product exploration explored 100000 steps with 908 reset in 894 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 1240 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1240/1240 places, 1040/1040 transitions.
Applied a total of 0 rules in 38 ms. Remains 1240 /1240 variables (removed 0) and now considering 1040/1040 (removed 0) transitions.
[2023-03-20 01:38:30] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-20 01:38:30] [INFO ] Invariant cache hit.
[2023-03-20 01:38:30] [INFO ] Dead Transitions using invariants and state equation in 680 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 754 ms. Remains : 1240/1240 places, 1040/1040 transitions.
Support contains 3 out of 1240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1240/1240 places, 1040/1040 transitions.
Applied a total of 0 rules in 30 ms. Remains 1240 /1240 variables (removed 0) and now considering 1040/1040 (removed 0) transitions.
[2023-03-20 01:38:30] [INFO ] Invariant cache hit.
[2023-03-20 01:38:31] [INFO ] Implicit Places using invariants in 691 ms returned []
[2023-03-20 01:38:31] [INFO ] Invariant cache hit.
[2023-03-20 01:38:32] [INFO ] Implicit Places using invariants and state equation in 1223 ms returned []
Implicit Place search using SMT with State Equation took 1915 ms to find 0 implicit places.
[2023-03-20 01:38:32] [INFO ] Invariant cache hit.
[2023-03-20 01:38:33] [INFO ] Dead Transitions using invariants and state equation in 653 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2599 ms. Remains : 1240/1240 places, 1040/1040 transitions.
Treatment of property ShieldPPPs-PT-040A-LTLCardinality-09 finished in 57076 ms.
[2023-03-20 01:38:33] [INFO ] Flatten gal took : 76 ms
[2023-03-20 01:38:33] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-20 01:38:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1243 places, 1043 transitions and 4006 arcs took 19 ms.
Total runtime 134856 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldPPPs-PT-040A
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLCardinality
BK_STOP 1679276353999
--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 1 (type EXCL) for 0 ShieldPPPs-PT-040A-LTLCardinality-09
lola: time limit : 3599 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-040A-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 4/3599 5/32 ShieldPPPs-PT-040A-LTLCardinality-09 388026 m, 77605 m/sec, 983559 t fired, .
Time elapsed: 5 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-040A-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 9/3599 9/32 ShieldPPPs-PT-040A-LTLCardinality-09 757008 m, 73796 m/sec, 2031084 t fired, .
Time elapsed: 10 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-040A-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 14/3599 13/32 ShieldPPPs-PT-040A-LTLCardinality-09 1091852 m, 66968 m/sec, 3079122 t fired, .
Time elapsed: 15 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-040A-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 19/3599 18/32 ShieldPPPs-PT-040A-LTLCardinality-09 1474012 m, 76432 m/sec, 4118061 t fired, .
Time elapsed: 20 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-040A-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 24/3599 22/32 ShieldPPPs-PT-040A-LTLCardinality-09 1840091 m, 73215 m/sec, 5160807 t fired, .
Time elapsed: 25 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-040A-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 29/3599 26/32 ShieldPPPs-PT-040A-LTLCardinality-09 2164493 m, 64880 m/sec, 6191083 t fired, .
Time elapsed: 30 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-040A-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 34/3599 29/32 ShieldPPPs-PT-040A-LTLCardinality-09 2473970 m, 61895 m/sec, 7231037 t fired, .
Time elapsed: 35 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 1
lola: CANCELED task # 1 (type EXCL) for ShieldPPPs-PT-040A-LTLCardinality-09 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-040A-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 40 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
lola: Portfolio finished: no open tasks 1
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-040A-LTLCardinality-09: LTL unknown AGGR
Time elapsed: 40 secs. Pages in use: 32
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="ShieldPPPs-PT-040A"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is ShieldPPPs-PT-040A, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r391-oct2-167903715300483"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-040A.tgz
mv ShieldPPPs-PT-040A execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;