fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r359-smll-167891808700276
Last Updated
May 14, 2023

About the Execution of LoLa+red for SafeBus-PT-10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
636.424 154867.00 195705.00 1042.00 TFFFFFFFFFFFFFFF 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.r359-smll-167891808700276.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 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 SafeBus-PT-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r359-smll-167891808700276
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.6M
-rw-r--r-- 1 mcc users 19K Feb 26 01:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 126K Feb 26 01:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 81K Feb 26 01:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 393K Feb 26 01:38 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 7.5K Feb 25 16:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 40K Feb 25 16:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 42K Feb 25 16:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 151K Feb 25 16:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 31K Feb 26 01:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 198K Feb 26 01:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 244K Feb 26 01:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.1M Feb 26 01:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.8K Feb 25 16:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.2M 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 SafeBus-PT-10-LTLFireability-00
FORMULA_NAME SafeBus-PT-10-LTLFireability-01
FORMULA_NAME SafeBus-PT-10-LTLFireability-02
FORMULA_NAME SafeBus-PT-10-LTLFireability-03
FORMULA_NAME SafeBus-PT-10-LTLFireability-04
FORMULA_NAME SafeBus-PT-10-LTLFireability-05
FORMULA_NAME SafeBus-PT-10-LTLFireability-06
FORMULA_NAME SafeBus-PT-10-LTLFireability-07
FORMULA_NAME SafeBus-PT-10-LTLFireability-08
FORMULA_NAME SafeBus-PT-10-LTLFireability-09
FORMULA_NAME SafeBus-PT-10-LTLFireability-10
FORMULA_NAME SafeBus-PT-10-LTLFireability-11
FORMULA_NAME SafeBus-PT-10-LTLFireability-12
FORMULA_NAME SafeBus-PT-10-LTLFireability-13
FORMULA_NAME SafeBus-PT-10-LTLFireability-14
FORMULA_NAME SafeBus-PT-10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679051643781

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SafeBus-PT-10
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-17 11:14:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-17 11:14:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 11:14:07] [INFO ] Load time of PNML (sax parser for PT used): 384 ms
[2023-03-17 11:14:07] [INFO ] Transformed 316 places.
[2023-03-17 11:14:07] [INFO ] Transformed 1631 transitions.
[2023-03-17 11:14:07] [INFO ] Parsed PT model containing 316 places and 1631 transitions and 11384 arcs in 605 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 42 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Reduce places removed 10 places and 0 transitions.
FORMULA SafeBus-PT-10-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-10-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 306 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1631/1631 transitions.
Applied a total of 0 rules in 51 ms. Remains 306 /306 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
[2023-03-17 11:14:08] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
// Phase 1: matrix 642 rows 306 cols
[2023-03-17 11:14:08] [INFO ] Computed 45 place invariants in 87 ms
[2023-03-17 11:14:09] [INFO ] Implicit Places using invariants in 447 ms returned []
[2023-03-17 11:14:09] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2023-03-17 11:14:09] [INFO ] Invariant cache hit.
[2023-03-17 11:14:09] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-17 11:14:09] [INFO ] Implicit Places using invariants and state equation in 667 ms returned []
Implicit Place search using SMT with State Equation took 1171 ms to find 0 implicit places.
[2023-03-17 11:14:09] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2023-03-17 11:14:09] [INFO ] Invariant cache hit.
[2023-03-17 11:14:11] [INFO ] Dead Transitions using invariants and state equation in 2094 ms found 100 transitions.
Found 100 dead transitions using SMT.
Drop transitions removed 100 transitions
Dead transitions reduction (with SMT) removed 100 transitions
Starting structural reductions in LTL mode, iteration 1 : 306/306 places, 1531/1631 transitions.
Applied a total of 0 rules in 13 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3335 ms. Remains : 306/306 places, 1531/1631 transitions.
Support contains 306 out of 306 places after structural reductions.
[2023-03-17 11:14:12] [INFO ] Flatten gal took : 427 ms
[2023-03-17 11:14:13] [INFO ] Flatten gal took : 174 ms
[2023-03-17 11:14:13] [INFO ] Input system was already deterministic with 1531 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 585 ms. (steps per millisecond=17 ) properties (out of 24) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-17 11:14:14] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 306 cols
[2023-03-17 11:14:14] [INFO ] Computed 45 place invariants in 35 ms
[2023-03-17 11:14:14] [INFO ] [Real]Absence check using 24 positive place invariants in 20 ms returned sat
[2023-03-17 11:14:14] [INFO ] [Real]Absence check using 24 positive and 21 generalized place invariants in 17 ms returned sat
[2023-03-17 11:14:14] [INFO ] After 165ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA SafeBus-PT-10-LTLFireability-05 FALSE 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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p1)&&p0))))'
Support contains 153 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 27 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2023-03-17 11:14:15] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 11:14:15] [INFO ] Invariant cache hit.
[2023-03-17 11:14:15] [INFO ] Implicit Places using invariants in 379 ms returned []
[2023-03-17 11:14:15] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 11:14:15] [INFO ] Invariant cache hit.
[2023-03-17 11:14:16] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-17 11:14:17] [INFO ] Implicit Places using invariants and state equation in 1610 ms returned []
Implicit Place search using SMT with State Equation took 1998 ms to find 0 implicit places.
[2023-03-17 11:14:17] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 11:14:17] [INFO ] Invariant cache hit.
[2023-03-17 11:14:18] [INFO ] Dead Transitions using invariants and state equation in 1499 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3528 ms. Remains : 306/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 359 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : SafeBus-PT-10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (AND (GEQ s112 1) (GEQ s201 1) (GEQ s224 1) (GEQ s245 1)) (AND (GEQ s106 1) (GEQ s143 1) (GEQ s224 1) (GEQ s245 1)) (AND (GEQ s113 1) (GEQ s21...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1369 ms.
Product exploration explored 100000 steps with 33333 reset in 1046 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) p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) p1)
Knowledge based reduction with 4 factoid took 220 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SafeBus-PT-10-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SafeBus-PT-10-LTLFireability-00 finished in 6689 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(X(F(p0))))'
Support contains 20 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 45 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2023-03-17 11:14:22] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 11:14:22] [INFO ] Invariant cache hit.
[2023-03-17 11:14:23] [INFO ] Implicit Places using invariants in 978 ms returned [266, 267, 268, 269, 270, 271, 272, 273, 274, 275]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 1005 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 26 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1078 ms. Remains : 296/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-PT-10-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (AND (GEQ s96 1) (GEQ s268 1)) (AND (GEQ s97 1) (GEQ s269 1)) (AND (GEQ s100 1) (GEQ s272 1)) (AND (GEQ s101 1) (GEQ s273 1)) (AND (GEQ s94 1) (GEQ...], 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 3844 reset in 678 ms.
Product exploration explored 100000 steps with 3870 reset in 484 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 : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 112 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 19 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=9 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 112 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-17 11:14:25] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 296 cols
[2023-03-17 11:14:25] [INFO ] Computed 35 place invariants in 31 ms
[2023-03-17 11:14:26] [INFO ] [Real]Absence check using 14 positive place invariants in 19 ms returned sat
[2023-03-17 11:14:26] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 60 ms returned sat
[2023-03-17 11:14:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 11:14:27] [INFO ] [Real]Absence check using state equation in 814 ms returned sat
[2023-03-17 11:14:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 11:14:29] [INFO ] [Nat]Absence check using 14 positive place invariants in 15 ms returned sat
[2023-03-17 11:14:29] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 132 ms returned sat
[2023-03-17 11:14:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 11:14:30] [INFO ] [Nat]Absence check using state equation in 573 ms returned sat
[2023-03-17 11:14:30] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-17 11:14:30] [INFO ] [Nat]Added 111 Read/Feed constraints in 780 ms returned sat
[2023-03-17 11:14:31] [INFO ] Deduced a trap composed of 49 places in 160 ms of which 5 ms to minimize.
[2023-03-17 11:14:31] [INFO ] Deduced a trap composed of 41 places in 211 ms of which 2 ms to minimize.
[2023-03-17 11:14:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 522 ms
[2023-03-17 11:14:31] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 220 ms.
[2023-03-17 11:14:31] [INFO ] Added : 1 causal constraints over 1 iterations in 424 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 20 out of 296 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 21 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2023-03-17 11:14:31] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 11:14:31] [INFO ] Invariant cache hit.
[2023-03-17 11:14:32] [INFO ] Implicit Places using invariants in 941 ms returned []
[2023-03-17 11:14:32] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 11:14:32] [INFO ] Invariant cache hit.
[2023-03-17 11:14:33] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-17 11:14:35] [INFO ] Implicit Places using invariants and state equation in 2981 ms returned []
Implicit Place search using SMT with State Equation took 3930 ms to find 0 implicit places.
[2023-03-17 11:14:35] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 11:14:35] [INFO ] Invariant cache hit.
[2023-03-17 11:14:37] [INFO ] Dead Transitions using invariants and state equation in 1624 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5588 ms. Remains : 296/296 places, 1531/1531 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 : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 123 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 28 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=28 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 152 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-17 11:14:38] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 11:14:38] [INFO ] Invariant cache hit.
[2023-03-17 11:14:39] [INFO ] [Real]Absence check using 14 positive place invariants in 11 ms returned sat
[2023-03-17 11:14:39] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 30 ms returned sat
[2023-03-17 11:14:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 11:14:40] [INFO ] [Real]Absence check using state equation in 544 ms returned sat
[2023-03-17 11:14:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 11:14:41] [INFO ] [Nat]Absence check using 14 positive place invariants in 22 ms returned sat
[2023-03-17 11:14:41] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 42 ms returned sat
[2023-03-17 11:14:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 11:14:42] [INFO ] [Nat]Absence check using state equation in 708 ms returned sat
[2023-03-17 11:14:42] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-17 11:14:42] [INFO ] [Nat]Added 111 Read/Feed constraints in 186 ms returned sat
[2023-03-17 11:14:43] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 139 ms.
[2023-03-17 11:14:43] [INFO ] Added : 0 causal constraints over 0 iterations in 254 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3859 reset in 686 ms.
Product exploration explored 100000 steps with 3867 reset in 539 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 20 out of 296 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 394 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2023-03-17 11:14:45] [INFO ] Redundant transitions in 264 ms returned []
[2023-03-17 11:14:45] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 11:14:45] [INFO ] Invariant cache hit.
[2023-03-17 11:14:47] [INFO ] Dead Transitions using invariants and state equation in 1659 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2328 ms. Remains : 296/296 places, 1531/1531 transitions.
Support contains 20 out of 296 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 19 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2023-03-17 11:14:47] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 11:14:47] [INFO ] Invariant cache hit.
[2023-03-17 11:14:48] [INFO ] Implicit Places using invariants in 586 ms returned []
[2023-03-17 11:14:48] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 11:14:48] [INFO ] Invariant cache hit.
[2023-03-17 11:14:48] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-17 11:14:51] [INFO ] Implicit Places using invariants and state equation in 3219 ms returned []
Implicit Place search using SMT with State Equation took 3809 ms to find 0 implicit places.
[2023-03-17 11:14:51] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 11:14:51] [INFO ] Invariant cache hit.
[2023-03-17 11:14:52] [INFO ] Dead Transitions using invariants and state equation in 1188 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5035 ms. Remains : 296/296 places, 1531/1531 transitions.
Treatment of property SafeBus-PT-10-LTLFireability-01 finished in 30967 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&&G((p1 U (p0 U (!p2&&G(!p0))))))))'
Support contains 123 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 12 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2023-03-17 11:14:53] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 306 cols
[2023-03-17 11:14:53] [INFO ] Computed 45 place invariants in 15 ms
[2023-03-17 11:14:53] [INFO ] Implicit Places using invariants in 717 ms returned []
[2023-03-17 11:14:53] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 11:14:53] [INFO ] Invariant cache hit.
[2023-03-17 11:14:54] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-17 11:14:56] [INFO ] Implicit Places using invariants and state equation in 2819 ms returned []
Implicit Place search using SMT with State Equation took 3543 ms to find 0 implicit places.
[2023-03-17 11:14:56] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 11:14:56] [INFO ] Invariant cache hit.
[2023-03-17 11:14:58] [INFO ] Dead Transitions using invariants and state equation in 1899 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5459 ms. Remains : 306/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 504 ms :[true, true, true, (OR p0 p2), (OR p0 p2), (OR p0 p2), p0, p0]
Running random walk in product with property : SafeBus-PT-10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}, { cond=(AND p0 p1), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(OR p0 (NOT p2) p1), acceptance={} source=4 dest: 4}, { cond=(OR (AND p0 p1) (AND p2 p1)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(OR (AND p0 p1) (AND p2 p1)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=5 dest: 7}], [{ cond=p0, acceptance={} source=6 dest: 2}, { cond=(NOT p0), acceptance={} source=6 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=7 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(OR (AND (GEQ s3 1) (GEQ s240 1)) (AND (GEQ s3 1) (GEQ s239 1)) (AND (GEQ s3 1) (GEQ s238 1)) (AND (GEQ s3 1) (GEQ s237 1)) (AND (GEQ s3 1) (GEQ s244 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA SafeBus-PT-10-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-PT-10-LTLFireability-02 finished in 6019 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' '!(F((G(X(F(G(p0))))&&F((X(p1) U p2)))))'
Support contains 93 out of 306 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 213 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2023-03-17 11:14:59] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 11:14:59] [INFO ] Invariant cache hit.
[2023-03-17 11:15:00] [INFO ] Implicit Places using invariants in 850 ms returned [266, 267, 268, 269, 270, 271, 272, 273, 274, 275]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 854 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 0 place count 296 transition count 1521
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 286 transition count 1521
Applied a total of 20 rules in 214 ms. Remains 286 /296 variables (removed 10) and now considering 1521/1531 (removed 10) transitions.
[2023-03-17 11:15:00] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
// Phase 1: matrix 632 rows 286 cols
[2023-03-17 11:15:00] [INFO ] Computed 35 place invariants in 8 ms
[2023-03-17 11:15:01] [INFO ] Implicit Places using invariants in 740 ms returned []
[2023-03-17 11:15:01] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2023-03-17 11:15:01] [INFO ] Invariant cache hit.
[2023-03-17 11:15:01] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-17 11:15:03] [INFO ] Implicit Places using invariants and state equation in 2796 ms returned []
Implicit Place search using SMT with State Equation took 3539 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 286/306 places, 1521/1531 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4822 ms. Remains : 286/306 places, 1521/1531 transitions.
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2)]
Running random walk in product with property : SafeBus-PT-10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (GEQ s0 1) (GEQ s1 1)), p0:(AND (OR (LT s2 1) (LT s49 1)) (OR (LT s2 1) (LT s47 1)) (OR (LT s2 1) (LT s53 1)) (OR (LT s2 1) (LT s51 1)) (OR (LT s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 4 reset in 1927 ms.
Stack based approach found an accepted trace after 410 steps with 1 reset with depth 347 and stack size 347 in 8 ms.
FORMULA SafeBus-PT-10-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-PT-10-LTLFireability-03 finished in 6945 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' '!(((F(G(p0)) U !p1)&&F((G(F(!p2))||(F(!p2)&&G(!p3))))))'
Support contains 142 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 220 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2023-03-17 11:15:06] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 306 cols
[2023-03-17 11:15:06] [INFO ] Computed 45 place invariants in 10 ms
[2023-03-17 11:15:06] [INFO ] Implicit Places using invariants in 614 ms returned []
[2023-03-17 11:15:06] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 11:15:06] [INFO ] Invariant cache hit.
[2023-03-17 11:15:07] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-17 11:15:09] [INFO ] Implicit Places using invariants and state equation in 2432 ms returned []
Implicit Place search using SMT with State Equation took 3048 ms to find 0 implicit places.
[2023-03-17 11:15:09] [INFO ] Redundant transitions in 62 ms returned []
[2023-03-17 11:15:09] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 11:15:09] [INFO ] Invariant cache hit.
[2023-03-17 11:15:11] [INFO ] Dead Transitions using invariants and state equation in 1960 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5302 ms. Remains : 306/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 334 ms :[(OR p1 p2), (NOT p0), p1, p2, (AND p3 p2), p2]
Running random walk in product with property : SafeBus-PT-10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=p3, acceptance={} source=0 dest: 3}, { cond=(NOT p3), acceptance={} source=0 dest: 4}, { cond=p2, acceptance={} source=0 dest: 5}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=p3, acceptance={} source=3 dest: 3}, { cond=(NOT p3), acceptance={} source=3 dest: 4}, { cond=p2, acceptance={} source=3 dest: 5}], [{ cond=p3, acceptance={} source=4 dest: 3}, { cond=(NOT p3), acceptance={} source=4 dest: 4}, { cond=(AND p2 p3), acceptance={} source=4 dest: 5}], [{ cond=p2, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(OR (AND (GEQ s252 1) (GEQ s272 1)) (AND (GEQ s255 1) (GEQ s275 1)) (AND (GEQ s246 1) (GEQ s266 1)) (AND (GEQ s253 1) (GEQ s273 1)) (AND (GEQ s252 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 1465 reset in 1041 ms.
Product exploration explored 100000 steps with 1470 reset in 1277 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 p1) (NOT p3) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p2 p3))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p2 p3)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 10 factoid took 645 ms. Reduced automaton from 6 states, 16 edges and 4 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 225 ms :[(AND p3 p2), p2, (AND p3 p2), p2]
Finished random walk after 27 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p2 p3))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p2 p3)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F p3), (F (AND p3 p2)), (F p2)]
Knowledge based reduction with 10 factoid took 714 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[(AND p3 p2), p2, (AND p3 p2), p2]
Stuttering acceptance computed with spot in 210 ms :[(AND p3 p2), p2, (AND p3 p2), p2]
Support contains 40 out of 306 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 10 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2023-03-17 11:15:16] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 11:15:16] [INFO ] Invariant cache hit.
[2023-03-17 11:15:16] [INFO ] Implicit Places using invariants in 585 ms returned []
[2023-03-17 11:15:16] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 11:15:16] [INFO ] Invariant cache hit.
[2023-03-17 11:15:17] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-17 11:15:18] [INFO ] Implicit Places using invariants and state equation in 2341 ms returned []
Implicit Place search using SMT with State Equation took 2938 ms to find 0 implicit places.
[2023-03-17 11:15:19] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 11:15:19] [INFO ] Invariant cache hit.
[2023-03-17 11:15:20] [INFO ] Dead Transitions using invariants and state equation in 1774 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4725 ms. Remains : 306/306 places, 1531/1531 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 p3) (NOT p2)), (X (NOT p3)), (X (NOT (AND p3 p2))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p3 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 348 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(AND p3 p2), p2, (AND p3 p2), p2]
Finished random walk after 26 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND (NOT p3) (NOT p2)), (X (NOT p3)), (X (NOT (AND p3 p2))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p3 p2))))]
False Knowledge obtained : [(F p3), (F (AND p2 p3)), (F p2)]
Knowledge based reduction with 6 factoid took 547 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(AND p3 p2), p2, (AND p3 p2), p2]
Stuttering acceptance computed with spot in 209 ms :[(AND p3 p2), p2, (AND p3 p2), p2]
Stuttering acceptance computed with spot in 210 ms :[(AND p3 p2), p2, (AND p3 p2), p2]
Product exploration explored 100000 steps with 1512 reset in 1049 ms.
Product exploration explored 100000 steps with 1559 reset in 761 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 179 ms :[(AND p3 p2), p2, (AND p3 p2), p2]
Support contains 40 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 227 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2023-03-17 11:15:25] [INFO ] Redundant transitions in 46 ms returned []
[2023-03-17 11:15:25] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 11:15:25] [INFO ] Invariant cache hit.
[2023-03-17 11:15:26] [INFO ] Dead Transitions using invariants and state equation in 1774 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2057 ms. Remains : 306/306 places, 1531/1531 transitions.
Support contains 40 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 10 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2023-03-17 11:15:26] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 11:15:26] [INFO ] Invariant cache hit.
[2023-03-17 11:15:27] [INFO ] Implicit Places using invariants in 656 ms returned []
[2023-03-17 11:15:27] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 11:15:27] [INFO ] Invariant cache hit.
[2023-03-17 11:15:27] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-17 11:15:30] [INFO ] Implicit Places using invariants and state equation in 2743 ms returned []
Implicit Place search using SMT with State Equation took 3402 ms to find 0 implicit places.
[2023-03-17 11:15:30] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 11:15:30] [INFO ] Invariant cache hit.
[2023-03-17 11:15:31] [INFO ] Dead Transitions using invariants and state equation in 1539 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4953 ms. Remains : 306/306 places, 1531/1531 transitions.
Treatment of property SafeBus-PT-10-LTLFireability-04 finished in 25861 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' '!((G((X(!p0) U ((!p1&&X(!p0))||X(G(!p0)))))||(F((F(!p2)&&X(!p3)))&&(X(!p0) U ((!p1&&X(!p0))||X(G(!p0)))))))'
Support contains 60 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 9 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2023-03-17 11:15:31] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 11:15:31] [INFO ] Invariant cache hit.
[2023-03-17 11:15:32] [INFO ] Implicit Places using invariants in 909 ms returned []
[2023-03-17 11:15:32] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 11:15:32] [INFO ] Invariant cache hit.
[2023-03-17 11:15:33] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-17 11:15:35] [INFO ] Implicit Places using invariants and state equation in 2539 ms returned []
Implicit Place search using SMT with State Equation took 3454 ms to find 0 implicit places.
[2023-03-17 11:15:35] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 11:15:35] [INFO ] Invariant cache hit.
[2023-03-17 11:15:37] [INFO ] Dead Transitions using invariants and state equation in 1940 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5412 ms. Remains : 306/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 690 ms :[p0, p0, (AND p0 p3), (AND p0 p2), p0, true, (AND p0 p3), (AND p2 p0), (AND p0 p3), (AND p0 p2), p3, p2]
Running random walk in product with property : SafeBus-PT-10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}, { cond=p1, acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={} source=1 dest: 5}], [{ cond=p3, acceptance={} source=2 dest: 2}, { cond=(AND p2 p3), acceptance={} source=2 dest: 3}, { cond=p3, acceptance={} source=2 dest: 6}, { cond=(AND p2 p3), acceptance={} source=2 dest: 7}, { cond=(AND p1 p3), acceptance={} source=2 dest: 8}, { cond=(AND p1 p2 p3), acceptance={} source=2 dest: 9}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=p2, acceptance={} source=3 dest: 7}, { cond=(AND p1 p2), acceptance={} source=3 dest: 9}], [{ cond=true, acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 4}, { cond=(AND p1 p0), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p0 p3), acceptance={} source=6 dest: 10}, { cond=(AND p2 p0 p3), acceptance={} source=6 dest: 11}], [{ cond=(AND p2 p0), acceptance={} source=7 dest: 11}], [{ cond=p3, acceptance={} source=8 dest: 6}, { cond=(AND p2 p3), acceptance={} source=8 dest: 7}, { cond=(AND p1 (NOT p0) p3), acceptance={} source=8 dest: 8}, { cond=(AND p1 p0 p3), acceptance={0} source=8 dest: 8}, { cond=(AND p1 p2 p3), acceptance={} source=8 dest: 9}], [{ cond=p2, acceptance={} source=9 dest: 7}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=9 dest: 9}, { cond=(AND p1 p2 p0), acceptance={0} source=9 dest: 9}], [{ cond=p3, acceptance={0} source=10 dest: 10}, { cond=(AND p2 p3), acceptance={} source=10 dest: 11}], [{ cond=p2, acceptance={0} source=11 dest: 11}]], initial=0, aps=[p2:(OR (AND (GEQ s286 1) (GEQ s303 1)) (AND (GEQ s295 1) (GEQ s299 1)) (AND (GEQ s291 1) (GEQ s300 1)) (AND (GEQ s295 1) (GEQ s303 1)) (AND (GEQ s291 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA SafeBus-PT-10-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-PT-10-LTLFireability-06 finished in 6163 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(X(X((p0||X(F(p1)))))))'
Support contains 22 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 10 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2023-03-17 11:15:38] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 11:15:38] [INFO ] Invariant cache hit.
[2023-03-17 11:15:39] [INFO ] Implicit Places using invariants in 1099 ms returned [266, 267, 268, 269, 270, 271, 272, 273, 274, 275]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 1102 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 10 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1123 ms. Remains : 296/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 267 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SafeBus-PT-10-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(AND (GEQ s0 1) (GEQ s1 1)), p1:(OR (AND (GEQ s100 1) (GEQ s262 1)) (AND (GEQ s95 1) (GEQ s257 1)) (AND (GEQ s96 1) (GEQ s258 1)) (AND (GEQ s97 1) (GEQ...], 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, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2240 reset in 970 ms.
Stack based approach found an accepted trace after 4381 steps with 97 reset with depth 155 and stack size 155 in 30 ms.
FORMULA SafeBus-PT-10-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-PT-10-LTLFireability-07 finished in 2419 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(p1)&&p0)))'
Support contains 4 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 7 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2023-03-17 11:15:40] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 11:15:40] [INFO ] Invariant cache hit.
[2023-03-17 11:15:41] [INFO ] Implicit Places using invariants in 1040 ms returned [266, 267, 268, 269, 270, 271, 272, 273, 274, 275]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 1046 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 10 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1063 ms. Remains : 296/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 174 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : SafeBus-PT-10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(OR (LT s101 1) (LT s263 1)), p0:(AND (GEQ s3 1) (GEQ s237 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA SafeBus-PT-10-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-PT-10-LTLFireability-08 finished in 1265 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' '!(F(G(p0)))'
Support contains 2 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 195 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2023-03-17 11:15:41] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 11:15:41] [INFO ] Invariant cache hit.
[2023-03-17 11:15:43] [INFO ] Implicit Places using invariants in 1161 ms returned [266, 267, 268, 269, 270, 271, 272, 273, 274, 275]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 1164 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 0 place count 296 transition count 1521
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 286 transition count 1521
Applied a total of 20 rules in 189 ms. Remains 286 /296 variables (removed 10) and now considering 1521/1531 (removed 10) transitions.
[2023-03-17 11:15:43] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
// Phase 1: matrix 632 rows 286 cols
[2023-03-17 11:15:43] [INFO ] Computed 35 place invariants in 9 ms
[2023-03-17 11:15:44] [INFO ] Implicit Places using invariants in 936 ms returned []
[2023-03-17 11:15:44] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2023-03-17 11:15:44] [INFO ] Invariant cache hit.
[2023-03-17 11:15:44] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-17 11:15:47] [INFO ] Implicit Places using invariants and state equation in 3063 ms returned []
Implicit Place search using SMT with State Equation took 4002 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 286/306 places, 1521/1531 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5552 ms. Remains : 286/306 places, 1521/1531 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : SafeBus-PT-10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s256 1) (LT s270 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 902 ms.
Stack based approach found an accepted trace after 1530 steps with 0 reset with depth 1531 and stack size 1496 in 11 ms.
FORMULA SafeBus-PT-10-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-PT-10-LTLFireability-09 finished in 6539 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' '!(F(G(p0)))'
Support contains 4 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 112 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2023-03-17 11:15:48] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 306 cols
[2023-03-17 11:15:48] [INFO ] Computed 45 place invariants in 10 ms
[2023-03-17 11:15:49] [INFO ] Implicit Places using invariants in 938 ms returned [266, 267, 268, 269, 270, 271, 272, 273, 274, 275]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 940 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 0 place count 296 transition count 1521
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 286 transition count 1521
Applied a total of 20 rules in 198 ms. Remains 286 /296 variables (removed 10) and now considering 1521/1531 (removed 10) transitions.
[2023-03-17 11:15:49] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
// Phase 1: matrix 632 rows 286 cols
[2023-03-17 11:15:49] [INFO ] Computed 35 place invariants in 8 ms
[2023-03-17 11:15:50] [INFO ] Implicit Places using invariants in 818 ms returned []
[2023-03-17 11:15:50] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2023-03-17 11:15:50] [INFO ] Invariant cache hit.
[2023-03-17 11:15:50] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-17 11:15:53] [INFO ] Implicit Places using invariants and state equation in 3177 ms returned []
Implicit Place search using SMT with State Equation took 4006 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 286/306 places, 1521/1531 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5258 ms. Remains : 286/306 places, 1521/1531 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : SafeBus-PT-10-LTLFireability-10 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 (GEQ s105 1) (GEQ s125 1) (GEQ s218 1) (GEQ s224 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 1045 ms.
Stack based approach found an accepted trace after 391 steps with 0 reset with depth 392 and stack size 392 in 5 ms.
FORMULA SafeBus-PT-10-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-PT-10-LTLFireability-10 finished in 6378 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) U (p1||X(G(p1)))) U p2)))'
Support contains 8 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 9 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2023-03-17 11:15:54] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 306 cols
[2023-03-17 11:15:54] [INFO ] Computed 45 place invariants in 5 ms
[2023-03-17 11:15:55] [INFO ] Implicit Places using invariants in 955 ms returned [266, 267, 268, 269, 270, 271, 272, 273, 274, 275]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 958 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 9 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 976 ms. Remains : 296/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 350 ms :[(NOT p2), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), true, (NOT p0)]
Running random walk in product with property : SafeBus-PT-10-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s99 1)), p1:(AND (GEQ s106 1) (GEQ s139 1) (GEQ s218 1) (GEQ s224 1)), p0:(AND (GEQ s0 1) (GEQ s60 1) (GEQ s224 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SafeBus-PT-10-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-PT-10-LTLFireability-11 finished in 1351 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' '!(G(F(p0)))'
Support contains 3 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 164 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2023-03-17 11:15:56] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 11:15:56] [INFO ] Invariant cache hit.
[2023-03-17 11:15:57] [INFO ] Implicit Places using invariants in 1062 ms returned [266, 267, 268, 269, 270, 271, 272, 273, 274, 275]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 1065 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 0 place count 296 transition count 1521
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 286 transition count 1521
Applied a total of 20 rules in 175 ms. Remains 286 /296 variables (removed 10) and now considering 1521/1531 (removed 10) transitions.
[2023-03-17 11:15:57] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
// Phase 1: matrix 632 rows 286 cols
[2023-03-17 11:15:57] [INFO ] Computed 35 place invariants in 8 ms
[2023-03-17 11:15:58] [INFO ] Implicit Places using invariants in 878 ms returned []
[2023-03-17 11:15:58] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2023-03-17 11:15:58] [INFO ] Invariant cache hit.
[2023-03-17 11:15:58] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-17 11:16:01] [INFO ] Implicit Places using invariants and state equation in 3049 ms returned []
Implicit Place search using SMT with State Equation took 3929 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 286/306 places, 1521/1531 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5334 ms. Remains : 286/306 places, 1521/1531 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-PT-10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s65 1) (GEQ s224 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 105 reset in 1027 ms.
Stack based approach found an accepted trace after 288 steps with 0 reset with depth 289 and stack size 289 in 2 ms.
FORMULA SafeBus-PT-10-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-PT-10-LTLFireability-13 finished in 6479 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(X(X(X(G(p0))))))'
Support contains 2 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 6 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2023-03-17 11:16:02] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 306 cols
[2023-03-17 11:16:02] [INFO ] Computed 45 place invariants in 5 ms
[2023-03-17 11:16:03] [INFO ] Implicit Places using invariants in 1047 ms returned [266, 267, 268, 269, 270, 271, 272, 273, 274, 275]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 1051 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 8 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1066 ms. Remains : 296/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 370 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-PT-10-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(OR (LT s103 1) (LT s275 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, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 133 steps with 0 reset in 1 ms.
FORMULA SafeBus-PT-10-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-PT-10-LTLFireability-15 finished in 1458 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(X(F(p0))))'
Found a Shortening insensitive property : SafeBus-PT-10-LTLFireability-01
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 20 out of 306 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 30 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2023-03-17 11:16:04] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 11:16:04] [INFO ] Invariant cache hit.
[2023-03-17 11:16:05] [INFO ] Implicit Places using invariants in 1010 ms returned [266, 267, 268, 269, 270, 271, 272, 273, 274, 275]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 1015 ms to find 10 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 26 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1073 ms. Remains : 296/306 places, 1531/1531 transitions.
Running random walk in product with property : SafeBus-PT-10-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (AND (GEQ s96 1) (GEQ s268 1)) (AND (GEQ s97 1) (GEQ s269 1)) (AND (GEQ s100 1) (GEQ s272 1)) (AND (GEQ s101 1) (GEQ s273 1)) (AND (GEQ s94 1) (GEQ...], 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 3872 reset in 756 ms.
Product exploration explored 100000 steps with 3863 reset in 778 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 : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 127 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 30 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=15 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 151 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-17 11:16:07] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 296 cols
[2023-03-17 11:16:07] [INFO ] Computed 35 place invariants in 8 ms
[2023-03-17 11:16:09] [INFO ] [Real]Absence check using 14 positive place invariants in 17 ms returned sat
[2023-03-17 11:16:09] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 58 ms returned sat
[2023-03-17 11:16:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 11:16:10] [INFO ] [Real]Absence check using state equation in 839 ms returned sat
[2023-03-17 11:16:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 11:16:11] [INFO ] [Nat]Absence check using 14 positive place invariants in 12 ms returned sat
[2023-03-17 11:16:11] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 114 ms returned sat
[2023-03-17 11:16:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 11:16:12] [INFO ] [Nat]Absence check using state equation in 675 ms returned sat
[2023-03-17 11:16:12] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-17 11:16:13] [INFO ] [Nat]Added 111 Read/Feed constraints in 722 ms returned sat
[2023-03-17 11:16:13] [INFO ] Deduced a trap composed of 49 places in 182 ms of which 3 ms to minimize.
[2023-03-17 11:16:13] [INFO ] Deduced a trap composed of 41 places in 186 ms of which 2 ms to minimize.
[2023-03-17 11:16:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 507 ms
[2023-03-17 11:16:13] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 108 ms.
[2023-03-17 11:16:13] [INFO ] Added : 1 causal constraints over 1 iterations in 287 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 20 out of 296 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 9 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2023-03-17 11:16:13] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 11:16:13] [INFO ] Invariant cache hit.
[2023-03-17 11:16:14] [INFO ] Implicit Places using invariants in 692 ms returned []
[2023-03-17 11:16:14] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 11:16:14] [INFO ] Invariant cache hit.
[2023-03-17 11:16:15] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-17 11:16:17] [INFO ] Implicit Places using invariants and state equation in 2913 ms returned []
Implicit Place search using SMT with State Equation took 3609 ms to find 0 implicit places.
[2023-03-17 11:16:17] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 11:16:17] [INFO ] Invariant cache hit.
[2023-03-17 11:16:19] [INFO ] Dead Transitions using invariants and state equation in 1762 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5381 ms. Remains : 296/296 places, 1531/1531 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 : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 176 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 24 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=24 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 138 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-17 11:16:20] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 11:16:20] [INFO ] Invariant cache hit.
[2023-03-17 11:16:21] [INFO ] [Real]Absence check using 14 positive place invariants in 11 ms returned sat
[2023-03-17 11:16:21] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 31 ms returned sat
[2023-03-17 11:16:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 11:16:22] [INFO ] [Real]Absence check using state equation in 599 ms returned sat
[2023-03-17 11:16:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 11:16:23] [INFO ] [Nat]Absence check using 14 positive place invariants in 12 ms returned sat
[2023-03-17 11:16:23] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 28 ms returned sat
[2023-03-17 11:16:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 11:16:24] [INFO ] [Nat]Absence check using state equation in 596 ms returned sat
[2023-03-17 11:16:24] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-17 11:16:24] [INFO ] [Nat]Added 111 Read/Feed constraints in 195 ms returned sat
[2023-03-17 11:16:24] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 109 ms.
[2023-03-17 11:16:24] [INFO ] Added : 0 causal constraints over 0 iterations in 241 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3855 reset in 619 ms.
Product exploration explored 100000 steps with 3858 reset in 470 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 20 out of 296 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 164 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2023-03-17 11:16:26] [INFO ] Redundant transitions in 46 ms returned []
[2023-03-17 11:16:26] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 11:16:26] [INFO ] Invariant cache hit.
[2023-03-17 11:16:27] [INFO ] Dead Transitions using invariants and state equation in 1525 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1755 ms. Remains : 296/296 places, 1531/1531 transitions.
Support contains 20 out of 296 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 6 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2023-03-17 11:16:28] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 11:16:28] [INFO ] Invariant cache hit.
[2023-03-17 11:16:28] [INFO ] Implicit Places using invariants in 916 ms returned []
[2023-03-17 11:16:28] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 11:16:28] [INFO ] Invariant cache hit.
[2023-03-17 11:16:29] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-17 11:16:32] [INFO ] Implicit Places using invariants and state equation in 3133 ms returned []
Implicit Place search using SMT with State Equation took 4051 ms to find 0 implicit places.
[2023-03-17 11:16:32] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 11:16:32] [INFO ] Invariant cache hit.
[2023-03-17 11:16:33] [INFO ] Dead Transitions using invariants and state equation in 1540 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5598 ms. Remains : 296/296 places, 1531/1531 transitions.
Treatment of property SafeBus-PT-10-LTLFireability-01 finished in 29843 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' '!(((F(G(p0)) U !p1)&&F((G(F(!p2))||(F(!p2)&&G(!p3))))))'
[2023-03-17 11:16:34] [INFO ] Flatten gal took : 180 ms
[2023-03-17 11:16:34] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 10 ms.
[2023-03-17 11:16:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 306 places, 1531 transitions and 10404 arcs took 22 ms.
Total runtime 146941 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT SafeBus-PT-10
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLFireability

FORMULA SafeBus-PT-10-LTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-PT-10-LTLFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679051798648

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 LTLFireability -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/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:427
lola: rewrite Frontend/Parser/formula_rewrite.k:535
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 8 (type EXCL) for 3 SafeBus-PT-10-LTLFireability-04
lola: time limit : 1199 sec
lola: memory limit: 32 pages
lola: FINISHED task # 8 (type EXCL) for SafeBus-PT-10-LTLFireability-04
lola: result : false
lola: markings : 99
lola: fired transitions : 99
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 SafeBus-PT-10-LTLFireability-01
lola: time limit : 3597 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for SafeBus-PT-10-LTLFireability-01
lola: result : false
lola: markings : 27974
lola: fired transitions : 114440
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SafeBus-PT-10-LTLFireability-01: LTL false LTL model checker
SafeBus-PT-10-LTLFireability-04: CONJ false LTL model checker


Time elapsed: 3 secs. Pages in use: 1

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="SafeBus-PT-10"
export BK_EXAMINATION="LTLFireability"
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 SafeBus-PT-10, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r359-smll-167891808700276"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SafeBus-PT-10.tgz
mv SafeBus-PT-10 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;