Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r041-tajo-167813694400244.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is BridgeAndVehicles-PT-V50P20N50, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694400244
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 29K Feb 25 12:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 156K Feb 25 12:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 589K Feb 25 12:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.1M Feb 25 12:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 16K Feb 25 15:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 25 15:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 241K Feb 25 15:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 711K Feb 25 15:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 46K Feb 25 14:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 253K Feb 25 14:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.4M Feb 25 14:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 5.1M Feb 25 14:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 15:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.7K Feb 25 15:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 4.5M Mar 5 18:22 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 BridgeAndVehicles-PT-V50P20N50-LTLFireability-00
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-LTLFireability-01
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-LTLFireability-02
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-LTLFireability-03
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-LTLFireability-04
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-LTLFireability-05
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-LTLFireability-06
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-LTLFireability-07
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-LTLFireability-08
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-LTLFireability-09
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-LTLFireability-10
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-LTLFireability-11
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-LTLFireability-12
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-LTLFireability-13
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-LTLFireability-14
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678617429617

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V50P20N50
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 10:37:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 10:37:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 10:37:11] [INFO ] Load time of PNML (sax parser for PT used): 282 ms
[2023-03-12 10:37:11] [INFO ] Transformed 168 places.
[2023-03-12 10:37:11] [INFO ] Transformed 5408 transitions.
[2023-03-12 10:37:11] [INFO ] Parsed PT model containing 168 places and 5408 transitions and 42330 arcs in 390 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 44 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA BridgeAndVehicles-PT-V50P20N50-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N50-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 166 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 5408/5408 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 166 transition count 5408
Applied a total of 2 rules in 70 ms. Remains 166 /168 variables (removed 2) and now considering 5408/5408 (removed 0) transitions.
[2023-03-12 10:37:12] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 166 cols
[2023-03-12 10:37:12] [INFO ] Computed 5 place invariants in 22 ms
[2023-03-12 10:37:14] [INFO ] Dead Transitions using invariants and state equation in 1859 ms found 0 transitions.
[2023-03-12 10:37:14] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
[2023-03-12 10:37:14] [INFO ] Invariant cache hit.
[2023-03-12 10:37:14] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-12 10:37:14] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
[2023-03-12 10:37:14] [INFO ] Invariant cache hit.
[2023-03-12 10:37:14] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 10:37:14] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
[2023-03-12 10:37:14] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
[2023-03-12 10:37:14] [INFO ] Invariant cache hit.
[2023-03-12 10:37:16] [INFO ] Dead Transitions using invariants and state equation in 1566 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 166/168 places, 5408/5408 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3898 ms. Remains : 166/168 places, 5408/5408 transitions.
Support contains 166 out of 166 places after structural reductions.
[2023-03-12 10:37:17] [INFO ] Flatten gal took : 455 ms
[2023-03-12 10:37:18] [INFO ] Flatten gal took : 348 ms
[2023-03-12 10:37:19] [INFO ] Input system was already deterministic with 5408 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 1733 ms. (steps per millisecond=5 ) properties (out of 22) seen :14
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 1905 ms. (steps per millisecond=5 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 496 ms. (steps per millisecond=20 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 468 ms. (steps per millisecond=21 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 551 ms. (steps per millisecond=18 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 514 ms. (steps per millisecond=19 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 475 ms. (steps per millisecond=21 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 446 ms. (steps per millisecond=22 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 382 ms. (steps per millisecond=26 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-12 10:37:26] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
[2023-03-12 10:37:26] [INFO ] Invariant cache hit.
[2023-03-12 10:37:29] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:37:43] [INFO ] After 14702ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:4
[2023-03-12 10:37:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 10:37:57] [INFO ] After 13319ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :4
[2023-03-12 10:37:57] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 10:38:08] [INFO ] After 11427ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :4 sat :3
[2023-03-12 10:38:08] [INFO ] After 11429ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :3
Attempting to minimize the solution found.
Minimization took 0 ms.
[2023-03-12 10:38:08] [INFO ] After 25023ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :3
Fused 8 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 120 ms.
Support contains 107 out of 166 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 5408/5408 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 21 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 165 transition count 5407
Applied a total of 2 rules in 1353 ms. Remains 165 /166 variables (removed 1) and now considering 5407/5408 (removed 1) transitions.
[2023-03-12 10:38:10] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 165 cols
[2023-03-12 10:38:10] [INFO ] Computed 5 place invariants in 7 ms
[2023-03-12 10:38:11] [INFO ] Dead Transitions using invariants and state equation in 1683 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3038 ms. Remains : 165/166 places, 5407/5408 transitions.
Incomplete random walk after 10000 steps, including 27 resets, run finished after 1433 ms. (steps per millisecond=6 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 2506 ms. (steps per millisecond=3 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 555 ms. (steps per millisecond=18 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 523 ms. (steps per millisecond=19 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 431 ms. (steps per millisecond=23 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-12 10:38:17] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:38:17] [INFO ] Invariant cache hit.
[2023-03-12 10:38:19] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:38:33] [INFO ] After 13687ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 10:38:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 10:38:47] [INFO ] After 13909ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 10:38:47] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 10:38:58] [INFO ] After 10851ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 10:38:58] [INFO ] After 10853ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 0 ms.
[2023-03-12 10:38:58] [INFO ] After 25021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 114 ms.
Support contains 104 out of 165 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 165/165 places, 5407/5407 transitions.
Applied a total of 0 rules in 1136 ms. Remains 165 /165 variables (removed 0) and now considering 5407/5407 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1136 ms. Remains : 165/165 places, 5407/5407 transitions.
FORMULA BridgeAndVehicles-PT-V50P20N50-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 4 atomic propositions for a total of 13 simplifications.
FORMULA BridgeAndVehicles-PT-V50P20N50-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N50-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 109 stabilizing places and 204 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(F(p0)))||G(p1)) U p2))'
Support contains 107 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 5408/5408 transitions.
Applied a total of 0 rules in 21 ms. Remains 166 /166 variables (removed 0) and now considering 5408/5408 (removed 0) transitions.
[2023-03-12 10:39:00] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 166 cols
[2023-03-12 10:39:00] [INFO ] Computed 5 place invariants in 6 ms
[2023-03-12 10:39:01] [INFO ] Dead Transitions using invariants and state equation in 1599 ms found 0 transitions.
[2023-03-12 10:39:01] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
[2023-03-12 10:39:01] [INFO ] Invariant cache hit.
[2023-03-12 10:39:02] [INFO ] Implicit Places using invariants in 345 ms returned []
[2023-03-12 10:39:02] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
[2023-03-12 10:39:02] [INFO ] Invariant cache hit.
[2023-03-12 10:39:02] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 10:39:03] [INFO ] Implicit Places using invariants and state equation in 1816 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2176 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 164/166 places, 5408/5408 transitions.
Applied a total of 0 rules in 25 ms. Remains 164 /164 variables (removed 0) and now considering 5408/5408 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3824 ms. Remains : 164/166 places, 5408/5408 transitions.
Stuttering acceptance computed with spot in 377 ms :[(NOT p2), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N50-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(GEQ s52 1), p1:(OR (AND (GEQ s53 20) (GEQ s111 1)) (AND (GEQ s53 20) (GEQ s110 1))), p0:(OR (AND (GEQ s24 1) (GEQ s55 1) (GEQ s56 1) (GEQ s146 1)) (AN...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 408 steps with 0 reset in 109 ms.
FORMULA BridgeAndVehicles-PT-V50P20N50-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P20N50-LTLFireability-00 finished in 4427 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(p1)||G(p2)||p0)))'
Support contains 155 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 5408/5408 transitions.
Applied a total of 0 rules in 25 ms. Remains 166 /166 variables (removed 0) and now considering 5408/5408 (removed 0) transitions.
[2023-03-12 10:39:04] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
[2023-03-12 10:39:04] [INFO ] Invariant cache hit.
[2023-03-12 10:39:06] [INFO ] Dead Transitions using invariants and state equation in 1609 ms found 0 transitions.
[2023-03-12 10:39:06] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
[2023-03-12 10:39:06] [INFO ] Invariant cache hit.
[2023-03-12 10:39:06] [INFO ] Implicit Places using invariants in 151 ms returned []
[2023-03-12 10:39:06] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
[2023-03-12 10:39:06] [INFO ] Invariant cache hit.
[2023-03-12 10:39:06] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 10:39:07] [INFO ] Implicit Places using invariants and state equation in 885 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1056 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 164/166 places, 5408/5408 transitions.
Applied a total of 0 rules in 42 ms. Remains 164 /164 variables (removed 0) and now considering 5408/5408 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2734 ms. Remains : 164/166 places, 5408/5408 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N50-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(LT s109 1), p2:(AND (OR (LT s1 1) (LT s54 1) (LT s79 1) (LT s138 1)) (OR (LT s1 1) (LT s54 1) (LT s58 1) (LT s120 1)) (OR (LT s1 1) (LT s54 1) (LT s10...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2204 ms.
Product exploration explored 100000 steps with 50000 reset in 1913 ms.
Computed a total of 107 stabilizing places and 204 stable transitions
Computed a total of 107 stabilizing places and 204 stable transitions
Detected a total of 107/164 stabilizing places and 204/5408 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p1) p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1) p2)))
Knowledge based reduction with 8 factoid took 183 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-PT-V50P20N50-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V50P20N50-LTLFireability-01 finished in 7347 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((X(F(p1))&&p0)))'
Support contains 105 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 5408/5408 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 165 transition count 5407
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 165 transition count 5407
Applied a total of 2 rules in 53 ms. Remains 165 /166 variables (removed 1) and now considering 5407/5408 (removed 1) transitions.
[2023-03-12 10:39:11] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 165 cols
[2023-03-12 10:39:11] [INFO ] Computed 5 place invariants in 6 ms
[2023-03-12 10:39:13] [INFO ] Dead Transitions using invariants and state equation in 1517 ms found 0 transitions.
[2023-03-12 10:39:13] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:39:13] [INFO ] Invariant cache hit.
[2023-03-12 10:39:13] [INFO ] Implicit Places using invariants in 346 ms returned []
[2023-03-12 10:39:13] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:39:13] [INFO ] Invariant cache hit.
[2023-03-12 10:39:14] [INFO ] Implicit Places using invariants and state equation in 691 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1049 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 164/166 places, 5407/5408 transitions.
Applied a total of 0 rules in 75 ms. Remains 164 /164 variables (removed 0) and now considering 5407/5407 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2698 ms. Remains : 164/166 places, 5407/5408 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N50-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s0 1) (LT s21 1)) (OR (LT s0 1) (LT s23 1)) (OR (LT s0 1) (LT s17 1)) (OR (LT s0 1) (LT s19 1)) (OR (LT s0 1) (LT s29 1)) (OR (LT s0 1) (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, 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 581 reset in 1450 ms.
Product exploration explored 100000 steps with 587 reset in 1326 ms.
Computed a total of 107 stabilizing places and 203 stable transitions
Computed a total of 107 stabilizing places and 203 stable transitions
Detected a total of 107/164 stabilizing places and 203/5407 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 319 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 264 steps, including 0 resets, run visited all 2 properties in 10 ms. (steps per millisecond=26 )
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 373 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 82 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
[2023-03-12 10:39:18] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 164 cols
[2023-03-12 10:39:18] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 10:39:20] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 10:39:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:39:20] [INFO ] [Real]Absence check using state equation in 259 ms returned sat
[2023-03-12 10:39:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:39:23] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 10:39:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:39:23] [INFO ] [Nat]Absence check using state equation in 393 ms returned sat
[2023-03-12 10:39:23] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 10:39:24] [INFO ] [Nat]Added 102 Read/Feed constraints in 655 ms returned sat
[2023-03-12 10:39:24] [INFO ] Computed and/alt/rep : 150/298/150 causal constraints (skipped 256 transitions) in 371 ms.
[2023-03-12 10:39:25] [INFO ] Added : 48 causal constraints over 10 iterations in 790 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 105 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 5407/5407 transitions.
Applied a total of 0 rules in 23 ms. Remains 164 /164 variables (removed 0) and now considering 5407/5407 (removed 0) transitions.
[2023-03-12 10:39:25] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:39:25] [INFO ] Invariant cache hit.
[2023-03-12 10:39:26] [INFO ] Dead Transitions using invariants and state equation in 1641 ms found 0 transitions.
[2023-03-12 10:39:26] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:39:26] [INFO ] Invariant cache hit.
[2023-03-12 10:39:27] [INFO ] Implicit Places using invariants in 353 ms returned []
[2023-03-12 10:39:27] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:39:27] [INFO ] Invariant cache hit.
[2023-03-12 10:39:27] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 10:39:28] [INFO ] Implicit Places using invariants and state equation in 1546 ms returned []
Implicit Place search using SMT with State Equation took 1906 ms to find 0 implicit places.
[2023-03-12 10:39:28] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:39:28] [INFO ] Invariant cache hit.
[2023-03-12 10:39:30] [INFO ] Dead Transitions using invariants and state equation in 1718 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5291 ms. Remains : 164/164 places, 5407/5407 transitions.
Computed a total of 107 stabilizing places and 203 stable transitions
Computed a total of 107 stabilizing places and 203 stable transitions
Detected a total of 107/164 stabilizing places and 203/5407 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 251 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 184 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=36 )
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 241 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 67 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
[2023-03-12 10:39:31] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:39:31] [INFO ] Invariant cache hit.
[2023-03-12 10:39:33] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 10:39:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:39:33] [INFO ] [Real]Absence check using state equation in 262 ms returned sat
[2023-03-12 10:39:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:39:35] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 10:39:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:39:35] [INFO ] [Nat]Absence check using state equation in 263 ms returned sat
[2023-03-12 10:39:35] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 10:39:36] [INFO ] [Nat]Added 102 Read/Feed constraints in 1151 ms returned sat
[2023-03-12 10:39:37] [INFO ] Computed and/alt/rep : 150/298/150 causal constraints (skipped 256 transitions) in 685 ms.
[2023-03-12 10:39:38] [INFO ] Added : 29 causal constraints over 7 iterations in 1075 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 583 reset in 1596 ms.
Product exploration explored 100000 steps with 587 reset in 1402 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 105 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 5407/5407 transitions.
Applied a total of 0 rules in 1363 ms. Remains 164 /164 variables (removed 0) and now considering 5407/5407 (removed 0) transitions.
[2023-03-12 10:39:42] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:39:42] [INFO ] Invariant cache hit.
[2023-03-12 10:39:44] [INFO ] Dead Transitions using invariants and state equation in 1634 ms found 0 transitions.
[2023-03-12 10:39:44] [INFO ] Redundant transitions in 464 ms returned []
[2023-03-12 10:39:44] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:39:44] [INFO ] Invariant cache hit.
[2023-03-12 10:39:46] [INFO ] Dead Transitions using invariants and state equation in 1707 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5176 ms. Remains : 164/164 places, 5407/5407 transitions.
Support contains 105 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 5407/5407 transitions.
Applied a total of 0 rules in 25 ms. Remains 164 /164 variables (removed 0) and now considering 5407/5407 (removed 0) transitions.
[2023-03-12 10:39:46] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:39:46] [INFO ] Invariant cache hit.
[2023-03-12 10:39:48] [INFO ] Dead Transitions using invariants and state equation in 1707 ms found 0 transitions.
[2023-03-12 10:39:48] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:39:48] [INFO ] Invariant cache hit.
[2023-03-12 10:39:48] [INFO ] Implicit Places using invariants in 432 ms returned []
[2023-03-12 10:39:48] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:39:48] [INFO ] Invariant cache hit.
[2023-03-12 10:39:49] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 10:39:50] [INFO ] Implicit Places using invariants and state equation in 1610 ms returned []
Implicit Place search using SMT with State Equation took 2057 ms to find 0 implicit places.
[2023-03-12 10:39:50] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:39:50] [INFO ] Invariant cache hit.
[2023-03-12 10:39:52] [INFO ] Dead Transitions using invariants and state equation in 1752 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5546 ms. Remains : 164/164 places, 5407/5407 transitions.
Treatment of property BridgeAndVehicles-PT-V50P20N50-LTLFireability-03 finished in 40963 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 166 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 166/166 places, 5408/5408 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 165 transition count 5407
Applied a total of 2 rules in 1071 ms. Remains 165 /166 variables (removed 1) and now considering 5407/5408 (removed 1) transitions.
[2023-03-12 10:39:53] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 165 cols
[2023-03-12 10:39:53] [INFO ] Computed 5 place invariants in 7 ms
[2023-03-12 10:39:55] [INFO ] Dead Transitions using invariants and state equation in 1691 ms found 0 transitions.
[2023-03-12 10:39:55] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:39:55] [INFO ] Invariant cache hit.
[2023-03-12 10:39:56] [INFO ] Implicit Places using invariants in 598 ms returned []
[2023-03-12 10:39:56] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:39:56] [INFO ] Invariant cache hit.
[2023-03-12 10:39:57] [INFO ] Implicit Places using invariants and state equation in 1315 ms returned [52, 107]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1920 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 163/166 places, 5407/5408 transitions.
Applied a total of 0 rules in 1112 ms. Remains 163 /163 variables (removed 0) and now considering 5407/5407 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5799 ms. Remains : 163/166 places, 5407/5408 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N50-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s108 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 280 reset in 1621 ms.
Product exploration explored 100000 steps with 280 reset in 1500 ms.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Detected a total of 106/163 stabilizing places and 203/5407 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 194 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 204 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=34 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 170 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Support contains 1 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 5407/5407 transitions.
Applied a total of 0 rules in 983 ms. Remains 163 /163 variables (removed 0) and now considering 5407/5407 (removed 0) transitions.
[2023-03-12 10:40:03] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 163 cols
[2023-03-12 10:40:03] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-12 10:40:04] [INFO ] Dead Transitions using invariants and state equation in 1536 ms found 0 transitions.
[2023-03-12 10:40:04] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:40:04] [INFO ] Invariant cache hit.
[2023-03-12 10:40:05] [INFO ] Implicit Places using invariants in 656 ms returned []
[2023-03-12 10:40:05] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:40:05] [INFO ] Invariant cache hit.
[2023-03-12 10:40:05] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 10:40:08] [INFO ] Implicit Places using invariants and state equation in 2846 ms returned []
Implicit Place search using SMT with State Equation took 3506 ms to find 0 implicit places.
[2023-03-12 10:40:09] [INFO ] Redundant transitions in 609 ms returned []
[2023-03-12 10:40:09] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:40:09] [INFO ] Invariant cache hit.
[2023-03-12 10:40:10] [INFO ] Dead Transitions using invariants and state equation in 1539 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8188 ms. Remains : 163/163 places, 5407/5407 transitions.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Detected a total of 106/163 stabilizing places and 203/5407 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 116 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Finished random walk after 204 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=40 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 148 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 280 reset in 1421 ms.
Product exploration explored 100000 steps with 280 reset in 1694 ms.
Support contains 1 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 5407/5407 transitions.
Applied a total of 0 rules in 1079 ms. Remains 163 /163 variables (removed 0) and now considering 5407/5407 (removed 0) transitions.
[2023-03-12 10:40:15] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:40:15] [INFO ] Invariant cache hit.
[2023-03-12 10:40:16] [INFO ] Dead Transitions using invariants and state equation in 1607 ms found 0 transitions.
[2023-03-12 10:40:16] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:40:16] [INFO ] Invariant cache hit.
[2023-03-12 10:40:17] [INFO ] Implicit Places using invariants in 649 ms returned []
[2023-03-12 10:40:17] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:40:17] [INFO ] Invariant cache hit.
[2023-03-12 10:40:17] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 10:40:20] [INFO ] Implicit Places using invariants and state equation in 2693 ms returned []
Implicit Place search using SMT with State Equation took 3368 ms to find 0 implicit places.
[2023-03-12 10:40:20] [INFO ] Redundant transitions in 408 ms returned []
[2023-03-12 10:40:20] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:40:20] [INFO ] Invariant cache hit.
[2023-03-12 10:40:22] [INFO ] Dead Transitions using invariants and state equation in 1699 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8182 ms. Remains : 163/163 places, 5407/5407 transitions.
Treatment of property BridgeAndVehicles-PT-V50P20N50-LTLFireability-04 finished in 30186 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(p0&&F(p1))))))'
Support contains 4 out of 166 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 166/166 places, 5408/5408 transitions.
Applied a total of 0 rules in 1604 ms. Remains 166 /166 variables (removed 0) and now considering 5408/5408 (removed 0) transitions.
[2023-03-12 10:40:24] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 166 cols
[2023-03-12 10:40:24] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 10:40:26] [INFO ] Dead Transitions using invariants and state equation in 1697 ms found 0 transitions.
[2023-03-12 10:40:26] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
[2023-03-12 10:40:26] [INFO ] Invariant cache hit.
[2023-03-12 10:40:27] [INFO ] Implicit Places using invariants in 707 ms returned []
[2023-03-12 10:40:27] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
[2023-03-12 10:40:27] [INFO ] Invariant cache hit.
[2023-03-12 10:40:27] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 10:40:30] [INFO ] Implicit Places using invariants and state equation in 3406 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 4129 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 164/166 places, 5408/5408 transitions.
Applied a total of 0 rules in 1609 ms. Remains 164 /164 variables (removed 0) and now considering 5408/5408 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9045 ms. Remains : 164/166 places, 5408/5408 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N50-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (GEQ s53 20) (GEQ s111 1)) (AND (GEQ s53 20) (GEQ s110 1))), p0:(LT s109 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 366 reset in 1426 ms.
Product exploration explored 100000 steps with 372 reset in 1264 ms.
Computed a total of 107 stabilizing places and 204 stable transitions
Computed a total of 107 stabilizing places and 204 stable transitions
Detected a total of 107/164 stabilizing places and 204/5408 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 381 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Finished random walk after 266 steps, including 0 resets, run visited all 3 properties in 18 ms. (steps per millisecond=14 )
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (NOT (AND (NOT p1) p0))), (F (NOT p0))]
Knowledge based reduction with 8 factoid took 367 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 4 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 5408/5408 transitions.
Applied a total of 0 rules in 1402 ms. Remains 164 /164 variables (removed 0) and now considering 5408/5408 (removed 0) transitions.
[2023-03-12 10:40:37] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 164 cols
[2023-03-12 10:40:37] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-12 10:40:39] [INFO ] Dead Transitions using invariants and state equation in 1611 ms found 0 transitions.
[2023-03-12 10:40:39] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
[2023-03-12 10:40:39] [INFO ] Invariant cache hit.
[2023-03-12 10:40:39] [INFO ] Implicit Places using invariants in 588 ms returned []
[2023-03-12 10:40:39] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
[2023-03-12 10:40:39] [INFO ] Invariant cache hit.
[2023-03-12 10:40:40] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 10:40:42] [INFO ] Implicit Places using invariants and state equation in 2291 ms returned []
Implicit Place search using SMT with State Equation took 2885 ms to find 0 implicit places.
[2023-03-12 10:40:42] [INFO ] Redundant transitions in 318 ms returned []
[2023-03-12 10:40:42] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
[2023-03-12 10:40:42] [INFO ] Invariant cache hit.
[2023-03-12 10:40:44] [INFO ] Dead Transitions using invariants and state equation in 1751 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7983 ms. Remains : 164/164 places, 5408/5408 transitions.
Computed a total of 107 stabilizing places and 204 stable transitions
Computed a total of 107 stabilizing places and 204 stable transitions
Detected a total of 107/164 stabilizing places and 204/5408 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 248 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Finished random walk after 262 steps, including 0 resets, run visited all 3 properties in 10 ms. (steps per millisecond=26 )
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (NOT (AND (NOT p1) p0))), (F (NOT p0))]
Knowledge based reduction with 8 factoid took 297 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 359 reset in 1343 ms.
Product exploration explored 100000 steps with 355 reset in 1335 ms.
Support contains 4 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 5408/5408 transitions.
Applied a total of 0 rules in 1329 ms. Remains 164 /164 variables (removed 0) and now considering 5408/5408 (removed 0) transitions.
[2023-03-12 10:40:49] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
[2023-03-12 10:40:49] [INFO ] Invariant cache hit.
[2023-03-12 10:40:50] [INFO ] Dead Transitions using invariants and state equation in 1414 ms found 0 transitions.
[2023-03-12 10:40:50] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
[2023-03-12 10:40:50] [INFO ] Invariant cache hit.
[2023-03-12 10:40:51] [INFO ] Implicit Places using invariants in 661 ms returned []
[2023-03-12 10:40:51] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
[2023-03-12 10:40:51] [INFO ] Invariant cache hit.
[2023-03-12 10:40:51] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 10:40:54] [INFO ] Implicit Places using invariants and state equation in 3065 ms returned []
Implicit Place search using SMT with State Equation took 3728 ms to find 0 implicit places.
[2023-03-12 10:40:54] [INFO ] Redundant transitions in 394 ms returned []
[2023-03-12 10:40:54] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
[2023-03-12 10:40:54] [INFO ] Invariant cache hit.
[2023-03-12 10:40:56] [INFO ] Dead Transitions using invariants and state equation in 1598 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8471 ms. Remains : 164/164 places, 5408/5408 transitions.
Treatment of property BridgeAndVehicles-PT-V50P20N50-LTLFireability-05 finished in 33678 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 103 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 5408/5408 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 165 transition count 5407
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 165 transition count 5407
Applied a total of 2 rules in 44 ms. Remains 165 /166 variables (removed 1) and now considering 5407/5408 (removed 1) transitions.
[2023-03-12 10:40:56] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 165 cols
[2023-03-12 10:40:56] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 10:40:58] [INFO ] Dead Transitions using invariants and state equation in 1673 ms found 0 transitions.
[2023-03-12 10:40:58] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:40:58] [INFO ] Invariant cache hit.
[2023-03-12 10:40:58] [INFO ] Implicit Places using invariants in 258 ms returned []
[2023-03-12 10:40:58] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:40:58] [INFO ] Invariant cache hit.
[2023-03-12 10:40:59] [INFO ] Implicit Places using invariants and state equation in 593 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 859 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 163/166 places, 5407/5408 transitions.
Applied a total of 0 rules in 21 ms. Remains 163 /163 variables (removed 0) and now considering 5407/5407 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2599 ms. Remains : 163/166 places, 5407/5408 transitions.
Stuttering acceptance computed with spot in 122 ms :[p0, p0, p0]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N50-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (AND (GEQ s24 1) (GEQ s55 1) (GEQ s56 1) (GEQ s145 1)) (AND (GEQ s41 1) (GEQ s55 1) (GEQ s56 1) (GEQ s139 1)) (AND (GEQ s7 1) (GEQ s55 1) (GEQ s56 ...], 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 33333 reset in 4375 ms.
Product exploration explored 100000 steps with 33333 reset in 4294 ms.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT p0)))
Knowledge based reduction with 2 factoid took 72 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-PT-V50P20N50-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V50P20N50-LTLFireability-06 finished in 11565 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 104 out of 166 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 166/166 places, 5408/5408 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 165 transition count 5407
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 165 transition count 5407
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 163 transition count 5406
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 8 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 161 transition count 5404
Applied a total of 9 rules in 1344 ms. Remains 161 /166 variables (removed 5) and now considering 5404/5408 (removed 4) transitions.
[2023-03-12 10:41:09] [INFO ] Flow matrix only has 406 transitions (discarded 4998 similar events)
// Phase 1: matrix 406 rows 161 cols
[2023-03-12 10:41:09] [INFO ] Computed 4 place invariants in 7 ms
[2023-03-12 10:41:10] [INFO ] Implicit Places using invariants in 387 ms returned []
[2023-03-12 10:41:10] [INFO ] Flow matrix only has 406 transitions (discarded 4998 similar events)
[2023-03-12 10:41:10] [INFO ] Invariant cache hit.
[2023-03-12 10:41:10] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 10:41:11] [INFO ] Implicit Places using invariants and state equation in 1362 ms returned [52, 106]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1758 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 159/166 places, 5404/5408 transitions.
Applied a total of 0 rules in 990 ms. Remains 159 /159 variables (removed 0) and now considering 5404/5404 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4096 ms. Remains : 159/166 places, 5404/5408 transitions.
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N50-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (OR (LT s0 1) (LT s21 1)) (OR (LT s0 1) (LT s23 1)) (OR (LT s0 1) (LT s17 1)) (OR (LT s0 1) (LT s19 1)) (OR (LT s0 1) (LT s29 1)) (OR (LT s0 1) (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 679 reset in 1417 ms.
Product exploration explored 100000 steps with 681 reset in 1467 ms.
Computed a total of 104 stabilizing places and 202 stable transitions
Computed a total of 104 stabilizing places and 202 stable transitions
Detected a total of 104/159 stabilizing places and 202/5404 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 375 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 153 steps, including 0 resets, run visited all 2 properties in 7 ms. (steps per millisecond=21 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 7 factoid took 349 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2023-03-12 10:41:16] [INFO ] Flow matrix only has 406 transitions (discarded 4998 similar events)
// Phase 1: matrix 406 rows 159 cols
[2023-03-12 10:41:16] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-12 10:41:19] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-12 10:41:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:41:19] [INFO ] [Real]Absence check using state equation in 258 ms returned sat
[2023-03-12 10:41:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:41:22] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2023-03-12 10:41:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:41:23] [INFO ] [Nat]Absence check using state equation in 318 ms returned sat
[2023-03-12 10:41:23] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 10:41:25] [INFO ] [Nat]Added 102 Read/Feed constraints in 2697 ms returned sat
[2023-03-12 10:41:26] [INFO ] Computed and/alt/rep : 150/298/150 causal constraints (skipped 253 transitions) in 222 ms.
[2023-03-12 10:41:26] [INFO ] Added : 9 causal constraints over 4 iterations in 607 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 104 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 5404/5404 transitions.
Applied a total of 0 rules in 1045 ms. Remains 159 /159 variables (removed 0) and now considering 5404/5404 (removed 0) transitions.
[2023-03-12 10:41:27] [INFO ] Flow matrix only has 406 transitions (discarded 4998 similar events)
[2023-03-12 10:41:27] [INFO ] Invariant cache hit.
[2023-03-12 10:41:28] [INFO ] Implicit Places using invariants in 405 ms returned []
[2023-03-12 10:41:28] [INFO ] Flow matrix only has 406 transitions (discarded 4998 similar events)
[2023-03-12 10:41:28] [INFO ] Invariant cache hit.
[2023-03-12 10:41:28] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 10:41:28] [INFO ] Implicit Places using invariants and state equation in 810 ms returned []
Implicit Place search using SMT with State Equation took 1219 ms to find 0 implicit places.
[2023-03-12 10:41:29] [INFO ] Redundant transitions in 408 ms returned []
[2023-03-12 10:41:29] [INFO ] Flow matrix only has 406 transitions (discarded 4998 similar events)
[2023-03-12 10:41:29] [INFO ] Invariant cache hit.
[2023-03-12 10:41:30] [INFO ] Dead Transitions using invariants and state equation in 1621 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4307 ms. Remains : 159/159 places, 5404/5404 transitions.
Computed a total of 104 stabilizing places and 202 stable transitions
Computed a total of 104 stabilizing places and 202 stable transitions
Detected a total of 104/159 stabilizing places and 202/5404 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 230 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 743 steps, including 2 resets, run visited all 2 properties in 22 ms. (steps per millisecond=33 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 7 factoid took 411 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2023-03-12 10:41:31] [INFO ] Flow matrix only has 406 transitions (discarded 4998 similar events)
[2023-03-12 10:41:32] [INFO ] Invariant cache hit.
[2023-03-12 10:41:35] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-12 10:41:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:41:35] [INFO ] [Real]Absence check using state equation in 241 ms returned sat
[2023-03-12 10:41:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:41:38] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-12 10:41:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:41:38] [INFO ] [Nat]Absence check using state equation in 349 ms returned sat
[2023-03-12 10:41:38] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 10:41:41] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-12 10:41:44] [INFO ] [Nat]Added 102 Read/Feed constraints in 6043 ms returned unknown
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 683 reset in 1610 ms.
Product exploration explored 100000 steps with 682 reset in 1397 ms.
Support contains 104 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 5404/5404 transitions.
Applied a total of 0 rules in 1176 ms. Remains 159 /159 variables (removed 0) and now considering 5404/5404 (removed 0) transitions.
[2023-03-12 10:41:48] [INFO ] Flow matrix only has 406 transitions (discarded 4998 similar events)
[2023-03-12 10:41:48] [INFO ] Invariant cache hit.
[2023-03-12 10:41:49] [INFO ] Implicit Places using invariants in 453 ms returned []
[2023-03-12 10:41:49] [INFO ] Flow matrix only has 406 transitions (discarded 4998 similar events)
[2023-03-12 10:41:49] [INFO ] Invariant cache hit.
[2023-03-12 10:41:49] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 10:41:50] [INFO ] Implicit Places using invariants and state equation in 1009 ms returned []
Implicit Place search using SMT with State Equation took 1465 ms to find 0 implicit places.
[2023-03-12 10:41:50] [INFO ] Redundant transitions in 394 ms returned []
[2023-03-12 10:41:50] [INFO ] Flow matrix only has 406 transitions (discarded 4998 similar events)
[2023-03-12 10:41:50] [INFO ] Invariant cache hit.
[2023-03-12 10:41:52] [INFO ] Dead Transitions using invariants and state equation in 1705 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4754 ms. Remains : 159/159 places, 5404/5404 transitions.
Treatment of property BridgeAndVehicles-PT-V50P20N50-LTLFireability-07 finished in 44642 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 4 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 5408/5408 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 165 transition count 5407
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 165 transition count 5407
Applied a total of 2 rules in 49 ms. Remains 165 /166 variables (removed 1) and now considering 5407/5408 (removed 1) transitions.
[2023-03-12 10:41:52] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 165 cols
[2023-03-12 10:41:52] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 10:41:54] [INFO ] Dead Transitions using invariants and state equation in 1704 ms found 0 transitions.
[2023-03-12 10:41:54] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:41:54] [INFO ] Invariant cache hit.
[2023-03-12 10:41:55] [INFO ] Implicit Places using invariants in 613 ms returned []
[2023-03-12 10:41:55] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:41:55] [INFO ] Invariant cache hit.
[2023-03-12 10:41:56] [INFO ] Implicit Places using invariants and state equation in 1445 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2067 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 163/166 places, 5407/5408 transitions.
Applied a total of 0 rules in 32 ms. Remains 163 /163 variables (removed 0) and now considering 5407/5407 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3854 ms. Remains : 163/166 places, 5407/5408 transitions.
Stuttering acceptance computed with spot in 215 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N50-LTLFireability-11 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: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s1 1) (GEQ s54 1) (GEQ s73 1) (GEQ s115 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, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 405 steps with 0 reset in 10 ms.
FORMULA BridgeAndVehicles-PT-V50P20N50-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P20N50-LTLFireability-11 finished in 4118 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(F(!p0))||(F(!p0)&&X(G(!p1))))))'
Support contains 6 out of 166 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 166/166 places, 5408/5408 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 165 transition count 5407
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 165 transition count 5407
Applied a total of 2 rules in 1327 ms. Remains 165 /166 variables (removed 1) and now considering 5407/5408 (removed 1) transitions.
[2023-03-12 10:41:58] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:41:58] [INFO ] Invariant cache hit.
[2023-03-12 10:42:00] [INFO ] Dead Transitions using invariants and state equation in 1718 ms found 0 transitions.
[2023-03-12 10:42:00] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:42:00] [INFO ] Invariant cache hit.
[2023-03-12 10:42:00] [INFO ] Implicit Places using invariants in 714 ms returned []
[2023-03-12 10:42:00] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:42:00] [INFO ] Invariant cache hit.
[2023-03-12 10:42:02] [INFO ] Implicit Places using invariants and state equation in 1421 ms returned [108]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2143 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 164/166 places, 5407/5408 transitions.
Applied a total of 0 rules in 1229 ms. Remains 164 /164 variables (removed 0) and now considering 5407/5407 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6420 ms. Remains : 164/166 places, 5407/5408 transitions.
Stuttering acceptance computed with spot in 167 ms :[p0, (AND p0 p1), p0]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N50-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s36 1)), p1:(OR (AND (GEQ s0 1) (GEQ s36 1)) (AND (GEQ s10 1) (GEQ s52 1) (GEQ s54 1) (GEQ s55 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 290 reset in 1579 ms.
Product exploration explored 100000 steps with 293 reset in 1388 ms.
Computed a total of 107 stabilizing places and 203 stable transitions
Computed a total of 107 stabilizing places and 203 stable transitions
Detected a total of 107/164 stabilizing places and 203/5407 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 379 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(AND p1 p0), (AND p1 p0), p0]
Finished random walk after 140 steps, including 0 resets, run visited all 2 properties in 6 ms. (steps per millisecond=23 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p1 p0)), (F p0)]
Knowledge based reduction with 7 factoid took 352 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND p1 p0), (AND p1 p0), p0]
Stuttering acceptance computed with spot in 152 ms :[(AND p1 p0), (AND p1 p0), p0]
Support contains 6 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 5407/5407 transitions.
Applied a total of 0 rules in 52 ms. Remains 164 /164 variables (removed 0) and now considering 5407/5407 (removed 0) transitions.
[2023-03-12 10:42:07] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 164 cols
[2023-03-12 10:42:07] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 10:42:09] [INFO ] Dead Transitions using invariants and state equation in 1648 ms found 0 transitions.
[2023-03-12 10:42:09] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:42:09] [INFO ] Invariant cache hit.
[2023-03-12 10:42:10] [INFO ] Implicit Places using invariants in 543 ms returned []
[2023-03-12 10:42:10] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:42:10] [INFO ] Invariant cache hit.
[2023-03-12 10:42:10] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 10:42:12] [INFO ] Implicit Places using invariants and state equation in 2368 ms returned []
Implicit Place search using SMT with State Equation took 2926 ms to find 0 implicit places.
[2023-03-12 10:42:12] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:42:12] [INFO ] Invariant cache hit.
[2023-03-12 10:42:14] [INFO ] Dead Transitions using invariants and state equation in 1611 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6251 ms. Remains : 164/164 places, 5407/5407 transitions.
Computed a total of 107 stabilizing places and 203 stable transitions
Computed a total of 107 stabilizing places and 203 stable transitions
Detected a total of 107/164 stabilizing places and 203/5407 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), true, (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 226 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(AND p1 p0), (AND p1 p0), p0]
Finished random walk after 564 steps, including 1 resets, run visited all 2 properties in 17 ms. (steps per millisecond=33 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), true, (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p1 p0)), (F p0)]
Knowledge based reduction with 6 factoid took 294 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(AND p1 p0), (AND p1 p0), p0]
Stuttering acceptance computed with spot in 132 ms :[(AND p1 p0), (AND p1 p0), p0]
Stuttering acceptance computed with spot in 158 ms :[(AND p1 p0), (AND p1 p0), p0]
Product exploration explored 100000 steps with 283 reset in 1530 ms.
Product exploration explored 100000 steps with 292 reset in 1388 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 105 ms :[(AND p1 p0), (AND p1 p0), p0]
Support contains 6 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 5407/5407 transitions.
Applied a total of 0 rules in 1201 ms. Remains 164 /164 variables (removed 0) and now considering 5407/5407 (removed 0) transitions.
[2023-03-12 10:42:19] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:42:19] [INFO ] Invariant cache hit.
[2023-03-12 10:42:21] [INFO ] Dead Transitions using invariants and state equation in 1761 ms found 0 transitions.
[2023-03-12 10:42:21] [INFO ] Redundant transitions in 320 ms returned []
[2023-03-12 10:42:21] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:42:21] [INFO ] Invariant cache hit.
[2023-03-12 10:42:23] [INFO ] Dead Transitions using invariants and state equation in 1650 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4943 ms. Remains : 164/164 places, 5407/5407 transitions.
Support contains 6 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 5407/5407 transitions.
Applied a total of 0 rules in 24 ms. Remains 164 /164 variables (removed 0) and now considering 5407/5407 (removed 0) transitions.
[2023-03-12 10:42:23] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:42:23] [INFO ] Invariant cache hit.
[2023-03-12 10:42:24] [INFO ] Dead Transitions using invariants and state equation in 1513 ms found 0 transitions.
[2023-03-12 10:42:24] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:42:24] [INFO ] Invariant cache hit.
[2023-03-12 10:42:25] [INFO ] Implicit Places using invariants in 704 ms returned []
[2023-03-12 10:42:25] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:42:25] [INFO ] Invariant cache hit.
[2023-03-12 10:42:25] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 10:42:28] [INFO ] Implicit Places using invariants and state equation in 2510 ms returned []
Implicit Place search using SMT with State Equation took 3220 ms to find 0 implicit places.
[2023-03-12 10:42:28] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:42:28] [INFO ] Invariant cache hit.
[2023-03-12 10:42:29] [INFO ] Dead Transitions using invariants and state equation in 1680 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6440 ms. Remains : 164/164 places, 5407/5407 transitions.
Treatment of property BridgeAndVehicles-PT-V50P20N50-LTLFireability-12 finished in 33162 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(F(p1)))))'
Support contains 6 out of 166 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 166/166 places, 5408/5408 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 165 transition count 5407
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 165 transition count 5407
Applied a total of 2 rules in 1155 ms. Remains 165 /166 variables (removed 1) and now considering 5407/5408 (removed 1) transitions.
[2023-03-12 10:42:31] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 165 cols
[2023-03-12 10:42:31] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-12 10:42:32] [INFO ] Dead Transitions using invariants and state equation in 1602 ms found 0 transitions.
[2023-03-12 10:42:32] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:42:32] [INFO ] Invariant cache hit.
[2023-03-12 10:42:33] [INFO ] Implicit Places using invariants in 512 ms returned []
[2023-03-12 10:42:33] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:42:33] [INFO ] Invariant cache hit.
[2023-03-12 10:42:34] [INFO ] Implicit Places using invariants and state equation in 854 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1372 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 163/166 places, 5407/5408 transitions.
Applied a total of 0 rules in 1137 ms. Remains 163 /163 variables (removed 0) and now considering 5407/5407 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5270 ms. Remains : 163/166 places, 5407/5408 transitions.
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N50-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s23 1) (GEQ s55 1) (GEQ s56 1) (GEQ s119 1)), p1:(AND (GEQ s53 20) (GEQ s109 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 279 reset in 1402 ms.
Product exploration explored 100000 steps with 273 reset in 1333 ms.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 288 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 23 resets, run finished after 250 ms. (steps per millisecond=40 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 10:42:39] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 163 cols
[2023-03-12 10:42:39] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-12 10:42:39] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 10:42:39] [INFO ] After 319ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 10:42:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:42:39] [INFO ] After 308ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 10:42:39] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 10:42:40] [INFO ] After 712ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 10:42:40] [INFO ] After 980ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 205 ms.
[2023-03-12 10:42:41] [INFO ] After 1609ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 5407/5407 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 161 transition count 5406
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 9 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 159 transition count 5404
Applied a total of 7 rules in 1449 ms. Remains 159 /163 variables (removed 4) and now considering 5404/5407 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1450 ms. Remains : 159/163 places, 5404/5407 transitions.
Incomplete random walk after 10000 steps, including 32 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 92674 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 92674 steps, saw 32144 distinct states, run finished after 3005 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 10:42:45] [INFO ] Flow matrix only has 406 transitions (discarded 4998 similar events)
// Phase 1: matrix 406 rows 159 cols
[2023-03-12 10:42:45] [INFO ] Computed 4 place invariants in 5 ms
[2023-03-12 10:42:46] [INFO ] [Real]Absence check using 4 positive place invariants in 31 ms returned sat
[2023-03-12 10:42:46] [INFO ] After 337ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 10:42:46] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-12 10:42:46] [INFO ] After 287ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 10:42:46] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 10:42:47] [INFO ] After 448ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 10:42:47] [INFO ] After 557ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 78 ms.
[2023-03-12 10:42:47] [INFO ] After 1075ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 5404/5404 transitions.
Applied a total of 0 rules in 1113 ms. Remains 159 /159 variables (removed 0) and now considering 5404/5404 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1114 ms. Remains : 159/159 places, 5404/5404 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 5404/5404 transitions.
Applied a total of 0 rules in 1002 ms. Remains 159 /159 variables (removed 0) and now considering 5404/5404 (removed 0) transitions.
[2023-03-12 10:42:49] [INFO ] Flow matrix only has 406 transitions (discarded 4998 similar events)
[2023-03-12 10:42:49] [INFO ] Invariant cache hit.
[2023-03-12 10:42:50] [INFO ] Implicit Places using invariants in 606 ms returned []
[2023-03-12 10:42:50] [INFO ] Flow matrix only has 406 transitions (discarded 4998 similar events)
[2023-03-12 10:42:50] [INFO ] Invariant cache hit.
[2023-03-12 10:42:50] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 10:42:51] [INFO ] Implicit Places using invariants and state equation in 1736 ms returned []
Implicit Place search using SMT with State Equation took 2345 ms to find 0 implicit places.
[2023-03-12 10:42:52] [INFO ] Redundant transitions in 395 ms returned []
[2023-03-12 10:42:52] [INFO ] Flow matrix only has 406 transitions (discarded 4998 similar events)
[2023-03-12 10:42:52] [INFO ] Invariant cache hit.
[2023-03-12 10:42:53] [INFO ] Dead Transitions using invariants and state equation in 1726 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5476 ms. Remains : 159/159 places, 5404/5404 transitions.
Ensure Unique test removed 4998 transitions
Reduce isomorphic transitions removed 4998 transitions.
Iterating post reduction 0 with 4998 rules applied. Total rules applied 4998 place count 159 transition count 406
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5000 place count 159 transition count 404
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5002 place count 157 transition count 404
Applied a total of 5002 rules in 17 ms. Remains 157 /159 variables (removed 2) and now considering 404/5404 (removed 5000) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 404 rows 157 cols
[2023-03-12 10:42:53] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-12 10:42:53] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 10:42:54] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 10:42:54] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 10:42:54] [INFO ] After 87ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 10:42:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 10:42:54] [INFO ] After 14ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 10:42:54] [INFO ] After 34ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-12 10:42:54] [INFO ] After 173ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 5 factoid took 232 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-12 10:42:54] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 163 cols
[2023-03-12 10:42:54] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-12 10:42:56] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2023-03-12 10:42:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:42:56] [INFO ] [Real]Absence check using state equation in 322 ms returned sat
[2023-03-12 10:42:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:42:57] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 10:42:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:42:57] [INFO ] [Nat]Absence check using state equation in 230 ms returned sat
[2023-03-12 10:42:57] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 10:43:00] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-12 10:43:03] [INFO ] [Nat]Added 102 Read/Feed constraints in 6029 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 6 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 5407/5407 transitions.
Applied a total of 0 rules in 1189 ms. Remains 163 /163 variables (removed 0) and now considering 5407/5407 (removed 0) transitions.
[2023-03-12 10:43:05] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:43:05] [INFO ] Invariant cache hit.
[2023-03-12 10:43:06] [INFO ] Dead Transitions using invariants and state equation in 1631 ms found 0 transitions.
[2023-03-12 10:43:06] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:43:06] [INFO ] Invariant cache hit.
[2023-03-12 10:43:07] [INFO ] Implicit Places using invariants in 575 ms returned []
[2023-03-12 10:43:07] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:43:07] [INFO ] Invariant cache hit.
[2023-03-12 10:43:07] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 10:43:09] [INFO ] Implicit Places using invariants and state equation in 2383 ms returned []
Implicit Place search using SMT with State Equation took 2963 ms to find 0 implicit places.
[2023-03-12 10:43:10] [INFO ] Redundant transitions in 421 ms returned []
[2023-03-12 10:43:10] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:43:10] [INFO ] Invariant cache hit.
[2023-03-12 10:43:11] [INFO ] Dead Transitions using invariants and state equation in 1651 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7870 ms. Remains : 163/163 places, 5407/5407 transitions.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 226 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 23 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 10:43:12] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:43:12] [INFO ] Invariant cache hit.
[2023-03-12 10:43:12] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 10:43:12] [INFO ] After 297ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 10:43:12] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:43:12] [INFO ] After 292ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 10:43:13] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 10:43:13] [INFO ] After 697ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 10:43:13] [INFO ] After 796ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-12 10:43:13] [INFO ] After 1222ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 5407/5407 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 161 transition count 5406
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 9 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 159 transition count 5404
Applied a total of 7 rules in 1101 ms. Remains 159 /163 variables (removed 4) and now considering 5404/5407 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1104 ms. Remains : 159/163 places, 5404/5407 transitions.
Incomplete random walk after 10000 steps, including 32 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 107122 steps, run timeout after 3010 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 107122 steps, saw 37055 distinct states, run finished after 3011 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 10:43:18] [INFO ] Flow matrix only has 406 transitions (discarded 4998 similar events)
// Phase 1: matrix 406 rows 159 cols
[2023-03-12 10:43:18] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-12 10:43:18] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 10:43:18] [INFO ] After 333ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 10:43:18] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-12 10:43:18] [INFO ] After 257ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 10:43:18] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 10:43:19] [INFO ] After 463ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 10:43:19] [INFO ] After 583ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-12 10:43:19] [INFO ] After 1006ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 5404/5404 transitions.
Applied a total of 0 rules in 1019 ms. Remains 159 /159 variables (removed 0) and now considering 5404/5404 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1020 ms. Remains : 159/159 places, 5404/5404 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 5404/5404 transitions.
Applied a total of 0 rules in 913 ms. Remains 159 /159 variables (removed 0) and now considering 5404/5404 (removed 0) transitions.
[2023-03-12 10:43:21] [INFO ] Flow matrix only has 406 transitions (discarded 4998 similar events)
[2023-03-12 10:43:21] [INFO ] Invariant cache hit.
[2023-03-12 10:43:22] [INFO ] Implicit Places using invariants in 602 ms returned []
[2023-03-12 10:43:22] [INFO ] Flow matrix only has 406 transitions (discarded 4998 similar events)
[2023-03-12 10:43:22] [INFO ] Invariant cache hit.
[2023-03-12 10:43:22] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 10:43:24] [INFO ] Implicit Places using invariants and state equation in 2203 ms returned []
Implicit Place search using SMT with State Equation took 2809 ms to find 0 implicit places.
[2023-03-12 10:43:24] [INFO ] Redundant transitions in 284 ms returned []
[2023-03-12 10:43:24] [INFO ] Flow matrix only has 406 transitions (discarded 4998 similar events)
[2023-03-12 10:43:24] [INFO ] Invariant cache hit.
[2023-03-12 10:43:26] [INFO ] Dead Transitions using invariants and state equation in 1679 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5704 ms. Remains : 159/159 places, 5404/5404 transitions.
Ensure Unique test removed 4998 transitions
Reduce isomorphic transitions removed 4998 transitions.
Iterating post reduction 0 with 4998 rules applied. Total rules applied 4998 place count 159 transition count 406
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5000 place count 159 transition count 404
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5002 place count 157 transition count 404
Applied a total of 5002 rules in 15 ms. Remains 157 /159 variables (removed 2) and now considering 404/5404 (removed 5000) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 404 rows 157 cols
[2023-03-12 10:43:26] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-12 10:43:26] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 10:43:26] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 10:43:26] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 10:43:26] [INFO ] After 87ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 10:43:26] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 10:43:26] [INFO ] After 12ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 10:43:26] [INFO ] After 29ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-12 10:43:26] [INFO ] After 166ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 5 factoid took 230 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-12 10:43:27] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 163 cols
[2023-03-12 10:43:27] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 10:43:28] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-12 10:43:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:43:28] [INFO ] [Real]Absence check using state equation in 284 ms returned sat
[2023-03-12 10:43:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:43:29] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 10:43:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:43:29] [INFO ] [Nat]Absence check using state equation in 225 ms returned sat
[2023-03-12 10:43:29] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 10:43:32] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-12 10:43:34] [INFO ] [Nat]Added 102 Read/Feed constraints in 4275 ms returned sat
[2023-03-12 10:43:34] [INFO ] Deduced a trap composed of 5 places in 683 ms of which 1 ms to minimize.
[2023-03-12 10:43:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1879 ms
[2023-03-12 10:43:36] [INFO ] Computed and/alt/rep : 150/298/150 causal constraints (skipped 256 transitions) in 184 ms.
[2023-03-12 10:43:36] [INFO ] Added : 40 causal constraints over 8 iterations in 512 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 283 reset in 1436 ms.
Product exploration explored 100000 steps with 285 reset in 1287 ms.
Support contains 6 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 5407/5407 transitions.
Applied a total of 0 rules in 1332 ms. Remains 163 /163 variables (removed 0) and now considering 5407/5407 (removed 0) transitions.
[2023-03-12 10:43:40] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:43:40] [INFO ] Invariant cache hit.
[2023-03-12 10:43:42] [INFO ] Dead Transitions using invariants and state equation in 1540 ms found 0 transitions.
[2023-03-12 10:43:42] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:43:42] [INFO ] Invariant cache hit.
[2023-03-12 10:43:42] [INFO ] Implicit Places using invariants in 632 ms returned []
[2023-03-12 10:43:42] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:43:42] [INFO ] Invariant cache hit.
[2023-03-12 10:43:43] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 10:43:45] [INFO ] Implicit Places using invariants and state equation in 2104 ms returned []
Implicit Place search using SMT with State Equation took 2739 ms to find 0 implicit places.
[2023-03-12 10:43:45] [INFO ] Redundant transitions in 396 ms returned []
[2023-03-12 10:43:45] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:43:45] [INFO ] Invariant cache hit.
[2023-03-12 10:43:47] [INFO ] Dead Transitions using invariants and state equation in 1695 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7717 ms. Remains : 163/163 places, 5407/5407 transitions.
Treatment of property BridgeAndVehicles-PT-V50P20N50-LTLFireability-14 finished in 77310 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 5 out of 166 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 166/166 places, 5408/5408 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 165 transition count 5407
Applied a total of 2 rules in 1162 ms. Remains 165 /166 variables (removed 1) and now considering 5407/5408 (removed 1) transitions.
[2023-03-12 10:43:48] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 165 cols
[2023-03-12 10:43:48] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 10:43:50] [INFO ] Dead Transitions using invariants and state equation in 1666 ms found 0 transitions.
[2023-03-12 10:43:50] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:43:50] [INFO ] Invariant cache hit.
[2023-03-12 10:43:50] [INFO ] Implicit Places using invariants in 461 ms returned []
[2023-03-12 10:43:50] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:43:50] [INFO ] Invariant cache hit.
[2023-03-12 10:43:50] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 10:43:53] [INFO ] Implicit Places using invariants and state equation in 2874 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 3369 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 163/166 places, 5407/5408 transitions.
Applied a total of 0 rules in 1140 ms. Remains 163 /163 variables (removed 0) and now considering 5407/5407 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7340 ms. Remains : 163/166 places, 5407/5408 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N50-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s52 1) (GEQ s26 1) (GEQ s55 1) (GEQ s56 1) (GEQ s132 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 356 steps with 0 reset in 5 ms.
FORMULA BridgeAndVehicles-PT-V50P20N50-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P20N50-LTLFireability-15 finished in 7433 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((X(F(p1))&&p0)))'
Found a Shortening insensitive property : BridgeAndVehicles-PT-V50P20N50-LTLFireability-03
Stuttering acceptance computed with spot in 53 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 105 out of 166 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 166/166 places, 5408/5408 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 165 transition count 5407
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 165 transition count 5407
Applied a total of 2 rules in 66 ms. Remains 165 /166 variables (removed 1) and now considering 5407/5408 (removed 1) transitions.
[2023-03-12 10:43:55] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 165 cols
[2023-03-12 10:43:55] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 10:43:56] [INFO ] Dead Transitions using invariants and state equation in 1519 ms found 0 transitions.
[2023-03-12 10:43:56] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:43:56] [INFO ] Invariant cache hit.
[2023-03-12 10:43:57] [INFO ] Implicit Places using invariants in 394 ms returned []
[2023-03-12 10:43:57] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:43:57] [INFO ] Invariant cache hit.
[2023-03-12 10:43:57] [INFO ] Implicit Places using invariants and state equation in 739 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1140 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 164/166 places, 5407/5408 transitions.
Applied a total of 0 rules in 38 ms. Remains 164 /164 variables (removed 0) and now considering 5407/5407 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2765 ms. Remains : 164/166 places, 5407/5408 transitions.
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N50-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s0 1) (LT s21 1)) (OR (LT s0 1) (LT s23 1)) (OR (LT s0 1) (LT s17 1)) (OR (LT s0 1) (LT s19 1)) (OR (LT s0 1) (LT s29 1)) (OR (LT s0 1) (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, 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 585 reset in 1302 ms.
Product exploration explored 100000 steps with 584 reset in 1317 ms.
Computed a total of 107 stabilizing places and 203 stable transitions
Computed a total of 107 stabilizing places and 203 stable transitions
Detected a total of 107/164 stabilizing places and 203/5407 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 168 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 87 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 189 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=47 )
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 269 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 45 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
[2023-03-12 10:44:01] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 164 cols
[2023-03-12 10:44:01] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 10:44:03] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 10:44:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:44:03] [INFO ] [Real]Absence check using state equation in 273 ms returned sat
[2023-03-12 10:44:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:44:05] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 10:44:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:44:05] [INFO ] [Nat]Absence check using state equation in 273 ms returned sat
[2023-03-12 10:44:06] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 10:44:06] [INFO ] [Nat]Added 102 Read/Feed constraints in 496 ms returned sat
[2023-03-12 10:44:06] [INFO ] Computed and/alt/rep : 150/298/150 causal constraints (skipped 256 transitions) in 202 ms.
[2023-03-12 10:44:07] [INFO ] Added : 48 causal constraints over 10 iterations in 611 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 105 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 5407/5407 transitions.
Applied a total of 0 rules in 24 ms. Remains 164 /164 variables (removed 0) and now considering 5407/5407 (removed 0) transitions.
[2023-03-12 10:44:07] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:44:07] [INFO ] Invariant cache hit.
[2023-03-12 10:44:08] [INFO ] Dead Transitions using invariants and state equation in 1648 ms found 0 transitions.
[2023-03-12 10:44:08] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:44:08] [INFO ] Invariant cache hit.
[2023-03-12 10:44:09] [INFO ] Implicit Places using invariants in 381 ms returned []
[2023-03-12 10:44:09] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:44:09] [INFO ] Invariant cache hit.
[2023-03-12 10:44:09] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 10:44:11] [INFO ] Implicit Places using invariants and state equation in 2078 ms returned []
Implicit Place search using SMT with State Equation took 2465 ms to find 0 implicit places.
[2023-03-12 10:44:11] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:44:11] [INFO ] Invariant cache hit.
[2023-03-12 10:44:12] [INFO ] Dead Transitions using invariants and state equation in 1507 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5651 ms. Remains : 164/164 places, 5407/5407 transitions.
Computed a total of 107 stabilizing places and 203 stable transitions
Computed a total of 107 stabilizing places and 203 stable transitions
Detected a total of 107/164 stabilizing places and 203/5407 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 165 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 47 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 262 steps, including 0 resets, run visited all 2 properties in 7 ms. (steps per millisecond=37 )
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 287 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 51 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 66 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
[2023-03-12 10:44:13] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:44:13] [INFO ] Invariant cache hit.
[2023-03-12 10:44:15] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 10:44:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:44:15] [INFO ] [Real]Absence check using state equation in 308 ms returned sat
[2023-03-12 10:44:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:44:17] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 10:44:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:44:17] [INFO ] [Nat]Absence check using state equation in 223 ms returned sat
[2023-03-12 10:44:17] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 10:44:18] [INFO ] [Nat]Added 102 Read/Feed constraints in 1136 ms returned sat
[2023-03-12 10:44:19] [INFO ] Computed and/alt/rep : 150/298/150 causal constraints (skipped 256 transitions) in 205 ms.
[2023-03-12 10:44:19] [INFO ] Added : 29 causal constraints over 7 iterations in 590 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 585 reset in 1478 ms.
Product exploration explored 100000 steps with 584 reset in 1314 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 105 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 5407/5407 transitions.
Applied a total of 0 rules in 1188 ms. Remains 164 /164 variables (removed 0) and now considering 5407/5407 (removed 0) transitions.
[2023-03-12 10:44:23] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:44:23] [INFO ] Invariant cache hit.
[2023-03-12 10:44:25] [INFO ] Dead Transitions using invariants and state equation in 1502 ms found 0 transitions.
[2023-03-12 10:44:25] [INFO ] Redundant transitions in 319 ms returned []
[2023-03-12 10:44:25] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:44:25] [INFO ] Invariant cache hit.
[2023-03-12 10:44:27] [INFO ] Dead Transitions using invariants and state equation in 1429 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4445 ms. Remains : 164/164 places, 5407/5407 transitions.
Support contains 105 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 5407/5407 transitions.
Applied a total of 0 rules in 18 ms. Remains 164 /164 variables (removed 0) and now considering 5407/5407 (removed 0) transitions.
[2023-03-12 10:44:27] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:44:27] [INFO ] Invariant cache hit.
[2023-03-12 10:44:28] [INFO ] Dead Transitions using invariants and state equation in 1472 ms found 0 transitions.
[2023-03-12 10:44:28] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:44:28] [INFO ] Invariant cache hit.
[2023-03-12 10:44:29] [INFO ] Implicit Places using invariants in 366 ms returned []
[2023-03-12 10:44:29] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:44:29] [INFO ] Invariant cache hit.
[2023-03-12 10:44:29] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 10:44:30] [INFO ] Implicit Places using invariants and state equation in 1265 ms returned []
Implicit Place search using SMT with State Equation took 1645 ms to find 0 implicit places.
[2023-03-12 10:44:30] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
[2023-03-12 10:44:30] [INFO ] Invariant cache hit.
[2023-03-12 10:44:32] [INFO ] Dead Transitions using invariants and state equation in 1703 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4841 ms. Remains : 164/164 places, 5407/5407 transitions.
Treatment of property BridgeAndVehicles-PT-V50P20N50-LTLFireability-03 finished in 37401 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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(p0&&F(p1))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
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(F(!p0))||(F(!p0)&&X(G(!p1))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(F(p1)))))'
[2023-03-12 10:44:33] [INFO ] Flatten gal took : 156 ms
[2023-03-12 10:44:33] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2023-03-12 10:44:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 166 places, 5408 transitions and 42328 arcs took 31 ms.
Total runtime 441851 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2300/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2300/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2300/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2300/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2300/ltl_4_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2300/ltl_5_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N50-LTLFireability-03
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N50-LTLFireability-04
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N50-LTLFireability-05
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N50-LTLFireability-07
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N50-LTLFireability-12
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N50-LTLFireability-14

