About the Execution of ITS-Tools for RefineWMG-PT-007007
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 7522.075 | 748352.00 | 1177921.00 | 2190.10 | FFTFFFFTTFFFTTFF | 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.r325-tall-167889197400563.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 itstools
Input is RefineWMG-PT-007007, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r325-tall-167889197400563
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.8K Feb 26 16:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 26 16:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 15:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 15:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 16:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 16:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Feb 26 16:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 26 16:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 26 16:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 18K 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 RefineWMG-PT-007007-LTLCardinality-00
FORMULA_NAME RefineWMG-PT-007007-LTLCardinality-01
FORMULA_NAME RefineWMG-PT-007007-LTLCardinality-02
FORMULA_NAME RefineWMG-PT-007007-LTLCardinality-03
FORMULA_NAME RefineWMG-PT-007007-LTLCardinality-04
FORMULA_NAME RefineWMG-PT-007007-LTLCardinality-05
FORMULA_NAME RefineWMG-PT-007007-LTLCardinality-06
FORMULA_NAME RefineWMG-PT-007007-LTLCardinality-07
FORMULA_NAME RefineWMG-PT-007007-LTLCardinality-08
FORMULA_NAME RefineWMG-PT-007007-LTLCardinality-09
FORMULA_NAME RefineWMG-PT-007007-LTLCardinality-10
FORMULA_NAME RefineWMG-PT-007007-LTLCardinality-11
FORMULA_NAME RefineWMG-PT-007007-LTLCardinality-12
FORMULA_NAME RefineWMG-PT-007007-LTLCardinality-13
FORMULA_NAME RefineWMG-PT-007007-LTLCardinality-14
FORMULA_NAME RefineWMG-PT-007007-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679017647865
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=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RefineWMG-PT-007007
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-17 01:47:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-17 01:47:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 01:47:29] [INFO ] Load time of PNML (sax parser for PT used): 26 ms
[2023-03-17 01:47:29] [INFO ] Transformed 39 places.
[2023-03-17 01:47:29] [INFO ] Transformed 31 transitions.
[2023-03-17 01:47:29] [INFO ] Parsed PT model containing 39 places and 31 transitions and 92 arcs in 84 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA RefineWMG-PT-007007-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-007007-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 31/31 transitions.
Applied a total of 0 rules in 9 ms. Remains 39 /39 variables (removed 0) and now considering 31/31 (removed 0) transitions.
// Phase 1: matrix 31 rows 39 cols
[2023-03-17 01:47:29] [INFO ] Computed 16 place invariants in 7 ms
[2023-03-17 01:47:29] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
[2023-03-17 01:47:29] [INFO ] Invariant cache hit.
[2023-03-17 01:47:29] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-17 01:47:29] [INFO ] Invariant cache hit.
[2023-03-17 01:47:29] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2023-03-17 01:47:29] [INFO ] Invariant cache hit.
[2023-03-17 01:47:29] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 307 ms. Remains : 39/39 places, 31/31 transitions.
Support contains 25 out of 39 places after structural reductions.
[2023-03-17 01:47:30] [INFO ] Flatten gal took : 17 ms
[2023-03-17 01:47:30] [INFO ] Flatten gal took : 5 ms
[2023-03-17 01:47:30] [INFO ] Input system was already deterministic with 31 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 24) seen :22
Finished Best-First random walk after 1849 steps, including 0 resets, run visited all 2 properties in 7 ms. (steps per millisecond=264 )
FORMULA RefineWMG-PT-007007-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA RefineWMG-PT-007007-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA RefineWMG-PT-007007-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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' '!(G(F(((G(p0) U p1)||G(p2)))))'
Support contains 3 out of 39 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 : 39/39 places, 31/31 transitions.
Graph (trivial) has 16 edges and 39 vertex of which 10 / 39 are part of one of the 5 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 29 transition count 22
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 23 place count 17 transition count 16
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 3 rules applied. Total rules applied 26 place count 17 transition count 13
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 29 place count 14 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 31 place count 13 transition count 12
Applied a total of 31 rules in 10 ms. Remains 13 /39 variables (removed 26) and now considering 12/31 (removed 19) transitions.
// Phase 1: matrix 12 rows 13 cols
[2023-03-17 01:47:30] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-17 01:47:30] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
[2023-03-17 01:47:30] [INFO ] Invariant cache hit.
[2023-03-17 01:47:30] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-17 01:47:30] [INFO ] Invariant cache hit.
[2023-03-17 01:47:30] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-17 01:47:30] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-17 01:47:30] [INFO ] Invariant cache hit.
[2023-03-17 01:47:30] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/39 places, 12/31 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 133 ms. Remains : 13/39 places, 12/31 transitions.
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-007007-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(LEQ 2 s6), p1:(AND (LEQ 1 s0) (LEQ 2 s11))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 13358 steps with 0 reset in 56 ms.
FORMULA RefineWMG-PT-007007-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-007007-LTLCardinality-00 finished in 431 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||(F(p1)&&(p1||G(p2))))))'
Support contains 4 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 31/31 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 31/31 (removed 0) transitions.
// Phase 1: matrix 31 rows 39 cols
[2023-03-17 01:47:30] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-17 01:47:30] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2023-03-17 01:47:30] [INFO ] Invariant cache hit.
[2023-03-17 01:47:31] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-17 01:47:31] [INFO ] Invariant cache hit.
[2023-03-17 01:47:31] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2023-03-17 01:47:31] [INFO ] Invariant cache hit.
[2023-03-17 01:47:31] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 183 ms. Remains : 39/39 places, 31/31 transitions.
Stuttering acceptance computed with spot in 418 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p1)), true, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-007007-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 p2), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p2:(GT 2 s23), p0:(GT s20 s13), p1:(LEQ 2 s3)], 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]]
Entered a terminal (fully accepting) state of product in 36 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-007007-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-007007-LTLCardinality-03 finished in 618 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(p0)&&X(F(p1))))'
Support contains 2 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 31/31 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 31/31 (removed 0) transitions.
[2023-03-17 01:47:31] [INFO ] Invariant cache hit.
[2023-03-17 01:47:31] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
[2023-03-17 01:47:31] [INFO ] Invariant cache hit.
[2023-03-17 01:47:31] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-17 01:47:31] [INFO ] Invariant cache hit.
[2023-03-17 01:47:31] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-03-17 01:47:31] [INFO ] Invariant cache hit.
[2023-03-17 01:47:31] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 143 ms. Remains : 39/39 places, 31/31 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-007007-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GT 2 s22), p1:(GT 1 s27)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 523 reset in 230 ms.
Stack based approach found an accepted trace after 32 steps with 0 reset with depth 33 and stack size 33 in 0 ms.
FORMULA RefineWMG-PT-007007-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-007007-LTLCardinality-06 finished in 498 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 31/31 transitions.
Applied a total of 0 rules in 2 ms. Remains 39 /39 variables (removed 0) and now considering 31/31 (removed 0) transitions.
[2023-03-17 01:47:32] [INFO ] Invariant cache hit.
[2023-03-17 01:47:32] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
[2023-03-17 01:47:32] [INFO ] Invariant cache hit.
[2023-03-17 01:47:32] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-17 01:47:32] [INFO ] Invariant cache hit.
[2023-03-17 01:47:32] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-03-17 01:47:32] [INFO ] Invariant cache hit.
[2023-03-17 01:47:32] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 146 ms. Remains : 39/39 places, 31/31 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-007007-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 3 s21)], 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 122 ms.
Product exploration explored 100000 steps with 50000 reset in 134 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RefineWMG-PT-007007-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RefineWMG-PT-007007-LTLCardinality-07 finished in 561 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(F(p1)))&&(p0||F(!p1)))))'
Support contains 2 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 31/31 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 31/31 (removed 0) transitions.
[2023-03-17 01:47:32] [INFO ] Invariant cache hit.
[2023-03-17 01:47:32] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
[2023-03-17 01:47:32] [INFO ] Invariant cache hit.
[2023-03-17 01:47:32] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-17 01:47:32] [INFO ] Invariant cache hit.
[2023-03-17 01:47:32] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-03-17 01:47:32] [INFO ] Invariant cache hit.
[2023-03-17 01:47:32] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 131 ms. Remains : 39/39 places, 31/31 transitions.
Stuttering acceptance computed with spot in 224 ms :[(NOT p0), (NOT p0), (NOT p1), (NOT p1), p1]
Running random walk in product with property : RefineWMG-PT-007007-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=p1, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 2 s14), p1:(LEQ 1 s30)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2535 reset in 138 ms.
Stack based approach found an accepted trace after 22 steps with 1 reset with depth 17 and stack size 17 in 0 ms.
FORMULA RefineWMG-PT-007007-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-007007-LTLCardinality-09 finished in 511 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 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 31/31 transitions.
Graph (trivial) has 19 edges and 39 vertex of which 12 / 39 are part of one of the 6 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 27 transition count 20
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 1 with 21 rules applied. Total rules applied 27 place count 13 transition count 13
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 4 rules applied. Total rules applied 31 place count 13 transition count 9
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 35 place count 9 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 35 place count 9 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 37 place count 8 transition count 8
Applied a total of 37 rules in 10 ms. Remains 8 /39 variables (removed 31) and now considering 8/31 (removed 23) transitions.
// Phase 1: matrix 8 rows 8 cols
[2023-03-17 01:47:33] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-17 01:47:33] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
[2023-03-17 01:47:33] [INFO ] Invariant cache hit.
[2023-03-17 01:47:33] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-17 01:47:33] [INFO ] Invariant cache hit.
[2023-03-17 01:47:33] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2023-03-17 01:47:33] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-17 01:47:33] [INFO ] Invariant cache hit.
[2023-03-17 01:47:33] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/39 places, 8/31 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 117 ms. Remains : 8/39 places, 8/31 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-007007-LTLCardinality-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:(LEQ s5 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 68 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-007007-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-007007-LTLCardinality-10 finished in 170 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||(G(p1) U G(p2))))))'
Support contains 3 out of 39 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 31/31 transitions.
Applied a total of 0 rules in 2 ms. Remains 39 /39 variables (removed 0) and now considering 31/31 (removed 0) transitions.
// Phase 1: matrix 31 rows 39 cols
[2023-03-17 01:47:33] [INFO ] Computed 16 place invariants in 4 ms
[2023-03-17 01:47:33] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
[2023-03-17 01:47:33] [INFO ] Invariant cache hit.
[2023-03-17 01:47:33] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-17 01:47:33] [INFO ] Invariant cache hit.
[2023-03-17 01:47:33] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-17 01:47:33] [INFO ] Invariant cache hit.
[2023-03-17 01:47:33] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 121 ms. Remains : 39/39 places, 31/31 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-007007-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p2:(LEQ 2 s21), p0:(GT s34 s13)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 574 reset in 167 ms.
Product exploration explored 100000 steps with 598 reset in 178 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 p2 (NOT p0)), (X (AND p2 (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0)))))]
Knowledge based reduction with 4 factoid took 170 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 395 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=131 )
Knowledge obtained : [(AND p2 (NOT p0)), (X (AND p2 (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (F (NOT (AND (NOT p0) p2))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 4 factoid took 284 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 39 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 31/31 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 31/31 (removed 0) transitions.
[2023-03-17 01:47:34] [INFO ] Invariant cache hit.
[2023-03-17 01:47:34] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
[2023-03-17 01:47:34] [INFO ] Invariant cache hit.
[2023-03-17 01:47:34] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-17 01:47:34] [INFO ] Invariant cache hit.
[2023-03-17 01:47:34] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-03-17 01:47:34] [INFO ] Invariant cache hit.
[2023-03-17 01:47:34] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 137 ms. Remains : 39/39 places, 31/31 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p2), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2))))]
Knowledge based reduction with 4 factoid took 164 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 3717 steps, including 1 resets, run visited all 2 properties in 5 ms. (steps per millisecond=743 )
Knowledge obtained : [(AND (NOT p0) p2), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (F (NOT (AND (NOT p0) p2))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 4 factoid took 285 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 606 reset in 168 ms.
Product exploration explored 100000 steps with 562 reset in 211 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 31/31 transitions.
Graph (trivial) has 18 edges and 39 vertex of which 12 / 39 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 27 transition count 20
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 12 place count 27 transition count 20
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 12 rules in 8 ms. Remains 27 /39 variables (removed 12) and now considering 20/31 (removed 11) transitions.
// Phase 1: matrix 20 rows 27 cols
[2023-03-17 01:47:36] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-17 01:47:36] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
[2023-03-17 01:47:36] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-17 01:47:36] [INFO ] Invariant cache hit.
[2023-03-17 01:47:36] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/39 places, 20/31 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 94 ms. Remains : 27/39 places, 20/31 transitions.
Built C files in :
/tmp/ltsmin7642554960955073583
[2023-03-17 01:47:36] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7642554960955073583
Running compilation step : cd /tmp/ltsmin7642554960955073583;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 316 ms.
Running link step : cd /tmp/ltsmin7642554960955073583;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin7642554960955073583;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15554987861983310088.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 31/31 transitions.
Applied a total of 0 rules in 3 ms. Remains 39 /39 variables (removed 0) and now considering 31/31 (removed 0) transitions.
// Phase 1: matrix 31 rows 39 cols
[2023-03-17 01:47:51] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-17 01:47:51] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2023-03-17 01:47:51] [INFO ] Invariant cache hit.
[2023-03-17 01:47:51] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-17 01:47:51] [INFO ] Invariant cache hit.
[2023-03-17 01:47:51] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-03-17 01:47:51] [INFO ] Invariant cache hit.
[2023-03-17 01:47:51] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 147 ms. Remains : 39/39 places, 31/31 transitions.
Built C files in :
/tmp/ltsmin16396375431860178932
[2023-03-17 01:47:51] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16396375431860178932
Running compilation step : cd /tmp/ltsmin16396375431860178932;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 95 ms.
Running link step : cd /tmp/ltsmin16396375431860178932;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin16396375431860178932;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17167717835433031299.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-17 01:48:06] [INFO ] Flatten gal took : 4 ms
[2023-03-17 01:48:06] [INFO ] Flatten gal took : 3 ms
[2023-03-17 01:48:06] [INFO ] Time to serialize gal into /tmp/LTL3022007216016308165.gal : 1 ms
[2023-03-17 01:48:06] [INFO ] Time to serialize properties into /tmp/LTL18323771534119221695.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3022007216016308165.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16097554424631065644.hoa' '-atoms' '/tmp/LTL18323771534119221695.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL18323771534119221695.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16097554424631065644.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2023-03-17 01:48:21] [INFO ] Flatten gal took : 3 ms
[2023-03-17 01:48:21] [INFO ] Flatten gal took : 2 ms
[2023-03-17 01:48:21] [INFO ] Time to serialize gal into /tmp/LTL16001856116128445247.gal : 1 ms
[2023-03-17 01:48:21] [INFO ] Time to serialize properties into /tmp/LTL280086069106951413.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16001856116128445247.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL280086069106951413.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(F(("(p31>p10)")||((G("(p6<=psecond)"))U(G("(p18>=2)")))))))
Formula 0 simplified : XG(!"(p31>p10)" & (F!"(p6<=psecond)" R F!"(p18>=2)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2023-03-17 01:48:36] [INFO ] Flatten gal took : 5 ms
[2023-03-17 01:48:36] [INFO ] Applying decomposition
[2023-03-17 01:48:36] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph16764147767303846434.txt' '-o' '/tmp/graph16764147767303846434.bin' '-w' '/tmp/graph16764147767303846434.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph16764147767303846434.bin' '-l' '-1' '-v' '-w' '/tmp/graph16764147767303846434.weights' '-q' '0' '-e' '0.001'
[2023-03-17 01:48:36] [INFO ] Decomposing Gal with order
[2023-03-17 01:48:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-17 01:48:36] [INFO ] Flatten gal took : 25 ms
[2023-03-17 01:48:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-03-17 01:48:36] [INFO ] Time to serialize gal into /tmp/LTL16441606398885801625.gal : 1 ms
[2023-03-17 01:48:36] [INFO ] Time to serialize properties into /tmp/LTL4402718529710662861.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16441606398885801625.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4402718529710662861.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F(("(gu5.p31>gu5.p10)")||((G("(gu0.p6<=gu0.psecond)"))U(G("(gi3.gi0.gi1.gu9.p18>=2)")))))))
Formula 0 simplified : XG(!"(gu5.p31>gu5.p10)" & (F!"(gu0.p6<=gu0.psecond)" R F!"(gi3.gi0.gi1.gu9.p18>=2)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6330242852237945579
[2023-03-17 01:48:51] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6330242852237945579
Running compilation step : cd /tmp/ltsmin6330242852237945579;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 97 ms.
Running link step : cd /tmp/ltsmin6330242852237945579;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin6330242852237945579;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp0==true)||([]((LTLAPp1==true)) U []((LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property RefineWMG-PT-007007-LTLCardinality-11 finished in 93721 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||X(G((p1 U X(p2)))))))'
Support contains 3 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 31/31 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 31/31 (removed 0) transitions.
[2023-03-17 01:49:07] [INFO ] Invariant cache hit.
[2023-03-17 01:49:07] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
[2023-03-17 01:49:07] [INFO ] Invariant cache hit.
[2023-03-17 01:49:07] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-17 01:49:07] [INFO ] Invariant cache hit.
[2023-03-17 01:49:07] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-03-17 01:49:07] [INFO ] Invariant cache hit.
[2023-03-17 01:49:07] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 143 ms. Remains : 39/39 places, 31/31 transitions.
Stuttering acceptance computed with spot in 236 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), true]
Running random walk in product with property : RefineWMG-PT-007007-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ 2 s21), p1:(AND (LEQ 2 s21) (LEQ 2 s22)), p2:(LEQ 3 s28)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 104 ms.
Product exploration explored 100000 steps with 50000 reset in 92 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 p0 p1 (NOT p2)), (X p0), true, (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 81 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RefineWMG-PT-007007-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RefineWMG-PT-007007-LTLCardinality-12 finished in 685 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)))'
Support contains 3 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 31/31 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 31/31 (removed 0) transitions.
[2023-03-17 01:49:07] [INFO ] Invariant cache hit.
[2023-03-17 01:49:07] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2023-03-17 01:49:07] [INFO ] Invariant cache hit.
[2023-03-17 01:49:07] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-17 01:49:07] [INFO ] Invariant cache hit.
[2023-03-17 01:49:07] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-03-17 01:49:07] [INFO ] Invariant cache hit.
[2023-03-17 01:49:07] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 133 ms. Remains : 39/39 places, 31/31 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : RefineWMG-PT-007007-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(GT s26 s8), p0:(LEQ 3 s19)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 88 ms.
Product exploration explored 100000 steps with 50000 reset in 95 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 p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 7 factoid took 109 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RefineWMG-PT-007007-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RefineWMG-PT-007007-LTLCardinality-13 finished in 551 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)&&F(G(p1)))))'
Support contains 4 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 31/31 transitions.
Graph (trivial) has 15 edges and 39 vertex of which 10 / 39 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 29 transition count 22
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 15 rules applied. Total rules applied 20 place count 19 transition count 17
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 1 rules applied. Total rules applied 21 place count 19 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 18 transition count 16
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 22 place count 18 transition count 13
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 28 place count 15 transition count 13
Applied a total of 28 rules in 7 ms. Remains 15 /39 variables (removed 24) and now considering 13/31 (removed 18) transitions.
// Phase 1: matrix 13 rows 15 cols
[2023-03-17 01:49:08] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-17 01:49:08] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
[2023-03-17 01:49:08] [INFO ] Invariant cache hit.
[2023-03-17 01:49:08] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-17 01:49:08] [INFO ] Invariant cache hit.
[2023-03-17 01:49:08] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-03-17 01:49:08] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-17 01:49:08] [INFO ] Invariant cache hit.
[2023-03-17 01:49:08] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/39 places, 13/31 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 124 ms. Remains : 15/39 places, 13/31 transitions.
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-007007-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (GT s6 s11) (GT s9 s13)), p1:(LEQ s6 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-007007-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-007007-LTLCardinality-14 finished in 240 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 1 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 31/31 transitions.
Graph (trivial) has 20 edges and 39 vertex of which 14 / 39 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 25 transition count 18
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 25 place count 13 transition count 12
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 4 rules applied. Total rules applied 29 place count 13 transition count 8
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 33 place count 9 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 33 place count 9 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 35 place count 8 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 37 place count 7 transition count 6
Applied a total of 37 rules in 13 ms. Remains 7 /39 variables (removed 32) and now considering 6/31 (removed 25) transitions.
// Phase 1: matrix 6 rows 7 cols
[2023-03-17 01:49:08] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-17 01:49:08] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
[2023-03-17 01:49:08] [INFO ] Invariant cache hit.
[2023-03-17 01:49:08] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-17 01:49:08] [INFO ] Invariant cache hit.
[2023-03-17 01:49:08] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-03-17 01:49:08] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 01:49:08] [INFO ] Invariant cache hit.
[2023-03-17 01:49:08] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/39 places, 6/31 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 115 ms. Remains : 7/39 places, 6/31 transitions.
Stuttering acceptance computed with spot in 29 ms :[p0]
Running random walk in product with property : RefineWMG-PT-007007-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-007007-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-007007-LTLCardinality-15 finished in 162 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||(G(p1) U G(p2))))))'
Found a Shortening insensitive property : RefineWMG-PT-007007-LTLCardinality-11
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Support contains 3 out of 39 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LI_LTL mode, iteration 0 : 39/39 places, 31/31 transitions.
Graph (trivial) has 18 edges and 39 vertex of which 12 / 39 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 27 transition count 20
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 24 place count 15 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1 rules applied. Total rules applied 25 place count 15 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 26 place count 14 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 26 place count 14 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 28 place count 13 transition count 12
Applied a total of 28 rules in 11 ms. Remains 13 /39 variables (removed 26) and now considering 12/31 (removed 19) transitions.
// Phase 1: matrix 12 rows 13 cols
[2023-03-17 01:49:08] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-17 01:49:08] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
[2023-03-17 01:49:08] [INFO ] Invariant cache hit.
[2023-03-17 01:49:08] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-17 01:49:08] [INFO ] Invariant cache hit.
[2023-03-17 01:49:08] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-17 01:49:08] [INFO ] Invariant cache hit.
[2023-03-17 01:49:08] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 13/39 places, 12/31 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 103 ms. Remains : 13/39 places, 12/31 transitions.
Running random walk in product with property : RefineWMG-PT-007007-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p2:(LEQ 2 s10), p0:(GT s12 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 1921 steps with 22 reset in 15 ms.
Treatment of property RefineWMG-PT-007007-LTLCardinality-11 finished in 283 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-17 01:49:08] [INFO ] Flatten gal took : 3 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1524440948491562192
[2023-03-17 01:49:08] [INFO ] Computing symmetric may disable matrix : 31 transitions.
[2023-03-17 01:49:08] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 01:49:08] [INFO ] Computing symmetric may enable matrix : 31 transitions.
[2023-03-17 01:49:08] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 01:49:08] [INFO ] Computing Do-Not-Accords matrix : 31 transitions.
[2023-03-17 01:49:08] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 01:49:08] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1524440948491562192
Running compilation step : cd /tmp/ltsmin1524440948491562192;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-17 01:49:09] [INFO ] Applying decomposition
[2023-03-17 01:49:09] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph1884125065641323848.txt' '-o' '/tmp/graph1884125065641323848.bin' '-w' '/tmp/graph1884125065641323848.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1884125065641323848.bin' '-l' '-1' '-v' '-w' '/tmp/graph1884125065641323848.weights' '-q' '0' '-e' '0.001'
[2023-03-17 01:49:09] [INFO ] Decomposing Gal with order
[2023-03-17 01:49:09] [INFO ] Rewriting arrays to variables to allow decomposition.
Compilation finished in 137 ms.
Running link step : cd /tmp/ltsmin1524440948491562192;'gcc' '-shared' '-o' 'gal.so' 'model.o'
[2023-03-17 01:49:09] [INFO ] Flatten gal took : 6 ms
[2023-03-17 01:49:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2023-03-17 01:49:09] [INFO ] Time to serialize gal into /tmp/LTLCardinality13964397042978202848.gal : 1 ms
Link finished in 22 ms.
Running LTSmin : cd /tmp/ltsmin1524440948491562192;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp0==true)||([]((LTLAPp1==true)) U []((LTLAPp2==true))))))' '--buchi-type=spotba'
[2023-03-17 01:49:09] [INFO ] Time to serialize properties into /tmp/LTLCardinality10277296792109776122.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality13964397042978202848.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10277296792109776122.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 1 LTL properties
Checking formula 0 : !((X(F(("(gu15.p31>gu15.p10)")||((G("(gu0.p6<=gu0.psecond)"))U(G("(gi1.gi1.gu8.p18>=2)")))))))
Formula 0 simplified : XG(!"(gu15.p31>gu15.p10)" & (F!"(gu0.p6<=gu0.psecond)" R F!"(gi1.gi1.gu8.p18>=2)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.007: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.008: LTL layer: formula: X(<>(((LTLAPp0==true)||([]((LTLAPp1==true)) U []((LTLAPp2==true))))))
pins2lts-mc-linux64( 0/ 8), 0.008: "X(<>(((LTLAPp0==true)||([]((LTLAPp1==true)) U []((LTLAPp2==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.008: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.020: buchi has 3 states
pins2lts-mc-linux64( 0/ 8), 0.030: There are 35 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.030: State length is 40, there are 36 groups
pins2lts-mc-linux64( 0/ 8), 0.030: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.030: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.030: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.030: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.036: [Blue] ~120 levels ~960 states ~9968 transitions
pins2lts-mc-linux64( 4/ 8), 0.077: [Blue] ~240 levels ~1920 states ~20728 transitions
pins2lts-mc-linux64( 4/ 8), 0.109: [Blue] ~480 levels ~3840 states ~40968 transitions
pins2lts-mc-linux64( 4/ 8), 0.192: [Blue] ~960 levels ~7680 states ~82088 transitions
pins2lts-mc-linux64( 5/ 8), 0.319: [Blue] ~1920 levels ~15360 states ~169152 transitions
pins2lts-mc-linux64( 4/ 8), 0.532: [Blue] ~3840 levels ~30720 states ~349664 transitions
pins2lts-mc-linux64( 4/ 8), 0.882: [Blue] ~7680 levels ~61440 states ~717400 transitions
pins2lts-mc-linux64( 3/ 8), 1.329: [Blue] ~15360 levels ~122880 states ~1448152 transitions
pins2lts-mc-linux64( 3/ 8), 1.863: [Blue] ~30720 levels ~245760 states ~2918976 transitions
pins2lts-mc-linux64( 3/ 8), 2.431: [Blue] ~61440 levels ~491520 states ~6046064 transitions
pins2lts-mc-linux64( 6/ 8), 3.537: [Blue] ~122124 levels ~983040 states ~11339936 transitions
pins2lts-mc-linux64( 6/ 8), 5.835: [Blue] ~244989 levels ~1966080 states ~23475072 transitions
pins2lts-mc-linux64( 3/ 8), 10.425: [Blue] ~491415 levels ~3932160 states ~52347592 transitions
pins2lts-mc-linux64( 3/ 8), 19.238: [Blue] ~982935 levels ~7864320 states ~101588344 transitions
pins2lts-mc-linux64( 3/ 8), 37.551: [Blue] ~1965975 levels ~15728640 states ~203709608 transitions
pins2lts-mc-linux64( 3/ 8), 76.065: [Blue] ~3932023 levels ~31457280 states ~404255344 transitions
pins2lts-mc-linux64( 4/ 8), 94.705: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 94.774:
pins2lts-mc-linux64( 0/ 8), 94.774: Explored 31696685 states 427787150 transitions, fanout: 13.496
pins2lts-mc-linux64( 0/ 8), 94.774: Total exploration time 94.740 sec (94.650 sec minimum, 94.696 sec on average)
pins2lts-mc-linux64( 0/ 8), 94.774: States per second: 334565, Transitions per second: 4515380
pins2lts-mc-linux64( 0/ 8), 94.774:
pins2lts-mc-linux64( 0/ 8), 94.774: State space has 134217453 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 94.774: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 94.774: blue states: 31696685 (23.62%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 94.774: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 94.774: all-red states: 27842 (0.02%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 94.774:
pins2lts-mc-linux64( 0/ 8), 94.774: Total memory used for local state coloring: 483.2MB
pins2lts-mc-linux64( 0/ 8), 94.774:
pins2lts-mc-linux64( 0/ 8), 94.774: Queue width: 8B, total height: 31668788, memory: 241.61MB
pins2lts-mc-linux64( 0/ 8), 94.774: Tree memory: 1040.0MB, 8.1 B/state, compr.: 5.0%
pins2lts-mc-linux64( 0/ 8), 94.774: Tree fill ratio (roots/leafs): 99.0%/6.0%
pins2lts-mc-linux64( 0/ 8), 94.774: Stored 32 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 94.774: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 94.774: Est. total memory use: 1281.6MB (~1265.6MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1524440948491562192;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp0==true)||([]((LTLAPp1==true)) U []((LTLAPp2==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1524440948491562192;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp0==true)||([]((LTLAPp1==true)) U []((LTLAPp2==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
56525 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,565.277,2966384,1,0,746,1.28662e+07,24,414,808,2.61229e+07,1816
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA RefineWMG-PT-007007-LTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 746116 ms.
BK_STOP 1679018396217
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RefineWMG-PT-007007"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is RefineWMG-PT-007007, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r325-tall-167889197400563"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-007007.tgz
mv RefineWMG-PT-007007 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;