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.r393-oct2-167903717000435.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldPPPs-PT-010A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903717000435
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 7.6K Feb 26 02:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 26 02:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 02:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 02:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 02:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Feb 26 02:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 02:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 113K Feb 26 02:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 88K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldPPPs-PT-010A-LTLCardinality-00
FORMULA_NAME ShieldPPPs-PT-010A-LTLCardinality-01
FORMULA_NAME ShieldPPPs-PT-010A-LTLCardinality-02
FORMULA_NAME ShieldPPPs-PT-010A-LTLCardinality-03
FORMULA_NAME ShieldPPPs-PT-010A-LTLCardinality-04
FORMULA_NAME ShieldPPPs-PT-010A-LTLCardinality-05
FORMULA_NAME ShieldPPPs-PT-010A-LTLCardinality-06
FORMULA_NAME ShieldPPPs-PT-010A-LTLCardinality-07
FORMULA_NAME ShieldPPPs-PT-010A-LTLCardinality-08
FORMULA_NAME ShieldPPPs-PT-010A-LTLCardinality-09
FORMULA_NAME ShieldPPPs-PT-010A-LTLCardinality-10
FORMULA_NAME ShieldPPPs-PT-010A-LTLCardinality-11
FORMULA_NAME ShieldPPPs-PT-010A-LTLCardinality-12
FORMULA_NAME ShieldPPPs-PT-010A-LTLCardinality-13
FORMULA_NAME ShieldPPPs-PT-010A-LTLCardinality-14
FORMULA_NAME ShieldPPPs-PT-010A-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679448101096

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=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-010A
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 01:21:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 01:21:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 01:21:43] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2023-03-22 01:21:43] [INFO ] Transformed 313 places.
[2023-03-22 01:21:43] [INFO ] Transformed 263 transitions.
[2023-03-22 01:21:43] [INFO ] Found NUPN structural information;
[2023-03-22 01:21:43] [INFO ] Parsed PT model containing 313 places and 263 transitions and 1006 arcs in 286 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldPPPs-PT-010A-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-010A-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-010A-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-010A-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-010A-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-010A-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-010A-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Applied a total of 0 rules in 34 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
// Phase 1: matrix 263 rows 313 cols
[2023-03-22 01:21:44] [INFO ] Computed 111 place invariants in 12 ms
[2023-03-22 01:21:44] [INFO ] Implicit Places using invariants in 525 ms returned []
[2023-03-22 01:21:44] [INFO ] Invariant cache hit.
[2023-03-22 01:21:45] [INFO ] Implicit Places using invariants and state equation in 506 ms returned []
Implicit Place search using SMT with State Equation took 1074 ms to find 0 implicit places.
[2023-03-22 01:21:45] [INFO ] Invariant cache hit.
[2023-03-22 01:21:45] [INFO ] Dead Transitions using invariants and state equation in 305 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1426 ms. Remains : 313/313 places, 263/263 transitions.
Support contains 26 out of 313 places after structural reductions.
[2023-03-22 01:21:45] [INFO ] Flatten gal took : 50 ms
[2023-03-22 01:21:45] [INFO ] Flatten gal took : 27 ms
[2023-03-22 01:21:45] [INFO ] Input system was already deterministic with 263 transitions.
Support contains 25 out of 313 places (down from 26) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 13 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 16) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 01:21:46] [INFO ] Invariant cache hit.
[2023-03-22 01:21:46] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA ShieldPPPs-PT-010A-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ShieldPPPs-PT-010A-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Applied a total of 0 rules in 19 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
[2023-03-22 01:21:46] [INFO ] Invariant cache hit.
[2023-03-22 01:21:46] [INFO ] Implicit Places using invariants in 318 ms returned []
[2023-03-22 01:21:46] [INFO ] Invariant cache hit.
[2023-03-22 01:21:47] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 675 ms to find 0 implicit places.
[2023-03-22 01:21:47] [INFO ] Invariant cache hit.
[2023-03-22 01:21:47] [INFO ] Dead Transitions using invariants and state equation in 469 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1191 ms. Remains : 313/313 places, 263/263 transitions.
Stuttering acceptance computed with spot in 532 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(AND (NEQ s103 0) (NEQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 4 ms.
FORMULA ShieldPPPs-PT-010A-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-010A-LTLCardinality-01 finished in 1856 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((F(p0)&&X((G(!p1)||(!p1&&F(!p2))))))))'
Support contains 5 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Applied a total of 0 rules in 16 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
[2023-03-22 01:21:48] [INFO ] Invariant cache hit.
[2023-03-22 01:21:48] [INFO ] Implicit Places using invariants in 346 ms returned []
[2023-03-22 01:21:48] [INFO ] Invariant cache hit.
[2023-03-22 01:21:49] [INFO ] Implicit Places using invariants and state equation in 485 ms returned []
Implicit Place search using SMT with State Equation took 845 ms to find 0 implicit places.
[2023-03-22 01:21:49] [INFO ] Invariant cache hit.
[2023-03-22 01:21:49] [INFO ] Dead Transitions using invariants and state equation in 232 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1096 ms. Remains : 313/313 places, 263/263 transitions.
Stuttering acceptance computed with spot in 529 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), p1, true, (AND p2 p1), p2]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 p2), acceptance={} source=5 dest: 6}], [{ cond=p2, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(OR (EQ s152 0) (EQ s45 1)), p1:(OR (EQ s232 0) (EQ s57 1)), p2:(OR (EQ s232 0) (EQ s24 1))], 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, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2923 steps with 728 reset in 89 ms.
FORMULA ShieldPPPs-PT-010A-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-010A-LTLCardinality-03 finished in 1746 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)) U G((p1&&F(p2)))))'
Support contains 5 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 311 transition count 261
Applied a total of 4 rules in 35 ms. Remains 311 /313 variables (removed 2) and now considering 261/263 (removed 2) transitions.
// Phase 1: matrix 261 rows 311 cols
[2023-03-22 01:21:50] [INFO ] Computed 111 place invariants in 9 ms
[2023-03-22 01:21:50] [INFO ] Implicit Places using invariants in 177 ms returned []
[2023-03-22 01:21:50] [INFO ] Invariant cache hit.
[2023-03-22 01:21:51] [INFO ] Implicit Places using invariants and state equation in 983 ms returned []
Implicit Place search using SMT with State Equation took 1162 ms to find 0 implicit places.
[2023-03-22 01:21:51] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-22 01:21:51] [INFO ] Invariant cache hit.
[2023-03-22 01:21:51] [INFO ] Dead Transitions using invariants and state equation in 221 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 311/313 places, 261/263 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1483 ms. Remains : 311/313 places, 261/263 transitions.
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p2) (NOT p1)), p0, (NOT p2)]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(NEQ s233 1), p2:(OR (EQ s152 0) (EQ s298 1)), p0:(OR (EQ s134 0) (EQ s207 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 3300 reset in 487 ms.
Product exploration explored 100000 steps with 3285 reset in 561 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND p1 (NOT p2)))), (X p2), (X (NOT p0)), (X p1), (X (X (NOT (AND p1 (NOT p2))))), (X (X p2)), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 656 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p2) (NOT p1)), p0, (NOT p2)]
Finished random walk after 128 steps, including 0 resets, run visited all 4 properties in 12 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND p1 (NOT p2)))), (X p2), (X (NOT p0)), (X p1), (X (X (NOT (AND p1 (NOT p2))))), (X (X p2)), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p1)), (F (NOT p0)), (F (AND (NOT p2) p1))]
Knowledge based reduction with 9 factoid took 693 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p2) (NOT p1)), p0, (NOT p2)]
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p2) (NOT p1)), p0, (NOT p2)]
Support contains 5 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 25 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2023-03-22 01:21:54] [INFO ] Invariant cache hit.
[2023-03-22 01:21:54] [INFO ] Implicit Places using invariants in 218 ms returned []
[2023-03-22 01:21:54] [INFO ] Invariant cache hit.
[2023-03-22 01:21:55] [INFO ] Implicit Places using invariants and state equation in 482 ms returned []
Implicit Place search using SMT with State Equation took 714 ms to find 0 implicit places.
[2023-03-22 01:21:55] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-22 01:21:55] [INFO ] Invariant cache hit.
[2023-03-22 01:21:55] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 960 ms. Remains : 311/311 places, 261/261 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p2) p1))), (X (X p2)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 502 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p2) (NOT p1)), p0, (NOT p2)]
Finished random walk after 268 steps, including 0 resets, run visited all 4 properties in 12 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p2) p1))), (X (X p2)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p1)), (F (NOT p0)), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 9 factoid took 728 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p2) (NOT p1)), p0, (NOT p2)]
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p2) (NOT p1)), p0, (NOT p2)]
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p2) (NOT p1)), p0, (NOT p2)]
Product exploration explored 100000 steps with 3309 reset in 387 ms.
Product exploration explored 100000 steps with 3233 reset in 403 ms.
Support contains 5 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 9 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2023-03-22 01:21:58] [INFO ] Invariant cache hit.
[2023-03-22 01:21:58] [INFO ] Implicit Places using invariants in 314 ms returned []
[2023-03-22 01:21:58] [INFO ] Invariant cache hit.
[2023-03-22 01:21:59] [INFO ] Implicit Places using invariants and state equation in 432 ms returned []
Implicit Place search using SMT with State Equation took 751 ms to find 0 implicit places.
[2023-03-22 01:21:59] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-22 01:21:59] [INFO ] Invariant cache hit.
[2023-03-22 01:21:59] [INFO ] Dead Transitions using invariants and state equation in 385 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1170 ms. Remains : 311/311 places, 261/261 transitions.
Treatment of property ShieldPPPs-PT-010A-LTLCardinality-04 finished in 9852 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((X((X(X(F(p1)))||G(!p2)))&&p0)))))'
Support contains 3 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Applied a total of 0 rules in 3 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
// Phase 1: matrix 263 rows 313 cols
[2023-03-22 01:21:59] [INFO ] Computed 111 place invariants in 4 ms
[2023-03-22 01:22:00] [INFO ] Implicit Places using invariants in 190 ms returned []
[2023-03-22 01:22:00] [INFO ] Invariant cache hit.
[2023-03-22 01:22:00] [INFO ] Implicit Places using invariants and state equation in 571 ms returned []
Implicit Place search using SMT with State Equation took 777 ms to find 0 implicit places.
[2023-03-22 01:22:00] [INFO ] Invariant cache hit.
[2023-03-22 01:22:00] [INFO ] Dead Transitions using invariants and state equation in 227 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1020 ms. Remains : 313/313 places, 263/263 transitions.
Stuttering acceptance computed with spot in 483 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(OR p0 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 5}], [{ cond=(OR p0 (NOT p2)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 7}], [{ cond=p0, acceptance={} source=5 dest: 6}, { cond=(NOT p0), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 6}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=6 dest: 7}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=7 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(AND (NEQ s116 0) (NEQ s219 1)), p2:(OR (EQ s116 0) (EQ s219 1)), p1:(NEQ s106 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1700 reset in 365 ms.
Product exploration explored 100000 steps with 1705 reset in 418 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 124 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 8 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 523 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))]
Incomplete random walk after 10000 steps, including 13 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 8) seen :7
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 01:22:02] [INFO ] Invariant cache hit.
[2023-03-22 01:22:03] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (X (NOT p0))), (G (NOT (AND p2 (NOT p1) p0)))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p1))), (F (AND (NOT p1) p0)), (F (AND p2 (NOT p1) (NOT p0))), (F p0), (F (NOT (AND p2 (NOT p0)))), (F (OR (NOT p2) p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 3 factoid took 431 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 8 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 480 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))]
Stuttering acceptance computed with spot in 664 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))]
[2023-03-22 01:22:04] [INFO ] Invariant cache hit.
[2023-03-22 01:22:04] [INFO ] [Real]Absence check using 111 positive place invariants in 65 ms returned sat
[2023-03-22 01:22:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:22:05] [INFO ] [Real]Absence check using state equation in 375 ms returned sat
[2023-03-22 01:22:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:22:05] [INFO ] [Nat]Absence check using 111 positive place invariants in 37 ms returned sat
[2023-03-22 01:22:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:22:06] [INFO ] [Nat]Absence check using state equation in 453 ms returned sat
[2023-03-22 01:22:06] [INFO ] Computed and/alt/rep : 262/723/262 causal constraints (skipped 0 transitions) in 19 ms.
[2023-03-22 01:22:15] [INFO ] Added : 261 causal constraints over 56 iterations in 9011 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Applied a total of 0 rules in 9 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
[2023-03-22 01:22:15] [INFO ] Invariant cache hit.
[2023-03-22 01:22:15] [INFO ] Implicit Places using invariants in 252 ms returned []
[2023-03-22 01:22:15] [INFO ] Invariant cache hit.
[2023-03-22 01:22:15] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 617 ms to find 0 implicit places.
[2023-03-22 01:22:15] [INFO ] Invariant cache hit.
[2023-03-22 01:22:16] [INFO ] Dead Transitions using invariants and state equation in 196 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 823 ms. Remains : 313/313 places, 263/263 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 154 ms. Reduced automaton from 8 states, 14 edges and 3 AP (stutter sensitive) to 8 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 688 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))]
Finished random walk after 391 steps, including 0 resets, run visited all 7 properties in 10 ms. (steps per millisecond=39 )
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND p2 (NOT p1))), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p0)), (F p0), (F (NOT (AND p2 (NOT p0)))), (F (OR (NOT p2) p0))]
Knowledge based reduction with 2 factoid took 372 ms. Reduced automaton from 8 states, 14 edges and 3 AP (stutter sensitive) to 8 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 497 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))]
Stuttering acceptance computed with spot in 615 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))]
[2023-03-22 01:22:18] [INFO ] Invariant cache hit.
[2023-03-22 01:22:18] [INFO ] [Real]Absence check using 111 positive place invariants in 38 ms returned sat
[2023-03-22 01:22:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:22:19] [INFO ] [Real]Absence check using state equation in 342 ms returned sat
[2023-03-22 01:22:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:22:19] [INFO ] [Nat]Absence check using 111 positive place invariants in 45 ms returned sat
[2023-03-22 01:22:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:22:19] [INFO ] [Nat]Absence check using state equation in 283 ms returned sat
[2023-03-22 01:22:19] [INFO ] Computed and/alt/rep : 262/723/262 causal constraints (skipped 0 transitions) in 44 ms.
[2023-03-22 01:22:27] [INFO ] Added : 261 causal constraints over 56 iterations in 7857 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 573 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))]
Product exploration explored 100000 steps with 1693 reset in 338 ms.
Product exploration explored 100000 steps with 1703 reset in 344 ms.
Support contains 3 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Applied a total of 0 rules in 3 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
[2023-03-22 01:22:28] [INFO ] Invariant cache hit.
[2023-03-22 01:22:29] [INFO ] Implicit Places using invariants in 321 ms returned []
[2023-03-22 01:22:29] [INFO ] Invariant cache hit.
[2023-03-22 01:22:29] [INFO ] Implicit Places using invariants and state equation in 524 ms returned []
Implicit Place search using SMT with State Equation took 860 ms to find 0 implicit places.
[2023-03-22 01:22:29] [INFO ] Invariant cache hit.
[2023-03-22 01:22:30] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1064 ms. Remains : 313/313 places, 263/263 transitions.
Treatment of property ShieldPPPs-PT-010A-LTLCardinality-07 finished in 30216 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 4 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Applied a total of 0 rules in 3 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
[2023-03-22 01:22:30] [INFO ] Invariant cache hit.
[2023-03-22 01:22:30] [INFO ] Implicit Places using invariants in 168 ms returned []
[2023-03-22 01:22:30] [INFO ] Invariant cache hit.
[2023-03-22 01:22:30] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 559 ms to find 0 implicit places.
[2023-03-22 01:22:30] [INFO ] Invariant cache hit.
[2023-03-22 01:22:30] [INFO ] Dead Transitions using invariants and state equation in 203 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 766 ms. Remains : 313/313 places, 263/263 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (EQ s130 0) (EQ s288 1)) (AND (EQ s227 0) (EQ s47 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 2476 reset in 362 ms.
Product exploration explored 100000 steps with 2510 reset in 328 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 220 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Finished random walk after 14 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=7 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 312 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0)]
[2023-03-22 01:22:32] [INFO ] Invariant cache hit.
[2023-03-22 01:22:32] [INFO ] [Real]Absence check using 111 positive place invariants in 37 ms returned sat
[2023-03-22 01:22:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:22:32] [INFO ] [Real]Absence check using state equation in 316 ms returned sat
[2023-03-22 01:22:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:22:33] [INFO ] [Nat]Absence check using 111 positive place invariants in 29 ms returned sat
[2023-03-22 01:22:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:22:33] [INFO ] [Nat]Absence check using state equation in 278 ms returned sat
[2023-03-22 01:22:33] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 9 ms to minimize.
[2023-03-22 01:22:33] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 1 ms to minimize.
[2023-03-22 01:22:33] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 0 ms to minimize.
[2023-03-22 01:22:33] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 0 ms to minimize.
[2023-03-22 01:22:34] [INFO ] Deduced a trap composed of 28 places in 141 ms of which 1 ms to minimize.
[2023-03-22 01:22:34] [INFO ] Deduced a trap composed of 28 places in 162 ms of which 0 ms to minimize.
[2023-03-22 01:22:34] [INFO ] Deduced a trap composed of 42 places in 98 ms of which 0 ms to minimize.
[2023-03-22 01:22:34] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 15 ms to minimize.
[2023-03-22 01:22:34] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 1 ms to minimize.
[2023-03-22 01:22:34] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 1 ms to minimize.
[2023-03-22 01:22:34] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1327 ms
[2023-03-22 01:22:34] [INFO ] Computed and/alt/rep : 262/723/262 causal constraints (skipped 0 transitions) in 48 ms.
[2023-03-22 01:22:38] [INFO ] Added : 255 causal constraints over 54 iterations in 3223 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 311 transition count 261
Applied a total of 4 rules in 15 ms. Remains 311 /313 variables (removed 2) and now considering 261/263 (removed 2) transitions.
// Phase 1: matrix 261 rows 311 cols
[2023-03-22 01:22:38] [INFO ] Computed 111 place invariants in 1 ms
[2023-03-22 01:22:38] [INFO ] Implicit Places using invariants in 190 ms returned []
[2023-03-22 01:22:38] [INFO ] Invariant cache hit.
[2023-03-22 01:22:38] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 579 ms to find 0 implicit places.
[2023-03-22 01:22:38] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-22 01:22:38] [INFO ] Invariant cache hit.
[2023-03-22 01:22:38] [INFO ] Dead Transitions using invariants and state equation in 270 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 311/313 places, 261/263 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 872 ms. Remains : 311/313 places, 261/263 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 176 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Finished random walk after 31 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=31 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 251 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 91 ms :[(NOT p0)]
[2023-03-22 01:22:39] [INFO ] Invariant cache hit.
[2023-03-22 01:22:39] [INFO ] [Real]Absence check using 111 positive place invariants in 28 ms returned sat
[2023-03-22 01:22:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:22:40] [INFO ] [Real]Absence check using state equation in 295 ms returned sat
[2023-03-22 01:22:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:22:40] [INFO ] [Nat]Absence check using 111 positive place invariants in 25 ms returned sat
[2023-03-22 01:22:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:22:40] [INFO ] [Nat]Absence check using state equation in 322 ms returned sat
[2023-03-22 01:22:40] [INFO ] Computed and/alt/rep : 260/727/260 causal constraints (skipped 0 transitions) in 37 ms.
[2023-03-22 01:22:44] [INFO ] Added : 260 causal constraints over 55 iterations in 3937 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2402 reset in 356 ms.
Product exploration explored 100000 steps with 2394 reset in 354 ms.
Support contains 4 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 9 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2023-03-22 01:22:45] [INFO ] Invariant cache hit.
[2023-03-22 01:22:45] [INFO ] Implicit Places using invariants in 239 ms returned []
[2023-03-22 01:22:45] [INFO ] Invariant cache hit.
[2023-03-22 01:22:46] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 547 ms to find 0 implicit places.
[2023-03-22 01:22:46] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-22 01:22:46] [INFO ] Invariant cache hit.
[2023-03-22 01:22:46] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 753 ms. Remains : 311/311 places, 261/261 transitions.
Treatment of property ShieldPPPs-PT-010A-LTLCardinality-10 finished in 16208 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Applied a total of 0 rules in 3 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
// Phase 1: matrix 263 rows 313 cols
[2023-03-22 01:22:46] [INFO ] Computed 111 place invariants in 2 ms
[2023-03-22 01:22:46] [INFO ] Implicit Places using invariants in 208 ms returned []
[2023-03-22 01:22:46] [INFO ] Invariant cache hit.
[2023-03-22 01:22:46] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 624 ms to find 0 implicit places.
[2023-03-22 01:22:46] [INFO ] Invariant cache hit.
[2023-03-22 01:22:47] [INFO ] Dead Transitions using invariants and state equation in 187 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 814 ms. Remains : 313/313 places, 263/263 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s37 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 267 reset in 387 ms.
Product exploration explored 100000 steps with 268 reset in 376 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 198 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 390 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=78 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 114 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-22 01:22:48] [INFO ] Invariant cache hit.
[2023-03-22 01:22:49] [INFO ] [Real]Absence check using 111 positive place invariants in 27 ms returned sat
[2023-03-22 01:22:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:22:49] [INFO ] [Real]Absence check using state equation in 275 ms returned sat
[2023-03-22 01:22:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:22:49] [INFO ] [Nat]Absence check using 111 positive place invariants in 37 ms returned sat
[2023-03-22 01:22:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:22:49] [INFO ] [Nat]Absence check using state equation in 239 ms returned sat
[2023-03-22 01:22:49] [INFO ] Computed and/alt/rep : 262/723/262 causal constraints (skipped 0 transitions) in 32 ms.
[2023-03-22 01:22:54] [INFO ] Added : 262 causal constraints over 55 iterations in 4801 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Applied a total of 0 rules in 3 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
[2023-03-22 01:22:54] [INFO ] Invariant cache hit.
[2023-03-22 01:22:55] [INFO ] Implicit Places using invariants in 348 ms returned []
[2023-03-22 01:22:55] [INFO ] Invariant cache hit.
[2023-03-22 01:22:55] [INFO ] Implicit Places using invariants and state equation in 437 ms returned []
Implicit Place search using SMT with State Equation took 805 ms to find 0 implicit places.
[2023-03-22 01:22:55] [INFO ] Invariant cache hit.
[2023-03-22 01:22:55] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 972 ms. Remains : 313/313 places, 263/263 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 108 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 394 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=98 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 214 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-22 01:22:56] [INFO ] Invariant cache hit.
[2023-03-22 01:22:56] [INFO ] [Real]Absence check using 111 positive place invariants in 43 ms returned sat
[2023-03-22 01:22:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:22:57] [INFO ] [Real]Absence check using state equation in 260 ms returned sat
[2023-03-22 01:22:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:22:57] [INFO ] [Nat]Absence check using 111 positive place invariants in 36 ms returned sat
[2023-03-22 01:22:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:22:57] [INFO ] [Nat]Absence check using state equation in 266 ms returned sat
[2023-03-22 01:22:57] [INFO ] Computed and/alt/rep : 262/723/262 causal constraints (skipped 0 transitions) in 16 ms.
[2023-03-22 01:23:02] [INFO ] Added : 262 causal constraints over 55 iterations in 4840 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 265 reset in 363 ms.
Product exploration explored 100000 steps with 271 reset in 459 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 313 transition count 263
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 88 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
[2023-03-22 01:23:03] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 263 rows 313 cols
[2023-03-22 01:23:03] [INFO ] Computed 111 place invariants in 1 ms
[2023-03-22 01:23:03] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 313/313 places, 263/263 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 333 ms. Remains : 313/313 places, 263/263 transitions.
Support contains 1 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Applied a total of 0 rules in 3 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
// Phase 1: matrix 263 rows 313 cols
[2023-03-22 01:23:04] [INFO ] Computed 111 place invariants in 2 ms
[2023-03-22 01:23:04] [INFO ] Implicit Places using invariants in 252 ms returned []
[2023-03-22 01:23:04] [INFO ] Invariant cache hit.
[2023-03-22 01:23:04] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 538 ms to find 0 implicit places.
[2023-03-22 01:23:04] [INFO ] Invariant cache hit.
[2023-03-22 01:23:04] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 717 ms. Remains : 313/313 places, 263/263 transitions.
Treatment of property ShieldPPPs-PT-010A-LTLCardinality-12 finished in 18487 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 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 311 transition count 261
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 310 transition count 260
Applied a total of 4 rules in 24 ms. Remains 310 /313 variables (removed 3) and now considering 260/263 (removed 3) transitions.
// Phase 1: matrix 260 rows 310 cols
[2023-03-22 01:23:04] [INFO ] Computed 111 place invariants in 2 ms
[2023-03-22 01:23:04] [INFO ] Implicit Places using invariants in 166 ms returned []
[2023-03-22 01:23:04] [INFO ] Invariant cache hit.
[2023-03-22 01:23:05] [INFO ] Implicit Places using invariants and state equation in 430 ms returned []
Implicit Place search using SMT with State Equation took 612 ms to find 0 implicit places.
[2023-03-22 01:23:05] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 01:23:05] [INFO ] Invariant cache hit.
[2023-03-22 01:23:05] [INFO ] Dead Transitions using invariants and state equation in 222 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 310/313 places, 260/263 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 885 ms. Remains : 310/313 places, 260/263 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s291 0) (EQ s38 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 683 steps with 0 reset in 3 ms.
FORMULA ShieldPPPs-PT-010A-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-010A-LTLCardinality-14 finished in 976 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)) U G((p1&&F(p2)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((X((X(X(F(p1)))||G(!p2)))&&p0)))))'
Found a Shortening insensitive property : ShieldPPPs-PT-010A-LTLCardinality-07
Stuttering acceptance computed with spot in 540 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))]
Support contains 3 out of 313 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 311 transition count 261
Applied a total of 4 rules in 11 ms. Remains 311 /313 variables (removed 2) and now considering 261/263 (removed 2) transitions.
// Phase 1: matrix 261 rows 311 cols
[2023-03-22 01:23:06] [INFO ] Computed 111 place invariants in 3 ms
[2023-03-22 01:23:06] [INFO ] Implicit Places using invariants in 389 ms returned []
[2023-03-22 01:23:06] [INFO ] Invariant cache hit.
[2023-03-22 01:23:07] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 776 ms to find 0 implicit places.
[2023-03-22 01:23:07] [INFO ] Invariant cache hit.
[2023-03-22 01:23:07] [INFO ] Dead Transitions using invariants and state equation in 210 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 311/313 places, 261/263 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 997 ms. Remains : 311/313 places, 261/263 transitions.
Running random walk in product with property : ShieldPPPs-PT-010A-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(OR p0 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 5}], [{ cond=(OR p0 (NOT p2)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 7}], [{ cond=p0, acceptance={} source=5 dest: 6}, { cond=(NOT p0), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 6}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=6 dest: 7}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=7 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(AND (NEQ s116 0) (NEQ s219 1)), p2:(OR (EQ s116 0) (EQ s219 1)), p1:(NEQ s106 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1755 reset in 361 ms.
Product exploration explored 100000 steps with 1769 reset in 323 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 186 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 8 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 569 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 8) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 01:23:09] [INFO ] Invariant cache hit.
[2023-03-22 01:23:09] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (X (NOT p0))), (G (NOT (AND p2 (NOT p1) p0)))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p1))), (F (AND (NOT p1) p0)), (F (AND p2 (NOT p1) (NOT p0))), (F p0), (F (NOT (AND p2 (NOT p0)))), (F (OR (NOT p2) p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 3 factoid took 457 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 8 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 465 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))]
Stuttering acceptance computed with spot in 498 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))]
[2023-03-22 01:23:10] [INFO ] Invariant cache hit.
[2023-03-22 01:23:10] [INFO ] [Real]Absence check using 111 positive place invariants in 34 ms returned sat
[2023-03-22 01:23:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:23:11] [INFO ] [Real]Absence check using state equation in 278 ms returned sat
[2023-03-22 01:23:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:23:11] [INFO ] [Nat]Absence check using 111 positive place invariants in 27 ms returned sat
[2023-03-22 01:23:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:23:11] [INFO ] [Nat]Absence check using state equation in 240 ms returned sat
[2023-03-22 01:23:11] [INFO ] Computed and/alt/rep : 260/727/260 causal constraints (skipped 0 transitions) in 26 ms.
[2023-03-22 01:23:15] [INFO ] Added : 259 causal constraints over 53 iterations in 3723 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 4 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2023-03-22 01:23:15] [INFO ] Invariant cache hit.
[2023-03-22 01:23:15] [INFO ] Implicit Places using invariants in 272 ms returned []
[2023-03-22 01:23:15] [INFO ] Invariant cache hit.
[2023-03-22 01:23:15] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 643 ms to find 0 implicit places.
[2023-03-22 01:23:15] [INFO ] Invariant cache hit.
[2023-03-22 01:23:16] [INFO ] Dead Transitions using invariants and state equation in 230 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 891 ms. Remains : 311/311 places, 261/261 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 8 states, 14 edges and 3 AP (stutter sensitive) to 8 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 492 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))]
Finished random walk after 394 steps, including 0 resets, run visited all 7 properties in 24 ms. (steps per millisecond=16 )
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND p2 (NOT p1))), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p0)), (F p0), (F (NOT (AND p2 (NOT p0)))), (F (OR (NOT p2) p0))]
Knowledge based reduction with 2 factoid took 377 ms. Reduced automaton from 8 states, 14 edges and 3 AP (stutter sensitive) to 8 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 435 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))]
Stuttering acceptance computed with spot in 359 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))]
[2023-03-22 01:23:18] [INFO ] Invariant cache hit.
[2023-03-22 01:23:18] [INFO ] [Real]Absence check using 111 positive place invariants in 37 ms returned sat
[2023-03-22 01:23:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:23:18] [INFO ] [Real]Absence check using state equation in 350 ms returned sat
[2023-03-22 01:23:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:23:18] [INFO ] [Nat]Absence check using 111 positive place invariants in 27 ms returned sat
[2023-03-22 01:23:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:23:19] [INFO ] [Nat]Absence check using state equation in 285 ms returned sat
[2023-03-22 01:23:19] [INFO ] Computed and/alt/rep : 260/727/260 causal constraints (skipped 0 transitions) in 35 ms.
[2023-03-22 01:23:22] [INFO ] Added : 259 causal constraints over 53 iterations in 3635 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 385 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))]
Product exploration explored 100000 steps with 1778 reset in 295 ms.
Product exploration explored 100000 steps with 1754 reset in 370 ms.
Support contains 3 out of 311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 2 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2023-03-22 01:23:24] [INFO ] Invariant cache hit.
[2023-03-22 01:23:24] [INFO ] Implicit Places using invariants in 185 ms returned []
[2023-03-22 01:23:24] [INFO ] Invariant cache hit.
[2023-03-22 01:23:24] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 543 ms to find 0 implicit places.
[2023-03-22 01:23:24] [INFO ] Invariant cache hit.
[2023-03-22 01:23:24] [INFO ] Dead Transitions using invariants and state equation in 215 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 786 ms. Remains : 311/311 places, 261/261 transitions.
Treatment of property ShieldPPPs-PT-010A-LTLCardinality-07 finished in 18990 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)))'
Found a Shortening insensitive property : ShieldPPPs-PT-010A-LTLCardinality-10
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 313 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 311 transition count 261
Applied a total of 4 rules in 15 ms. Remains 311 /313 variables (removed 2) and now considering 261/263 (removed 2) transitions.
[2023-03-22 01:23:25] [INFO ] Invariant cache hit.
[2023-03-22 01:23:25] [INFO ] Implicit Places using invariants in 215 ms returned []
[2023-03-22 01:23:25] [INFO ] Invariant cache hit.
[2023-03-22 01:23:25] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 546 ms to find 0 implicit places.
[2023-03-22 01:23:25] [INFO ] Invariant cache hit.
[2023-03-22 01:23:25] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 311/313 places, 261/263 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 726 ms. Remains : 311/313 places, 261/263 transitions.
Running random walk in product with property : ShieldPPPs-PT-010A-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (EQ s130 0) (EQ s288 1)) (AND (EQ s227 0) (EQ s47 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 2314 reset in 335 ms.
Product exploration explored 100000 steps with 2479 reset in 358 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Finished random walk after 81 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=40 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 171 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
[2023-03-22 01:23:26] [INFO ] Invariant cache hit.
[2023-03-22 01:23:27] [INFO ] [Real]Absence check using 111 positive place invariants in 65 ms returned sat
[2023-03-22 01:23:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:23:27] [INFO ] [Real]Absence check using state equation in 249 ms returned sat
[2023-03-22 01:23:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:23:27] [INFO ] [Nat]Absence check using 111 positive place invariants in 22 ms returned sat
[2023-03-22 01:23:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:23:27] [INFO ] [Nat]Absence check using state equation in 231 ms returned sat
[2023-03-22 01:23:28] [INFO ] Computed and/alt/rep : 260/727/260 causal constraints (skipped 0 transitions) in 45 ms.
[2023-03-22 01:23:32] [INFO ] Added : 260 causal constraints over 55 iterations in 4142 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 18 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2023-03-22 01:23:32] [INFO ] Invariant cache hit.
[2023-03-22 01:23:32] [INFO ] Implicit Places using invariants in 234 ms returned []
[2023-03-22 01:23:32] [INFO ] Invariant cache hit.
[2023-03-22 01:23:32] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 643 ms to find 0 implicit places.
[2023-03-22 01:23:32] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-22 01:23:32] [INFO ] Invariant cache hit.
[2023-03-22 01:23:33] [INFO ] Dead Transitions using invariants and state equation in 416 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1113 ms. Remains : 311/311 places, 261/261 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 169 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Finished random walk after 16 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=8 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 204 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
[2023-03-22 01:23:33] [INFO ] Invariant cache hit.
[2023-03-22 01:23:34] [INFO ] [Real]Absence check using 111 positive place invariants in 33 ms returned sat
[2023-03-22 01:23:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:23:34] [INFO ] [Real]Absence check using state equation in 307 ms returned sat
[2023-03-22 01:23:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:23:34] [INFO ] [Nat]Absence check using 111 positive place invariants in 36 ms returned sat
[2023-03-22 01:23:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:23:34] [INFO ] [Nat]Absence check using state equation in 274 ms returned sat
[2023-03-22 01:23:35] [INFO ] Computed and/alt/rep : 260/727/260 causal constraints (skipped 0 transitions) in 29 ms.
[2023-03-22 01:23:38] [INFO ] Added : 260 causal constraints over 55 iterations in 3857 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2352 reset in 373 ms.
Product exploration explored 100000 steps with 2449 reset in 370 ms.
Support contains 4 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 5 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2023-03-22 01:23:39] [INFO ] Invariant cache hit.
[2023-03-22 01:23:39] [INFO ] Implicit Places using invariants in 187 ms returned []
[2023-03-22 01:23:39] [INFO ] Invariant cache hit.
[2023-03-22 01:23:40] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 614 ms to find 0 implicit places.
[2023-03-22 01:23:40] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 01:23:40] [INFO ] Invariant cache hit.
[2023-03-22 01:23:40] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 829 ms. Remains : 311/311 places, 261/261 transitions.
Treatment of property ShieldPPPs-PT-010A-LTLCardinality-10 finished in 15649 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Found a Shortening insensitive property : ShieldPPPs-PT-010A-LTLCardinality-12
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 313 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 311 transition count 261
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 0 with 2 rules applied. Total rules applied 4 place count 310 transition count 260
Applied a total of 4 rules in 15 ms. Remains 310 /313 variables (removed 3) and now considering 260/263 (removed 3) transitions.
// Phase 1: matrix 260 rows 310 cols
[2023-03-22 01:23:40] [INFO ] Computed 111 place invariants in 1 ms
[2023-03-22 01:23:40] [INFO ] Implicit Places using invariants in 251 ms returned []
[2023-03-22 01:23:40] [INFO ] Invariant cache hit.
[2023-03-22 01:23:41] [INFO ] Implicit Places using invariants and state equation in 447 ms returned []
Implicit Place search using SMT with State Equation took 705 ms to find 0 implicit places.
[2023-03-22 01:23:41] [INFO ] Invariant cache hit.
[2023-03-22 01:23:41] [INFO ] Dead Transitions using invariants and state equation in 247 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 310/313 places, 260/263 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 968 ms. Remains : 310/313 places, 260/263 transitions.
Running random walk in product with property : ShieldPPPs-PT-010A-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s36 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 275 reset in 374 ms.
Product exploration explored 100000 steps with 278 reset in 374 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 146 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 349 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=69 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 137 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-22 01:23:43] [INFO ] Invariant cache hit.
[2023-03-22 01:23:43] [INFO ] [Real]Absence check using 111 positive place invariants in 26 ms returned sat
[2023-03-22 01:23:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:23:43] [INFO ] [Real]Absence check using state equation in 396 ms returned sat
[2023-03-22 01:23:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:23:44] [INFO ] [Nat]Absence check using 111 positive place invariants in 30 ms returned sat
[2023-03-22 01:23:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:23:44] [INFO ] [Nat]Absence check using state equation in 353 ms returned sat
[2023-03-22 01:23:44] [INFO ] Computed and/alt/rep : 258/493/258 causal constraints (skipped 0 transitions) in 33 ms.
[2023-03-22 01:23:47] [INFO ] Added : 258 causal constraints over 53 iterations in 3248 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 310 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 310/310 places, 260/260 transitions.
Applied a total of 0 rules in 3 ms. Remains 310 /310 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2023-03-22 01:23:47] [INFO ] Invariant cache hit.
[2023-03-22 01:23:48] [INFO ] Implicit Places using invariants in 283 ms returned []
[2023-03-22 01:23:48] [INFO ] Invariant cache hit.
[2023-03-22 01:23:48] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 581 ms to find 0 implicit places.
[2023-03-22 01:23:48] [INFO ] Invariant cache hit.
[2023-03-22 01:23:48] [INFO ] Dead Transitions using invariants and state equation in 234 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 845 ms. Remains : 310/310 places, 260/260 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 128 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 330 steps, including 0 resets, run visited all 1 properties in 15 ms. (steps per millisecond=22 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 148 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-22 01:23:49] [INFO ] Invariant cache hit.
[2023-03-22 01:23:49] [INFO ] [Real]Absence check using 111 positive place invariants in 26 ms returned sat
[2023-03-22 01:23:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:23:50] [INFO ] [Real]Absence check using state equation in 428 ms returned sat
[2023-03-22 01:23:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:23:50] [INFO ] [Nat]Absence check using 111 positive place invariants in 23 ms returned sat
[2023-03-22 01:23:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:23:50] [INFO ] [Nat]Absence check using state equation in 227 ms returned sat
[2023-03-22 01:23:50] [INFO ] Computed and/alt/rep : 258/493/258 causal constraints (skipped 0 transitions) in 18 ms.
[2023-03-22 01:23:53] [INFO ] Added : 258 causal constraints over 53 iterations in 3236 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 276 reset in 427 ms.
Product exploration explored 100000 steps with 276 reset in 367 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 310 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 310/310 places, 260/260 transitions.
Applied a total of 0 rules in 12 ms. Remains 310 /310 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2023-03-22 01:23:55] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-22 01:23:55] [INFO ] Invariant cache hit.
[2023-03-22 01:23:55] [INFO ] Dead Transitions using invariants and state equation in 343 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 374 ms. Remains : 310/310 places, 260/260 transitions.
Support contains 1 out of 310 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 310/310 places, 260/260 transitions.
Applied a total of 0 rules in 2 ms. Remains 310 /310 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2023-03-22 01:23:55] [INFO ] Invariant cache hit.
[2023-03-22 01:23:55] [INFO ] Implicit Places using invariants in 230 ms returned []
[2023-03-22 01:23:55] [INFO ] Invariant cache hit.
[2023-03-22 01:23:56] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 670 ms to find 0 implicit places.
[2023-03-22 01:23:56] [INFO ] Invariant cache hit.
[2023-03-22 01:23:56] [INFO ] Dead Transitions using invariants and state equation in 227 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 900 ms. Remains : 310/310 places, 260/260 transitions.
Treatment of property ShieldPPPs-PT-010A-LTLCardinality-12 finished in 15921 ms.
[2023-03-22 01:23:56] [INFO ] Flatten gal took : 19 ms
[2023-03-22 01:23:56] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-22 01:23:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 313 places, 263 transitions and 1006 arcs took 2 ms.
Total runtime 132842 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2329/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2329/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2329/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2329/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldPPPs-PT-010A-LTLCardinality-04
Could not compute solution for formula : ShieldPPPs-PT-010A-LTLCardinality-07
Could not compute solution for formula : ShieldPPPs-PT-010A-LTLCardinality-10
Could not compute solution for formula : ShieldPPPs-PT-010A-LTLCardinality-12