BK_STOP 1678617881856

--------------------
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 LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name BridgeAndVehicles-PT-V50P20N50-LTLFireability-03
ltl formula formula --ltl=/tmp/2300/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 166 places, 5408 transitions and 42328 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 1.050 real 0.210 user 0.430 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2300/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2300/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2300/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2300/ltl_0_
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** 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:
malloc_consolidate(): invalid chunk size
ltl formula name BridgeAndVehicles-PT-V50P20N50-LTLFireability-04
ltl formula formula --ltl=/tmp/2300/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: =============================================================================
Warning: program compiled against libxml 210 using older 209
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 166 places, 5408 transitions and 42328 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 1.020 real 0.250 user 0.260 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2300/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2300/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2300/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2300/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name BridgeAndVehicles-PT-V50P20N50-LTLFireability-05
ltl formula formula --ltl=/tmp/2300/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
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 166 places, 5408 transitions and 42328 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2300/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2300/ltl_2_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.070 real 0.250 user 0.180 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2300/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2300/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name BridgeAndVehicles-PT-V50P20N50-LTLFireability-07
ltl formula formula --ltl=/tmp/2300/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 166 places, 5408 transitions and 42328 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 1.140 real 0.220 user 0.190 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2300/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2300/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2300/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2300/ltl_3_
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** 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:
malloc_consolidate(): invalid chunk size
ltl formula name BridgeAndVehicles-PT-V50P20N50-LTLFireability-12
ltl formula formula --ltl=/tmp/2300/ltl_4_
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 166 places, 5408 transitions and 42328 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2300/ltl_4_
pnml2lts-mc( 0/ 4): Loading Petri net took 1.040 real 0.190 user 0.190 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2300/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2300/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2300/ltl_4_
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
*** 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) [0x55d184c993f4]
1: pnml2lts-mc(+0xa2496) [0x55d184c99496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f4a8a8e6140]
3: pnml2lts-mc(+0x405be5) [0x55d184ffcbe5]
4: pnml2lts-mc(+0x16b3f9) [0x55d184d623f9]
5: pnml2lts-mc(+0x164ac4) [0x55d184d5bac4]
6: pnml2lts-mc(+0x272e0a) [0x55d184e69e0a]
7: pnml2lts-mc(+0xb61f0) [0x55d184cad1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f4a8a7394d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f4a8a73967a]
10: pnml2lts-mc(+0xa1581) [0x55d184c98581]
11: pnml2lts-mc(+0xa1910) [0x55d184c98910]
12: pnml2lts-mc(+0xa32a2) [0x55d184c9a2a2]
13: pnml2lts-mc(+0xa50f4) [0x55d184c9c0f4]
14: pnml2lts-mc(+0xa516b) [0x55d184c9c16b]
15: pnml2lts-mc(+0x3f34b3) [0x55d184fea4b3]
16: pnml2lts-mc(+0x7c63d) [0x55d184c7363d]
17: pnml2lts-mc(+0x67d86) [0x55d184c5ed86]
18: pnml2lts-mc(+0x60a8a) [0x55d184c57a8a]
19: pnml2lts-mc(+0x5eb15) [0x55d184c55b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f4a8a721d0a]
21: pnml2lts-mc(+0x6075e) [0x55d184c5775e]
ltl formula name BridgeAndVehicles-PT-V50P20N50-LTLFireability-14
ltl formula formula --ltl=/tmp/2300/ltl_5_
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 166 places, 5408 transitions and 42328 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 1.040 real 0.220 user 0.220 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2300/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2300/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2300/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2300/ltl_5_
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
*** 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:

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="BridgeAndVehicles-PT-V50P20N50"
export BK_EXAMINATION="LTLFireability"
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 BridgeAndVehicles-PT-V50P20N50, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r041-tajo-167813694400244"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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