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

About the Execution of LTSMin+red for BridgeAndVehicles-COL-V50P20N20

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1310.264 1293988.00 4893275.00 198.30 FFFF?FT?TFT?FTTF normal

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-167813694200076.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-COL-V50P20N20, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694200076
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 8.0K Feb 25 12:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 25 12:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 12:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 12:18 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 4.5K Feb 25 15:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 15:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 12:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 25 12:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 12:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 25 12:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 42K 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-COL-V50P20N20-LTLFireability-00
FORMULA_NAME BridgeAndVehicles-COL-V50P20N20-LTLFireability-01
FORMULA_NAME BridgeAndVehicles-COL-V50P20N20-LTLFireability-02
FORMULA_NAME BridgeAndVehicles-COL-V50P20N20-LTLFireability-03
FORMULA_NAME BridgeAndVehicles-COL-V50P20N20-LTLFireability-04
FORMULA_NAME BridgeAndVehicles-COL-V50P20N20-LTLFireability-05
FORMULA_NAME BridgeAndVehicles-COL-V50P20N20-LTLFireability-06
FORMULA_NAME BridgeAndVehicles-COL-V50P20N20-LTLFireability-07
FORMULA_NAME BridgeAndVehicles-COL-V50P20N20-LTLFireability-08
FORMULA_NAME BridgeAndVehicles-COL-V50P20N20-LTLFireability-09
FORMULA_NAME BridgeAndVehicles-COL-V50P20N20-LTLFireability-10
FORMULA_NAME BridgeAndVehicles-COL-V50P20N20-LTLFireability-11
FORMULA_NAME BridgeAndVehicles-COL-V50P20N20-LTLFireability-12
FORMULA_NAME BridgeAndVehicles-COL-V50P20N20-LTLFireability-13
FORMULA_NAME BridgeAndVehicles-COL-V50P20N20-LTLFireability-14
FORMULA_NAME BridgeAndVehicles-COL-V50P20N20-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678605367106

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-COL-V50P20N20
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 07:16:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 07:16:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 07:16:09] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-12 07:16:09] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-12 07:16:09] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 559 ms
[2023-03-12 07:16:09] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 138 PT places and 218878.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2023-03-12 07:16:09] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 5 ms.
[2023-03-12 07:16:09] [INFO ] Skeletonized 10 HLPN properties in 1 ms. Removed 6 properties that had guard overlaps.
Initial state reduction rules removed 2 formulas.
FORMULA BridgeAndVehicles-COL-V50P20N20-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P20N20-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 12 stabilizing places and 6 stable transitions
Graph (complete) has 51 edges and 15 vertex of which 13 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Remains 2 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Computed a total of 9 stabilizing places and 6 stable transitions
Graph (complete) has 22 edges and 12 vertex of which 10 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Finished random walk after 105 steps, including 0 resets, run visited all 2 properties in 7 ms. (steps per millisecond=15 )
[2023-03-12 07:16:09] [INFO ] Flatten gal took : 15 ms
[2023-03-12 07:16:09] [INFO ] Flatten gal took : 2 ms
Arc [1:1*[(MOD (ADD $cA 1) 51)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 51) 51) 51)]] contains successor/predecessor on variables of sort voitureB
Arc [13:1*[(MOD (ADD $cpt 1) 21)]] contains successor/predecessor on variables of sort compteur
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2023-03-12 07:16:10] [INFO ] Unfolded HLPN to a Petri net with 138 places and 2348 transitions 18090 arcs in 92 ms.
[2023-03-12 07:16:10] [INFO ] Unfolded 14 HLPN properties in 3 ms.
Initial state reduction rules removed 3 formulas.
FORMULA BridgeAndVehicles-COL-V50P20N20-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P20N20-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P20N20-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 136 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 136 transition count 2348
Applied a total of 2 rules in 45 ms. Remains 136 /138 variables (removed 2) and now considering 2348/2348 (removed 0) transitions.
[2023-03-12 07:16:10] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2023-03-12 07:16:10] [INFO ] Computed 5 place invariants in 16 ms
[2023-03-12 07:16:11] [INFO ] Dead Transitions using invariants and state equation in 972 ms found 0 transitions.
[2023-03-12 07:16:11] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:16:11] [INFO ] Invariant cache hit.
[2023-03-12 07:16:11] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-12 07:16:11] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:16:11] [INFO ] Invariant cache hit.
[2023-03-12 07:16:11] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:16:11] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2023-03-12 07:16:11] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:16:11] [INFO ] Invariant cache hit.
[2023-03-12 07:16:12] [INFO ] Dead Transitions using invariants and state equation in 746 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 136/138 places, 2348/2348 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2047 ms. Remains : 136/138 places, 2348/2348 transitions.
Support contains 136 out of 136 places after structural reductions.
[2023-03-12 07:16:12] [INFO ] Flatten gal took : 238 ms
[2023-03-12 07:16:13] [INFO ] Flatten gal took : 243 ms
[2023-03-12 07:16:14] [INFO ] Input system was already deterministic with 2348 transitions.
Finished random walk after 1690 steps, including 3 resets, run visited all 17 properties in 570 ms. (steps per millisecond=2 )
FORMULA BridgeAndVehicles-COL-V50P20N20-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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((G(!p0) U (p1&&G(!p0)))))'
Support contains 125 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 135 transition count 2347
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 2347
Applied a total of 2 rules in 20 ms. Remains 135 /136 variables (removed 1) and now considering 2347/2348 (removed 1) transitions.
[2023-03-12 07:16:15] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2023-03-12 07:16:15] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 07:16:16] [INFO ] Dead Transitions using invariants and state equation in 714 ms found 0 transitions.
[2023-03-12 07:16:16] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:16:16] [INFO ] Invariant cache hit.
[2023-03-12 07:16:16] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-12 07:16:16] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:16:16] [INFO ] Invariant cache hit.
[2023-03-12 07:16:16] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:16:17] [INFO ] Implicit Places using invariants and state equation in 364 ms returned [53]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 465 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 134/136 places, 2347/2348 transitions.
Applied a total of 0 rules in 15 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1219 ms. Remains : 134/136 places, 2347/2348 transitions.
Stuttering acceptance computed with spot in 246 ms :[p0, (OR (NOT p1) p0), true, (OR (NOT p1) p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P20N20-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=p0, acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(OR (AND (GEQ s45 1) (GEQ s54 1) (GEQ s108 1) (GEQ s119 1)) (AND (GEQ s28 1) (GEQ s54 1) (GEQ s108 1) (GEQ s125 1)) (AND (GEQ s7 1) (GEQ s54 1) (GEQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 383 steps with 0 reset in 60 ms.
FORMULA BridgeAndVehicles-COL-V50P20N20-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P20N20-LTLFireability-00 finished in 1624 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' '!(((!p0 U X(p1))&&((X(G(!p3))||p2) U X(p4))))'
Support contains 129 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 135 transition count 2347
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 2347
Applied a total of 2 rules in 17 ms. Remains 135 /136 variables (removed 1) and now considering 2347/2348 (removed 1) transitions.
[2023-03-12 07:16:17] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:16:17] [INFO ] Invariant cache hit.
[2023-03-12 07:16:18] [INFO ] Dead Transitions using invariants and state equation in 708 ms found 0 transitions.
[2023-03-12 07:16:18] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:16:18] [INFO ] Invariant cache hit.
[2023-03-12 07:16:18] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-12 07:16:18] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:16:18] [INFO ] Invariant cache hit.
[2023-03-12 07:16:18] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:16:18] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
[2023-03-12 07:16:18] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:16:18] [INFO ] Invariant cache hit.
[2023-03-12 07:16:19] [INFO ] Dead Transitions using invariants and state equation in 811 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 135/136 places, 2347/2348 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1957 ms. Remains : 135/136 places, 2347/2348 transitions.
Stuttering acceptance computed with spot in 275 ms :[(OR (NOT p1) (NOT p4)), (NOT p1), (NOT p1), (AND p3 (NOT p4)), (NOT p4), true, p3]
Running random walk in product with property : BridgeAndVehicles-COL-V50P20N20-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}, { cond=true, acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={} source=1 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p4) p3), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p4) (NOT p3)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p2) (NOT p4)), acceptance={0} source=4 dest: 3}, { cond=(NOT p4), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=p3, acceptance={} source=6 dest: 5}, { cond=(NOT p3), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s74 1) (GEQ s106 1) (GEQ s109 1)) (AND (GEQ s0 1) (GEQ s98 1) (GEQ s106 1) (GEQ s109 1)) (AND (GEQ s0 1) (GEQ s91 1) (GEQ s106...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-COL-V50P20N20-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P20N20-LTLFireability-03 finished in 2283 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(F((G(F(!p2))&&p1)))))'
Support contains 58 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 135 transition count 2347
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 2347
Applied a total of 2 rules in 54 ms. Remains 135 /136 variables (removed 1) and now considering 2347/2348 (removed 1) transitions.
[2023-03-12 07:16:19] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:16:19] [INFO ] Invariant cache hit.
[2023-03-12 07:16:20] [INFO ] Dead Transitions using invariants and state equation in 634 ms found 0 transitions.
[2023-03-12 07:16:20] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:16:20] [INFO ] Invariant cache hit.
[2023-03-12 07:16:20] [INFO ] Implicit Places using invariants in 230 ms returned []
[2023-03-12 07:16:20] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:16:20] [INFO ] Invariant cache hit.
[2023-03-12 07:16:20] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:16:21] [INFO ] Implicit Places using invariants and state equation in 694 ms returned [106]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 931 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 134/136 places, 2347/2348 transitions.
Applied a total of 0 rules in 14 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1636 ms. Remains : 134/136 places, 2347/2348 transitions.
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p1) (NOT p0) p2), (NOT p0), (OR (NOT p1) p2), p2, p2, (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P20N20-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=p2, acceptance={0} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (AND (GEQ s0 20) (GEQ s133 1)) (AND (GEQ s0 20) (GEQ s132 1))), p2:(OR (AND (GEQ s0 1) (GEQ s51 1) (GEQ s53 1) (GEQ s107 1)) (AND (GEQ s0 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1473 reset in 921 ms.
Product exploration explored 100000 steps with 1408 reset in 748 ms.
Computed a total of 107 stabilizing places and 203 stable transitions
Computed a total of 107 stabilizing places and 203 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X p1), (X (NOT p0)), true, (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 384 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) p2), (NOT p0), p2, p2]
Finished random walk after 163 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=54 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X p1), (X (NOT p0)), true, (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (F p0), (F p2)]
Knowledge based reduction with 7 factoid took 336 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) p2), (NOT p0), p2, p2]
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) p2), (NOT p0), p2, p2]
[2023-03-12 07:16:24] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 134 cols
[2023-03-12 07:16:24] [INFO ] Computed 5 place invariants in 7 ms
[2023-03-12 07:16:24] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 07:16:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 07:16:25] [INFO ] [Real]Absence check using state equation in 264 ms returned sat
[2023-03-12 07:16:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 07:16:25] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 07:16:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 07:16:25] [INFO ] [Nat]Absence check using state equation in 192 ms returned sat
[2023-03-12 07:16:25] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:16:25] [INFO ] [Nat]Added 42 Read/Feed constraints in 169 ms returned sat
[2023-03-12 07:16:26] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 287 ms.
[2023-03-12 07:16:26] [INFO ] Added : 21 causal constraints over 7 iterations in 508 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 55 out of 134 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 2347/2347 transitions.
Applied a total of 0 rules in 11 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-12 07:16:26] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:16:26] [INFO ] Invariant cache hit.
[2023-03-12 07:16:27] [INFO ] Dead Transitions using invariants and state equation in 770 ms found 0 transitions.
[2023-03-12 07:16:27] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:16:27] [INFO ] Invariant cache hit.
[2023-03-12 07:16:27] [INFO ] Implicit Places using invariants in 404 ms returned []
[2023-03-12 07:16:27] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:16:27] [INFO ] Invariant cache hit.
[2023-03-12 07:16:27] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:16:28] [INFO ] Implicit Places using invariants and state equation in 755 ms returned []
Implicit Place search using SMT with State Equation took 1178 ms to find 0 implicit places.
[2023-03-12 07:16:28] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:16:28] [INFO ] Invariant cache hit.
[2023-03-12 07:16:29] [INFO ] Dead Transitions using invariants and state equation in 630 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2617 ms. Remains : 134/134 places, 2347/2347 transitions.
Computed a total of 107 stabilizing places and 203 stable transitions
Computed a total of 107 stabilizing places and 203 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 5 factoid took 209 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) p2), (NOT p0), p2, p2]
Finished random walk after 151 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=50 )
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (F p0), (F p2)]
Knowledge based reduction with 5 factoid took 209 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) p2), (NOT p0), p2, p2]
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) p2), (NOT p0), p2, p2]
[2023-03-12 07:16:29] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:16:29] [INFO ] Invariant cache hit.
[2023-03-12 07:16:30] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 07:16:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 07:16:30] [INFO ] [Real]Absence check using state equation in 256 ms returned sat
[2023-03-12 07:16:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 07:16:30] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 07:16:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 07:16:30] [INFO ] [Nat]Absence check using state equation in 182 ms returned sat
[2023-03-12 07:16:30] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:16:31] [INFO ] [Nat]Added 42 Read/Feed constraints in 295 ms returned sat
[2023-03-12 07:16:31] [INFO ] Deduced a trap composed of 5 places in 265 ms of which 4 ms to minimize.
[2023-03-12 07:16:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 325 ms
[2023-03-12 07:16:31] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 241 ms.
[2023-03-12 07:16:31] [INFO ] Added : 15 causal constraints over 4 iterations in 394 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p0) p2), (NOT p0), p2, p2]
Product exploration explored 100000 steps with 1442 reset in 609 ms.
Product exploration explored 100000 steps with 1452 reset in 758 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p0) p2), (NOT p0), p2, p2]
Support contains 55 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 2347/2347 transitions.
Applied a total of 0 rules in 461 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-12 07:16:34] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:16:34] [INFO ] Invariant cache hit.
[2023-03-12 07:16:35] [INFO ] Dead Transitions using invariants and state equation in 1308 ms found 0 transitions.
[2023-03-12 07:16:35] [INFO ] Redundant transitions in 119 ms returned []
[2023-03-12 07:16:35] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:16:35] [INFO ] Invariant cache hit.
[2023-03-12 07:16:36] [INFO ] Dead Transitions using invariants and state equation in 846 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2748 ms. Remains : 134/134 places, 2347/2347 transitions.
Support contains 55 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 2347/2347 transitions.
Applied a total of 0 rules in 18 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-12 07:16:36] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:16:36] [INFO ] Invariant cache hit.
[2023-03-12 07:16:37] [INFO ] Dead Transitions using invariants and state equation in 688 ms found 0 transitions.
[2023-03-12 07:16:37] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:16:37] [INFO ] Invariant cache hit.
[2023-03-12 07:16:37] [INFO ] Implicit Places using invariants in 203 ms returned []
[2023-03-12 07:16:37] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:16:37] [INFO ] Invariant cache hit.
[2023-03-12 07:16:37] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:16:38] [INFO ] Implicit Places using invariants and state equation in 708 ms returned []
Implicit Place search using SMT with State Equation took 917 ms to find 0 implicit places.
[2023-03-12 07:16:38] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:16:38] [INFO ] Invariant cache hit.
[2023-03-12 07:16:38] [INFO ] Dead Transitions using invariants and state equation in 613 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2239 ms. Remains : 134/134 places, 2347/2347 transitions.
Treatment of property BridgeAndVehicles-COL-V50P20N20-LTLFireability-04 finished in 19548 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G((!p0||(!p1 U (p2||G(!p1)))))))))'
Support contains 75 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 135 transition count 2347
Applied a total of 2 rules in 475 ms. Remains 135 /136 variables (removed 1) and now considering 2347/2348 (removed 1) transitions.
[2023-03-12 07:16:39] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2023-03-12 07:16:39] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 07:16:40] [INFO ] Dead Transitions using invariants and state equation in 689 ms found 0 transitions.
[2023-03-12 07:16:40] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:16:40] [INFO ] Invariant cache hit.
[2023-03-12 07:16:40] [INFO ] Implicit Places using invariants in 184 ms returned []
[2023-03-12 07:16:40] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:16:40] [INFO ] Invariant cache hit.
[2023-03-12 07:16:40] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:16:41] [INFO ] Implicit Places using invariants and state equation in 503 ms returned [53, 106]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 696 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 133/136 places, 2347/2348 transitions.
Applied a total of 0 rules in 338 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2205 ms. Remains : 133/136 places, 2347/2348 transitions.
Stuttering acceptance computed with spot in 271 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P20N20-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(OR (NOT p0) p2 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s108 1) (GEQ s121 1)) (AND (GEQ s108 1) (GEQ s120 1)) (AND (GEQ s108 1) (GEQ s119 1)) (AND (GEQ s108 1) (GEQ s118 1)) (AND (GEQ s108 1) (...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 659 reset in 1077 ms.
Product exploration explored 100000 steps with 639 reset in 1412 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/133 stabilizing places and 203/2347 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (OR (NOT p0) p2 (NOT p1))), (X (NOT (OR (NOT p0) p2 (NOT p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (OR (NOT p0) p2 (NOT p1)))), (X (X (NOT (OR (NOT p0) p2 (NOT p1)))))]
Knowledge based reduction with 7 factoid took 622 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2))]
Finished random walk after 156 steps, including 0 resets, run visited all 6 properties in 6 ms. (steps per millisecond=26 )
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (OR (NOT p0) p2 (NOT p1))), (X (NOT (OR (NOT p0) p2 (NOT p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (OR (NOT p0) p2 (NOT p1)))), (X (X (NOT (OR (NOT p0) p2 (NOT p1))))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT p0)), (F (NOT (AND p0 p1 (NOT p2)))), (F (OR (NOT p0) (NOT p1) p2))]
Knowledge based reduction with 7 factoid took 673 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter insensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2))]
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2))]
[2023-03-12 07:16:46] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2023-03-12 07:16:46] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 07:16:47] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 07:16:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 07:16:47] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2023-03-12 07:16:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 07:16:48] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 07:16:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 07:16:48] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2023-03-12 07:16:48] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:16:48] [INFO ] [Nat]Added 42 Read/Feed constraints in 241 ms returned sat
[2023-03-12 07:16:49] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 101 ms.
[2023-03-12 07:16:49] [INFO ] Added : 21 causal constraints over 5 iterations in 269 ms. Result :sat
Could not prove EG (AND p1 (NOT p2))
Support contains 75 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 349 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-12 07:16:49] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:16:49] [INFO ] Invariant cache hit.
[2023-03-12 07:16:50] [INFO ] Dead Transitions using invariants and state equation in 824 ms found 0 transitions.
[2023-03-12 07:16:50] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:16:50] [INFO ] Invariant cache hit.
[2023-03-12 07:16:50] [INFO ] Implicit Places using invariants in 178 ms returned []
[2023-03-12 07:16:50] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:16:50] [INFO ] Invariant cache hit.
[2023-03-12 07:16:50] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:16:51] [INFO ] Implicit Places using invariants and state equation in 474 ms returned []
Implicit Place search using SMT with State Equation took 666 ms to find 0 implicit places.
[2023-03-12 07:16:51] [INFO ] Redundant transitions in 71 ms returned []
[2023-03-12 07:16:51] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:16:51] [INFO ] Invariant cache hit.
[2023-03-12 07:16:51] [INFO ] Dead Transitions using invariants and state equation in 822 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2746 ms. Remains : 133/133 places, 2347/2347 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/133 stabilizing places and 203/2347 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (OR (NOT p0) (NOT p1) p2)), (X (NOT (OR (NOT p0) (NOT p1) p2))), (X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT p0)), (X p0), (X (X (OR (NOT p0) (NOT p1) p2))), (X (X (NOT (OR (NOT p0) (NOT p1) p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
Knowledge based reduction with 6 factoid took 475 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter insensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
Finished random walk after 221 steps, including 0 resets, run visited all 6 properties in 6 ms. (steps per millisecond=36 )
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (OR (NOT p0) (NOT p1) p2)), (X (NOT (OR (NOT p0) (NOT p1) p2))), (X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT p0)), (X p0), (X (X (OR (NOT p0) (NOT p1) p2))), (X (X (NOT (OR (NOT p0) (NOT p1) p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (F (AND (NOT p0) (NOT p2) p1)), (F (AND p0 (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (NOT p0)), (F (NOT (AND p0 (NOT p2) p1))), (F (OR (NOT p0) p2 (NOT p1)))]
Knowledge based reduction with 6 factoid took 533 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter insensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
[2023-03-12 07:16:53] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:16:53] [INFO ] Invariant cache hit.
[2023-03-12 07:16:54] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 07:16:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 07:16:54] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2023-03-12 07:16:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 07:16:55] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 07:16:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 07:16:55] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2023-03-12 07:16:55] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:16:56] [INFO ] [Nat]Added 42 Read/Feed constraints in 984 ms returned sat
[2023-03-12 07:16:56] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 105 ms.
[2023-03-12 07:16:57] [INFO ] Added : 22 causal constraints over 6 iterations in 357 ms. Result :sat
Could not prove EG (AND p1 (NOT p2))
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
Product exploration explored 100000 steps with 643 reset in 1227 ms.
Product exploration explored 100000 steps with 644 reset in 1245 ms.
Support contains 75 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 329 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-12 07:17:00] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:17:00] [INFO ] Invariant cache hit.
[2023-03-12 07:17:00] [INFO ] Dead Transitions using invariants and state equation in 763 ms found 0 transitions.
[2023-03-12 07:17:00] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:17:00] [INFO ] Invariant cache hit.
[2023-03-12 07:17:01] [INFO ] Implicit Places using invariants in 219 ms returned []
[2023-03-12 07:17:01] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:17:01] [INFO ] Invariant cache hit.
[2023-03-12 07:17:01] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:17:01] [INFO ] Implicit Places using invariants and state equation in 520 ms returned []
Implicit Place search using SMT with State Equation took 742 ms to find 0 implicit places.
[2023-03-12 07:17:01] [INFO ] Redundant transitions in 195 ms returned []
[2023-03-12 07:17:01] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:17:01] [INFO ] Invariant cache hit.
[2023-03-12 07:17:02] [INFO ] Dead Transitions using invariants and state equation in 707 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2761 ms. Remains : 133/133 places, 2347/2347 transitions.
Treatment of property BridgeAndVehicles-COL-V50P20N20-LTLFireability-07 finished in 23491 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(G(!p0))||(X((!p2 U (!p3||G(!p2))))&&p1))))'
Support contains 76 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 25 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2023-03-12 07:17:02] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2023-03-12 07:17:02] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 07:17:03] [INFO ] Dead Transitions using invariants and state equation in 721 ms found 0 transitions.
[2023-03-12 07:17:03] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:17:03] [INFO ] Invariant cache hit.
[2023-03-12 07:17:03] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-03-12 07:17:03] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:17:03] [INFO ] Invariant cache hit.
[2023-03-12 07:17:03] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:17:04] [INFO ] Implicit Places using invariants and state equation in 592 ms returned [53, 107]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 727 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 134/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 21 ms. Remains 134 /134 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1496 ms. Remains : 134/136 places, 2348/2348 transitions.
Stuttering acceptance computed with spot in 240 ms :[true, false, false, p0, (AND p3 p2), (AND p0 p3 p2)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P20N20-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 5}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=(AND p3 p2), acceptance={} source=4 dest: 0}, { cond=(AND p3 (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=(AND p0 p3 p2), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) p3 p2), acceptance={} source=5 dest: 3}, { cond=(AND p0 p3 (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p3 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=1, aps=[p0:(LT s105 1), p1:(AND (OR (LT s1 1) (LT s91 1) (LT s107 1) (LT s116 1)) (OR (LT s1 1) (LT s103 1) (LT s107 1) (LT s117 1)) (OR (LT s1 1) (LT s79 1) (LT ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 890 ms.
Product exploration explored 100000 steps with 50000 reset in 856 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/134 stabilizing places and 204/2348 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND p0 p1 p3 (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p3 p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p3 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X (AND p0 p3 p2))), (X (X (NOT (AND p0 p3 p2)))), (X (X (AND p0 p3 (NOT p2)))), (X (X (NOT (AND p0 p3 (NOT p2)))))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 8 factoid took 243 ms. Reduced automaton from 6 states, 12 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-COL-V50P20N20-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-COL-V50P20N20-LTLFireability-08 finished in 3801 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(!p1))||p0)))'
Support contains 73 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 135 transition count 2347
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 2347
Applied a total of 2 rules in 15 ms. Remains 135 /136 variables (removed 1) and now considering 2347/2348 (removed 1) transitions.
[2023-03-12 07:17:06] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2023-03-12 07:17:06] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 07:17:07] [INFO ] Dead Transitions using invariants and state equation in 756 ms found 0 transitions.
[2023-03-12 07:17:07] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:17:07] [INFO ] Invariant cache hit.
[2023-03-12 07:17:07] [INFO ] Implicit Places using invariants in 144 ms returned []
[2023-03-12 07:17:07] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:17:07] [INFO ] Invariant cache hit.
[2023-03-12 07:17:07] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:17:08] [INFO ] Implicit Places using invariants and state equation in 641 ms returned [53, 106]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 816 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 133/136 places, 2347/2348 transitions.
Applied a total of 0 rules in 18 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1606 ms. Remains : 133/136 places, 2347/2348 transitions.
Stuttering acceptance computed with spot in 91 ms :[true, (AND (NOT p0) p1), p1]
Running random walk in product with property : BridgeAndVehicles-COL-V50P20N20-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s45 1) (GEQ s54 1) (GEQ s107 1) (GEQ s118 1)) (AND (GEQ s28 1) (GEQ s54 1) (GEQ s107 1) (GEQ s124 1)) (AND (GEQ s7 1) (GEQ s54 1) (GEQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 2863 steps with 6 reset in 230 ms.
FORMULA BridgeAndVehicles-COL-V50P20N20-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P20N20-LTLFireability-09 finished in 1960 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 52 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 135 transition count 2347
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 2347
Applied a total of 2 rules in 14 ms. Remains 135 /136 variables (removed 1) and now considering 2347/2348 (removed 1) transitions.
[2023-03-12 07:17:08] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:17:08] [INFO ] Invariant cache hit.
[2023-03-12 07:17:09] [INFO ] Dead Transitions using invariants and state equation in 754 ms found 0 transitions.
[2023-03-12 07:17:09] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:17:09] [INFO ] Invariant cache hit.
[2023-03-12 07:17:09] [INFO ] Implicit Places using invariants in 221 ms returned []
[2023-03-12 07:17:09] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:17:09] [INFO ] Invariant cache hit.
[2023-03-12 07:17:09] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:17:10] [INFO ] Implicit Places using invariants and state equation in 663 ms returned [53, 106]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 900 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 133/136 places, 2347/2348 transitions.
Applied a total of 0 rules in 9 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1681 ms. Remains : 133/136 places, 2347/2348 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P20N20-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s2 1) (GEQ s52 1)) (AND (GEQ s22 1) (GEQ s52 1)) (AND (GEQ s41 1) (GEQ s52 1)) (AND (GEQ s32 1) (GEQ s52 1)) (AND (GEQ s51 1) (GEQ s52 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 882 ms.
Product exploration explored 100000 steps with 50000 reset in 815 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/133 stabilizing places and 203/2347 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 : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 93 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-COL-V50P20N20-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-COL-V50P20N20-LTLFireability-10 finished in 3593 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))'
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 135 transition count 2347
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 2347
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 133 transition count 2346
Applied a total of 5 rules in 500 ms. Remains 133 /136 variables (removed 3) and now considering 2346/2348 (removed 2) transitions.
[2023-03-12 07:17:12] [INFO ] Flow matrix only has 288 transitions (discarded 2058 similar events)
// Phase 1: matrix 288 rows 133 cols
[2023-03-12 07:17:12] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-12 07:17:12] [INFO ] Implicit Places using invariants in 318 ms returned []
[2023-03-12 07:17:12] [INFO ] Flow matrix only has 288 transitions (discarded 2058 similar events)
[2023-03-12 07:17:12] [INFO ] Invariant cache hit.
[2023-03-12 07:17:13] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:17:13] [INFO ] Implicit Places using invariants and state equation in 914 ms returned [52, 104]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1236 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 131/136 places, 2346/2348 transitions.
Applied a total of 0 rules in 211 ms. Remains 131 /131 variables (removed 0) and now considering 2346/2346 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1949 ms. Remains : 131/136 places, 2346/2348 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P20N20-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s107 1) (GEQ s128 1)) (AND (GEQ s106 1) (GEQ s128 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 796 reset in 404 ms.
Product exploration explored 100000 steps with 796 reset in 391 ms.
Computed a total of 104 stabilizing places and 202 stable transitions
Computed a total of 104 stabilizing places and 202 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Finished random walk after 133 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=66 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 20 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
[2023-03-12 07:17:15] [INFO ] Flow matrix only has 288 transitions (discarded 2058 similar events)
// Phase 1: matrix 288 rows 131 cols
[2023-03-12 07:17:15] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-12 07:17:15] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 07:17:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 07:17:15] [INFO ] [Real]Absence check using state equation in 191 ms returned sat
[2023-03-12 07:17:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 07:17:16] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 07:17:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 07:17:16] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2023-03-12 07:17:16] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:17:16] [INFO ] [Nat]Added 42 Read/Feed constraints in 63 ms returned sat
[2023-03-12 07:17:17] [INFO ] Deduced a trap composed of 5 places in 274 ms of which 2 ms to minimize.
[2023-03-12 07:17:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 307 ms
[2023-03-12 07:17:17] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 165 transitions) in 65 ms.
[2023-03-12 07:17:17] [INFO ] Added : 22 causal constraints over 6 iterations in 174 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 2346/2346 transitions.
Applied a total of 0 rules in 186 ms. Remains 131 /131 variables (removed 0) and now considering 2346/2346 (removed 0) transitions.
[2023-03-12 07:17:17] [INFO ] Flow matrix only has 288 transitions (discarded 2058 similar events)
[2023-03-12 07:17:17] [INFO ] Invariant cache hit.
[2023-03-12 07:17:17] [INFO ] Implicit Places using invariants in 281 ms returned []
[2023-03-12 07:17:17] [INFO ] Flow matrix only has 288 transitions (discarded 2058 similar events)
[2023-03-12 07:17:17] [INFO ] Invariant cache hit.
[2023-03-12 07:17:17] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:17:18] [INFO ] Implicit Places using invariants and state equation in 735 ms returned []
Implicit Place search using SMT with State Equation took 1030 ms to find 0 implicit places.
[2023-03-12 07:17:18] [INFO ] Redundant transitions in 73 ms returned []
[2023-03-12 07:17:18] [INFO ] Flow matrix only has 288 transitions (discarded 2058 similar events)
[2023-03-12 07:17:18] [INFO ] Invariant cache hit.
[2023-03-12 07:17:19] [INFO ] Dead Transitions using invariants and state equation in 764 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2090 ms. Remains : 131/131 places, 2346/2346 transitions.
Computed a total of 104 stabilizing places and 202 stable transitions
Computed a total of 104 stabilizing places and 202 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Finished random walk after 123 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=61 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
[2023-03-12 07:17:19] [INFO ] Flow matrix only has 288 transitions (discarded 2058 similar events)
[2023-03-12 07:17:19] [INFO ] Invariant cache hit.
[2023-03-12 07:17:20] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 07:17:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 07:17:20] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2023-03-12 07:17:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 07:17:21] [INFO ] [Nat]Absence check using 4 positive place invariants in 19 ms returned sat
[2023-03-12 07:17:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 07:17:21] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2023-03-12 07:17:21] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:17:21] [INFO ] [Nat]Added 42 Read/Feed constraints in 60 ms returned sat
[2023-03-12 07:17:21] [INFO ] Deduced a trap composed of 5 places in 316 ms of which 1 ms to minimize.
[2023-03-12 07:17:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 352 ms
[2023-03-12 07:17:21] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 165 transitions) in 59 ms.
[2023-03-12 07:17:21] [INFO ] Added : 22 causal constraints over 6 iterations in 228 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Product exploration explored 100000 steps with 802 reset in 485 ms.
Product exploration explored 100000 steps with 795 reset in 427 ms.
Support contains 3 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 2346/2346 transitions.
Applied a total of 0 rules in 195 ms. Remains 131 /131 variables (removed 0) and now considering 2346/2346 (removed 0) transitions.
[2023-03-12 07:17:23] [INFO ] Flow matrix only has 288 transitions (discarded 2058 similar events)
[2023-03-12 07:17:23] [INFO ] Invariant cache hit.
[2023-03-12 07:17:23] [INFO ] Implicit Places using invariants in 261 ms returned []
[2023-03-12 07:17:23] [INFO ] Flow matrix only has 288 transitions (discarded 2058 similar events)
[2023-03-12 07:17:23] [INFO ] Invariant cache hit.
[2023-03-12 07:17:23] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:17:24] [INFO ] Implicit Places using invariants and state equation in 658 ms returned []
Implicit Place search using SMT with State Equation took 933 ms to find 0 implicit places.
[2023-03-12 07:17:24] [INFO ] Redundant transitions in 58 ms returned []
[2023-03-12 07:17:24] [INFO ] Flow matrix only has 288 transitions (discarded 2058 similar events)
[2023-03-12 07:17:24] [INFO ] Invariant cache hit.
[2023-03-12 07:17:24] [INFO ] Dead Transitions using invariants and state equation in 744 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1937 ms. Remains : 131/131 places, 2346/2346 transitions.
Treatment of property BridgeAndVehicles-COL-V50P20N20-LTLFireability-11 finished in 12983 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 53 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 135 transition count 2347
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 2347
Applied a total of 2 rules in 209 ms. Remains 135 /136 variables (removed 1) and now considering 2347/2348 (removed 1) transitions.
[2023-03-12 07:17:25] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2023-03-12 07:17:25] [INFO ] Computed 5 place invariants in 9 ms
[2023-03-12 07:17:25] [INFO ] Dead Transitions using invariants and state equation in 654 ms found 0 transitions.
[2023-03-12 07:17:25] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:17:25] [INFO ] Invariant cache hit.
[2023-03-12 07:17:26] [INFO ] Implicit Places using invariants in 199 ms returned []
[2023-03-12 07:17:26] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:17:26] [INFO ] Invariant cache hit.
[2023-03-12 07:17:26] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:17:26] [INFO ] Implicit Places using invariants and state equation in 716 ms returned [53]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 920 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 134/136 places, 2347/2348 transitions.
Applied a total of 0 rules in 243 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2029 ms. Remains : 134/136 places, 2347/2348 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P20N20-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s73 1) (GEQ s105 1) (GEQ s108 1)) (AND (GEQ s0 1) (GEQ s97 1) (GEQ s105 1) (GEQ s108 1)) (AND (GEQ s0 1) (GEQ s90 1) (GEQ s105...], 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 412 steps with 0 reset in 5 ms.
FORMULA BridgeAndVehicles-COL-V50P20N20-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P20N20-LTLFireability-12 finished in 2081 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((G(p1)||p0))))'
Support contains 53 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 8 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2023-03-12 07:17:27] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2023-03-12 07:17:27] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 07:17:27] [INFO ] Dead Transitions using invariants and state equation in 694 ms found 0 transitions.
[2023-03-12 07:17:27] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:17:27] [INFO ] Invariant cache hit.
[2023-03-12 07:17:28] [INFO ] Implicit Places using invariants in 207 ms returned []
[2023-03-12 07:17:28] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 07:17:28] [INFO ] Invariant cache hit.
[2023-03-12 07:17:28] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:17:28] [INFO ] Implicit Places using invariants and state equation in 730 ms returned [53, 107]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 942 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 134/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 8 ms. Remains 134 /134 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1666 ms. Remains : 134/136 places, 2348/2348 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-COL-V50P20N20-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(OR (GEQ s53 1) (AND (GEQ s2 1) (GEQ s52 1)) (AND (GEQ s22 1) (GEQ s52 1)) (AND (GEQ s41 1) (GEQ s52 1)) (AND (GEQ s32 1) (GEQ s52 1)) (AND (GEQ s51 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 891 ms.
Product exploration explored 100000 steps with 50000 reset in 915 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/134 stabilizing places and 204/2348 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 p0)
Knowledge based reduction with 7 factoid took 214 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-COL-V50P20N20-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-COL-V50P20N20-LTLFireability-14 finished in 3790 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(F((G(F(!p2))&&p1)))))'
Found a Shortening insensitive property : BridgeAndVehicles-COL-V50P20N20-LTLFireability-04
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p1) (NOT p0) p2), (NOT p0), (OR (NOT p1) p2), p2, p2, (NOT p1)]
Support contains 58 out of 136 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 135 transition count 2347
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 2347
Applied a total of 2 rules in 38 ms. Remains 135 /136 variables (removed 1) and now considering 2347/2348 (removed 1) transitions.
[2023-03-12 07:17:31] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2023-03-12 07:17:31] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 07:17:31] [INFO ] Dead Transitions using invariants and state equation in 659 ms found 0 transitions.
[2023-03-12 07:17:31] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:17:31] [INFO ] Invariant cache hit.
[2023-03-12 07:17:32] [INFO ] Implicit Places using invariants in 263 ms returned []
[2023-03-12 07:17:32] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:17:32] [INFO ] Invariant cache hit.
[2023-03-12 07:17:32] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:17:32] [INFO ] Implicit Places using invariants and state equation in 612 ms returned [106]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 880 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 134/136 places, 2347/2348 transitions.
Applied a total of 0 rules in 24 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1602 ms. Remains : 134/136 places, 2347/2348 transitions.
Running random walk in product with property : BridgeAndVehicles-COL-V50P20N20-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=p2, acceptance={0} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (AND (GEQ s0 20) (GEQ s133 1)) (AND (GEQ s0 20) (GEQ s132 1))), p2:(OR (AND (GEQ s0 1) (GEQ s51 1) (GEQ s53 1) (GEQ s107 1)) (AND (GEQ s0 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1359 reset in 596 ms.
Product exploration explored 100000 steps with 1406 reset in 684 ms.
Computed a total of 107 stabilizing places and 203 stable transitions
Computed a total of 107 stabilizing places and 203 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X p1), (X (NOT p0)), true, (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 386 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) p2), (NOT p0), p2, p2]
Finished random walk after 163 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=54 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X p1), (X (NOT p0)), true, (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (F p0), (F p2)]
Knowledge based reduction with 7 factoid took 303 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) p2), (NOT p0), p2, p2]
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) p2), (NOT p0), p2, p2]
[2023-03-12 07:17:35] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 134 cols
[2023-03-12 07:17:35] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 07:17:35] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 07:17:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 07:17:35] [INFO ] [Real]Absence check using state equation in 285 ms returned sat
[2023-03-12 07:17:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 07:17:36] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 07:17:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 07:17:36] [INFO ] [Nat]Absence check using state equation in 189 ms returned sat
[2023-03-12 07:17:36] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:17:36] [INFO ] [Nat]Added 42 Read/Feed constraints in 154 ms returned sat
[2023-03-12 07:17:36] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 63 ms.
[2023-03-12 07:17:36] [INFO ] Added : 21 causal constraints over 7 iterations in 330 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 55 out of 134 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 2347/2347 transitions.
Applied a total of 0 rules in 11 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-12 07:17:36] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:17:36] [INFO ] Invariant cache hit.
[2023-03-12 07:17:37] [INFO ] Dead Transitions using invariants and state equation in 666 ms found 0 transitions.
[2023-03-12 07:17:37] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:17:37] [INFO ] Invariant cache hit.
[2023-03-12 07:17:37] [INFO ] Implicit Places using invariants in 208 ms returned []
[2023-03-12 07:17:37] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:17:37] [INFO ] Invariant cache hit.
[2023-03-12 07:17:37] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:17:38] [INFO ] Implicit Places using invariants and state equation in 637 ms returned []
Implicit Place search using SMT with State Equation took 878 ms to find 0 implicit places.
[2023-03-12 07:17:38] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:17:38] [INFO ] Invariant cache hit.
[2023-03-12 07:17:39] [INFO ] Dead Transitions using invariants and state equation in 771 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2359 ms. Remains : 134/134 places, 2347/2347 transitions.
Computed a total of 107 stabilizing places and 203 stable transitions
Computed a total of 107 stabilizing places and 203 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 5 factoid took 174 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[(OR (NOT p0) p2), (NOT p0), p2, p2]
Finished random walk after 160 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=80 )
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (F p0), (F p2)]
Knowledge based reduction with 5 factoid took 185 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) p2), (NOT p0), p2, p2]
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) p2), (NOT p0), p2, p2]
[2023-03-12 07:17:40] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:17:40] [INFO ] Invariant cache hit.
[2023-03-12 07:17:40] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 07:17:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 07:17:40] [INFO ] [Real]Absence check using state equation in 252 ms returned sat
[2023-03-12 07:17:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 07:17:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 07:17:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 07:17:40] [INFO ] [Nat]Absence check using state equation in 174 ms returned sat
[2023-03-12 07:17:40] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:17:41] [INFO ] [Nat]Added 42 Read/Feed constraints in 201 ms returned sat
[2023-03-12 07:17:41] [INFO ] Deduced a trap composed of 5 places in 492 ms of which 2 ms to minimize.
[2023-03-12 07:17:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 560 ms
[2023-03-12 07:17:41] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 89 ms.
[2023-03-12 07:17:41] [INFO ] Added : 15 causal constraints over 4 iterations in 202 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) p2), (NOT p0), p2, p2]
Product exploration explored 100000 steps with 1412 reset in 650 ms.
Product exploration explored 100000 steps with 1419 reset in 623 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) p2), (NOT p0), p2, p2]
Support contains 55 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 2347/2347 transitions.
Applied a total of 0 rules in 253 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-12 07:17:43] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:17:43] [INFO ] Invariant cache hit.
[2023-03-12 07:17:44] [INFO ] Dead Transitions using invariants and state equation in 651 ms found 0 transitions.
[2023-03-12 07:17:44] [INFO ] Redundant transitions in 47 ms returned []
[2023-03-12 07:17:44] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:17:44] [INFO ] Invariant cache hit.
[2023-03-12 07:17:45] [INFO ] Dead Transitions using invariants and state equation in 669 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1651 ms. Remains : 134/134 places, 2347/2347 transitions.
Support contains 55 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 2347/2347 transitions.
Applied a total of 0 rules in 8 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-12 07:17:45] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:17:45] [INFO ] Invariant cache hit.
[2023-03-12 07:17:45] [INFO ] Dead Transitions using invariants and state equation in 671 ms found 0 transitions.
[2023-03-12 07:17:45] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:17:45] [INFO ] Invariant cache hit.
[2023-03-12 07:17:46] [INFO ] Implicit Places using invariants in 230 ms returned []
[2023-03-12 07:17:46] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:17:46] [INFO ] Invariant cache hit.
[2023-03-12 07:17:46] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 07:17:46] [INFO ] Implicit Places using invariants and state equation in 633 ms returned []
Implicit Place search using SMT with State Equation took 897 ms to find 0 implicit places.
[2023-03-12 07:17:46] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 07:17:46] [INFO ] Invariant cache hit.
[2023-03-12 07:17:47] [INFO ] Dead Transitions using invariants and state equation in 595 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2199 ms. Remains : 134/134 places, 2347/2347 transitions.
Treatment of property BridgeAndVehicles-COL-V50P20N20-LTLFireability-04 finished in 16687 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G((!p0||(!p1 U (p2||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))'
[2023-03-12 07:17:48] [INFO ] Flatten gal took : 146 ms
[2023-03-12 07:17:48] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 12 ms.
[2023-03-12 07:17:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 136 places, 2348 transitions and 18088 arcs took 13 ms.
Total runtime 99087 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2028/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2028/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 1190 seconds
MemTotal: 16393340 kB
MemFree: 14821096 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16082356 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2028/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : BridgeAndVehicles-COL-V50P20N20-LTLFireability-04
Could not compute solution for formula : BridgeAndVehicles-COL-V50P20N20-LTLFireability-07
Could not compute solution for formula : BridgeAndVehicles-COL-V50P20N20-LTLFireability-11

BK_STOP 1678606661094

--------------------
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-COL-V50P20N20-LTLFireability-04
ltl formula formula --ltl=/tmp/2028/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 136 places, 2348 transitions and 18088 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.370 real 0.080 user 0.050 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2028/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2028/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2028/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2028/ltl_0_
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
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:
*** 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:
*** 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:
*** 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
malloc_consolidate(): invalid chunk size
ltl formula name BridgeAndVehicles-COL-V50P20N20-LTLFireability-07
ltl formula formula --ltl=/tmp/2028/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 136 places, 2348 transitions and 18088 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2028/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2028/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.320 real 0.060 user 0.070 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2028/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2028/ltl_1_
Killing (15) : 2040 2041 2042 2043 2044
Killing (9) : 2040 2041 2042 2043 2044
ltl formula name BridgeAndVehicles-COL-V50P20N20-LTLFireability-11
ltl formula formula --ltl=/tmp/2028/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 136 places, 2348 transitions and 18088 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.550 real 0.100 user 0.070 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2028/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2028/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2028/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2028/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 1 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-COL-V50P20N20"
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-COL-V50P20N20, 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-167813694200076"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V50P20N20.tgz
mv BridgeAndVehicles-COL-V50P20N20 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 ;