BK_STOP 1679448237346

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name ShieldPPPs-PT-010A-LTLCardinality-04
ltl formula formula --ltl=/tmp/2329/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 313 places, 263 transitions and 1006 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.000 user 0.030 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2329/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2329/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2329/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2329/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name ShieldPPPs-PT-010A-LTLCardinality-07
ltl formula formula --ltl=/tmp/2329/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 313 places, 263 transitions and 1006 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2329/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2329/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2329/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2329/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name ShieldPPPs-PT-010A-LTLCardinality-10
ltl formula formula --ltl=/tmp/2329/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 313 places, 263 transitions and 1006 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.010 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2329/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2329/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2329/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2329/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name ShieldPPPs-PT-010A-LTLCardinality-12
ltl formula formula --ltl=/tmp/2329/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 313 places, 263 transitions and 1006 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.010 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2329/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2329/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2329/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2329/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x55a1c18803f4]
1: pnml2lts-mc(+0xa2496) [0x55a1c1880496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7fcea03ad140]
3: pnml2lts-mc(+0x405be5) [0x55a1c1be3be5]
4: pnml2lts-mc(+0x16b3f9) [0x55a1c19493f9]
5: pnml2lts-mc(+0x164ac4) [0x55a1c1942ac4]
6: pnml2lts-mc(+0x272e0a) [0x55a1c1a50e0a]
7: pnml2lts-mc(+0xb61f0) [0x55a1c18941f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7fcea02004d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7fcea020067a]
10: pnml2lts-mc(+0xa1581) [0x55a1c187f581]
11: pnml2lts-mc(+0xa1910) [0x55a1c187f910]
12: pnml2lts-mc(+0xa32a2) [0x55a1c18812a2]
13: pnml2lts-mc(+0xa50f4) [0x55a1c18830f4]
14: pnml2lts-mc(+0x3f34b3) [0x55a1c1bd14b3]
15: pnml2lts-mc(+0x7c63d) [0x55a1c185a63d]
16: pnml2lts-mc(+0x67d86) [0x55a1c1845d86]
17: pnml2lts-mc(+0x60a8a) [0x55a1c183ea8a]
18: pnml2lts-mc(+0x5eb15) [0x55a1c183cb15]
19: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7fcea01e8d0a]
20: pnml2lts-mc(+0x6075e) [0x55a1c183e75e]

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPs-PT-010A"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ShieldPPPs-PT-010A, 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 r393-oct2-167903717000435"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-010A.tgz
mv ShieldPPPs-PT-010A 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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;