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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 27M
-rw-r--r-- 1 mcc users 25K Feb 25 13:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 139K Feb 25 13:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.2M Feb 25 12:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 4.3M Feb 25 12:58 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 9.3K Feb 25 15:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K Feb 25 15:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 743K Feb 25 15:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 2.2M Feb 25 15:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 53K Feb 25 14:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 261K Feb 25 14:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3M Feb 25 14:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 8.5M Feb 25 14:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Feb 25 15:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 7.1M Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678621783516

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V80P20N50
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 11:49:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 11:49:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 11:49:45] [INFO ] Load time of PNML (sax parser for PT used): 325 ms
[2023-03-12 11:49:45] [INFO ] Transformed 228 places.
[2023-03-12 11:49:45] [INFO ] Transformed 8588 transitions.
[2023-03-12 11:49:45] [INFO ] Parsed PT model containing 228 places and 8588 transitions and 67470 arcs in 444 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
FORMULA BridgeAndVehicles-PT-V80P20N50-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P20N50-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P20N50-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P20N50-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P20N50-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P20N50-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P20N50-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 8588/8588 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 227 transition count 8588
Applied a total of 1 rules in 159 ms. Remains 227 /228 variables (removed 1) and now considering 8588/8588 (removed 0) transitions.
[2023-03-12 11:49:45] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
// Phase 1: matrix 530 rows 227 cols
[2023-03-12 11:49:45] [INFO ] Computed 6 place invariants in 26 ms
[2023-03-12 11:49:48] [INFO ] Dead Transitions using invariants and state equation in 2586 ms found 0 transitions.
[2023-03-12 11:49:48] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 11:49:48] [INFO ] Invariant cache hit.
[2023-03-12 11:49:49] [INFO ] Implicit Places using invariants in 949 ms returned []
[2023-03-12 11:49:49] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 11:49:49] [INFO ] Invariant cache hit.
[2023-03-12 11:49:49] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 11:49:52] [INFO ] Implicit Places using invariants and state equation in 3399 ms returned [168]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 4366 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 226/228 places, 8588/8588 transitions.
Applied a total of 0 rules in 169 ms. Remains 226 /226 variables (removed 0) and now considering 8588/8588 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7307 ms. Remains : 226/228 places, 8588/8588 transitions.
Support contains 15 out of 226 places after structural reductions.
[2023-03-12 11:49:53] [INFO ] Flatten gal took : 491 ms
[2023-03-12 11:49:54] [INFO ] Flatten gal took : 267 ms
[2023-03-12 11:49:55] [INFO ] Input system was already deterministic with 8588 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 666 ms. (steps per millisecond=15 ) properties (out of 15) seen :11
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 11:49:56] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
// Phase 1: matrix 530 rows 226 cols
[2023-03-12 11:49:56] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-12 11:49:56] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 11:49:56] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 11:49:56] [INFO ] After 274ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 2 atomic propositions for a total of 9 simplifications.
FORMULA BridgeAndVehicles-PT-V80P20N50-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 169 stabilizing places and 324 stable transitions
Graph (complete) has 10945 edges and 226 vertex of which 225 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.132 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(p1))))'
Support contains 7 out of 226 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 226/226 places, 8588/8588 transitions.
Graph (complete) has 10945 edges and 226 vertex of which 225 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.41 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 224 transition count 8587
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 224 transition count 8587
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 37 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 222 transition count 8586
Applied a total of 6 rules in 4119 ms. Remains 222 /226 variables (removed 4) and now considering 8586/8588 (removed 2) transitions.
[2023-03-12 11:50:00] [INFO ] Flow matrix only has 528 transitions (discarded 8058 similar events)
// Phase 1: matrix 528 rows 222 cols
[2023-03-12 11:50:00] [INFO ] Computed 4 place invariants in 6 ms
[2023-03-12 11:50:02] [INFO ] Implicit Places using invariants in 1080 ms returned []
[2023-03-12 11:50:02] [INFO ] Flow matrix only has 528 transitions (discarded 8058 similar events)
[2023-03-12 11:50:02] [INFO ] Invariant cache hit.
[2023-03-12 11:50:02] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 11:50:05] [INFO ] Implicit Places using invariants and state equation in 3285 ms returned []
Implicit Place search using SMT with State Equation took 4366 ms to find 0 implicit places.
[2023-03-12 11:50:06] [INFO ] Redundant transitions in 1218 ms returned []
[2023-03-12 11:50:06] [INFO ] Flow matrix only has 528 transitions (discarded 8058 similar events)
[2023-03-12 11:50:06] [INFO ] Invariant cache hit.
[2023-03-12 11:50:08] [INFO ] Dead Transitions using invariants and state equation in 2443 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 222/226 places, 8586/8588 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12159 ms. Remains : 222/226 places, 8586/8588 transitions.
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N50-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 1 (ADD s168 s169)), p1:(AND (LEQ s0 s170) (LEQ (ADD s166 s167) s82))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 834 reset in 1631 ms.
Product exploration explored 100000 steps with 830 reset in 1466 ms.
Computed a total of 165 stabilizing places and 322 stable transitions
Computed a total of 165 stabilizing places and 322 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 169 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 261 steps, including 0 resets, run visited all 2 properties in 6 ms. (steps per millisecond=43 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p0), (F p1)]
Knowledge based reduction with 3 factoid took 215 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 80 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-12 11:50:13] [INFO ] Flow matrix only has 528 transitions (discarded 8058 similar events)
[2023-03-12 11:50:13] [INFO ] Invariant cache hit.
[2023-03-12 11:50:13] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-12 11:50:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 11:50:14] [INFO ] [Real]Absence check using state equation in 1076 ms returned sat
[2023-03-12 11:50:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 11:50:15] [INFO ] [Nat]Absence check using 4 positive place invariants in 11 ms returned sat
[2023-03-12 11:50:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 11:50:16] [INFO ] [Nat]Absence check using state equation in 816 ms returned sat
[2023-03-12 11:50:16] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 11:50:19] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-12 11:50:22] [INFO ] [Nat]Added 102 Read/Feed constraints in 6068 ms returned unknown
Could not prove EG (NOT p0)
[2023-03-12 11:50:22] [INFO ] Flow matrix only has 528 transitions (discarded 8058 similar events)
[2023-03-12 11:50:22] [INFO ] Invariant cache hit.
[2023-03-12 11:50:25] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-12 11:50:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 11:50:25] [INFO ] [Real]Absence check using state equation in 605 ms returned sat
[2023-03-12 11:50:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 11:50:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-12 11:50:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 11:50:28] [INFO ] [Nat]Absence check using state equation in 372 ms returned sat
[2023-03-12 11:50:28] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 11:50:30] [INFO ] [Nat]Added 102 Read/Feed constraints in 1112 ms returned sat
[2023-03-12 11:50:30] [INFO ] Computed and/alt/rep : 210/418/210 causal constraints (skipped 315 transitions) in 420 ms.
[2023-03-12 11:50:31] [INFO ] Added : 52 causal constraints over 13 iterations in 1087 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 7 out of 222 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 222/222 places, 8586/8586 transitions.
Applied a total of 0 rules in 3552 ms. Remains 222 /222 variables (removed 0) and now considering 8586/8586 (removed 0) transitions.
[2023-03-12 11:50:34] [INFO ] Flow matrix only has 528 transitions (discarded 8058 similar events)
[2023-03-12 11:50:34] [INFO ] Invariant cache hit.
[2023-03-12 11:50:35] [INFO ] Implicit Places using invariants in 1167 ms returned []
[2023-03-12 11:50:35] [INFO ] Flow matrix only has 528 transitions (discarded 8058 similar events)
[2023-03-12 11:50:35] [INFO ] Invariant cache hit.
[2023-03-12 11:50:36] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 11:50:40] [INFO ] Implicit Places using invariants and state equation in 4307 ms returned []
Implicit Place search using SMT with State Equation took 5482 ms to find 0 implicit places.
[2023-03-12 11:50:41] [INFO ] Redundant transitions in 1094 ms returned []
[2023-03-12 11:50:41] [INFO ] Flow matrix only has 528 transitions (discarded 8058 similar events)
[2023-03-12 11:50:41] [INFO ] Invariant cache hit.
[2023-03-12 11:50:43] [INFO ] Dead Transitions using invariants and state equation in 2328 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12468 ms. Remains : 222/222 places, 8586/8586 transitions.
Computed a total of 165 stabilizing places and 322 stable transitions
Computed a total of 165 stabilizing places and 322 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 170 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 4 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p0), (F p1)]
Knowledge based reduction with 3 factoid took 226 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 86 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-12 11:50:44] [INFO ] Flow matrix only has 528 transitions (discarded 8058 similar events)
[2023-03-12 11:50:44] [INFO ] Invariant cache hit.
[2023-03-12 11:50:45] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-12 11:50:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 11:50:46] [INFO ] [Real]Absence check using state equation in 1079 ms returned sat
[2023-03-12 11:50:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 11:50:46] [INFO ] [Nat]Absence check using 4 positive place invariants in 8 ms returned sat
[2023-03-12 11:50:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 11:50:47] [INFO ] [Nat]Absence check using state equation in 850 ms returned sat
[2023-03-12 11:50:47] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 11:50:50] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-12 11:50:53] [INFO ] [Nat]Added 102 Read/Feed constraints in 6069 ms returned unknown
Could not prove EG (NOT p0)
[2023-03-12 11:50:53] [INFO ] Flow matrix only has 528 transitions (discarded 8058 similar events)
[2023-03-12 11:50:53] [INFO ] Invariant cache hit.
[2023-03-12 11:50:56] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-12 11:50:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 11:50:57] [INFO ] [Real]Absence check using state equation in 628 ms returned sat
[2023-03-12 11:50:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 11:50:59] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-12 11:50:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 11:50:59] [INFO ] [Nat]Absence check using state equation in 346 ms returned sat
[2023-03-12 11:50:59] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 11:51:01] [INFO ] [Nat]Added 102 Read/Feed constraints in 1147 ms returned sat
[2023-03-12 11:51:01] [INFO ] Computed and/alt/rep : 210/418/210 causal constraints (skipped 315 transitions) in 348 ms.
[2023-03-12 11:51:02] [INFO ] Added : 52 causal constraints over 13 iterations in 947 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 792 reset in 1397 ms.
Product exploration explored 100000 steps with 817 reset in 1414 ms.
Support contains 7 out of 222 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 222/222 places, 8586/8586 transitions.
Applied a total of 0 rules in 3455 ms. Remains 222 /222 variables (removed 0) and now considering 8586/8586 (removed 0) transitions.
[2023-03-12 11:51:08] [INFO ] Flow matrix only has 528 transitions (discarded 8058 similar events)
[2023-03-12 11:51:08] [INFO ] Invariant cache hit.
[2023-03-12 11:51:09] [INFO ] Implicit Places using invariants in 1058 ms returned []
[2023-03-12 11:51:09] [INFO ] Flow matrix only has 528 transitions (discarded 8058 similar events)
[2023-03-12 11:51:09] [INFO ] Invariant cache hit.
[2023-03-12 11:51:09] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 11:51:14] [INFO ] Implicit Places using invariants and state equation in 4762 ms returned []
Implicit Place search using SMT with State Equation took 5822 ms to find 0 implicit places.
[2023-03-12 11:51:15] [INFO ] Redundant transitions in 1261 ms returned []
[2023-03-12 11:51:15] [INFO ] Flow matrix only has 528 transitions (discarded 8058 similar events)
[2023-03-12 11:51:15] [INFO ] Invariant cache hit.
[2023-03-12 11:51:17] [INFO ] Dead Transitions using invariants and state equation in 2265 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12810 ms. Remains : 222/222 places, 8586/8586 transitions.
Treatment of property BridgeAndVehicles-PT-V80P20N50-LTLCardinality-00 finished in 81928 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(((F(p0)||X(p1)) U (G((F(p0)||X(p1)))||((F(p0)||X(p1))&&G(!p2)))))))'
Support contains 4 out of 226 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 226/226 places, 8588/8588 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 225 transition count 8588
Applied a total of 1 rules in 55 ms. Remains 225 /226 variables (removed 1) and now considering 8588/8588 (removed 0) transitions.
[2023-03-12 11:51:18] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
// Phase 1: matrix 530 rows 225 cols
[2023-03-12 11:51:18] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 11:51:20] [INFO ] Dead Transitions using invariants and state equation in 2178 ms found 0 transitions.
[2023-03-12 11:51:20] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 11:51:20] [INFO ] Invariant cache hit.
[2023-03-12 11:51:21] [INFO ] Implicit Places using invariants in 774 ms returned []
[2023-03-12 11:51:21] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 11:51:21] [INFO ] Invariant cache hit.
[2023-03-12 11:51:23] [INFO ] Implicit Places using invariants and state equation in 1604 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2388 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 224/226 places, 8588/8588 transitions.
Applied a total of 0 rules in 67 ms. Remains 224 /224 variables (removed 0) and now considering 8588/8588 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4689 ms. Remains : 224/226 places, 8588/8588 transitions.
Stuttering acceptance computed with spot in 252 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND p2 (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), false]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N50-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p2, acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 6}], [{ cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={1} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 6}], [{ cond=(AND p2 (NOT p0)), acceptance={0, 1} source=5 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={1} source=5 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 5}, { cond=(AND p2 (NOT p0)), acceptance={0} source=5 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={0, 1} source=6 dest: 3}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=6 dest: 5}, { cond=(AND p2 (NOT p0) p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p2:(OR (LEQ s82 (ADD s84 s85)) (LEQ 1 s172)), p0:(LEQ s82 (ADD s84 s85)), p1:(GT 1 s172)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1558 reset in 1483 ms.
Product exploration explored 100000 steps with 1441 reset in 1500 ms.
Computed a total of 167 stabilizing places and 324 stable transitions
Computed a total of 167 stabilizing places and 324 stable transitions
Detected a total of 167/224 stabilizing places and 324/8588 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 529 ms. Reduced automaton from 7 states, 22 edges and 3 AP (stutter sensitive) to 7 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND p2 (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), false]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 326 ms. (steps per millisecond=30 ) properties (out of 10) seen :8
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 11:51:28] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
// Phase 1: matrix 530 rows 224 cols
[2023-03-12 11:51:28] [INFO ] Computed 5 place invariants in 7 ms
[2023-03-12 11:51:28] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (G (NOT (AND p2 p1 (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (AND (NOT p2) (NOT p0))), (F (AND p2 (NOT p1) (NOT p0))), (F (NOT p2)), (F (AND p2 (NOT p0))), (F (NOT p0)), (F (AND (NOT p2) p1 (NOT p0))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 13 factoid took 655 ms. Reduced automaton from 7 states, 22 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Support contains 4 out of 224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 8588/8588 transitions.
Applied a total of 0 rules in 50 ms. Remains 224 /224 variables (removed 0) and now considering 8588/8588 (removed 0) transitions.
[2023-03-12 11:51:29] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 11:51:29] [INFO ] Invariant cache hit.
[2023-03-12 11:51:31] [INFO ] Dead Transitions using invariants and state equation in 2272 ms found 0 transitions.
[2023-03-12 11:51:31] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 11:51:31] [INFO ] Invariant cache hit.
[2023-03-12 11:51:32] [INFO ] Implicit Places using invariants in 714 ms returned []
[2023-03-12 11:51:32] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 11:51:32] [INFO ] Invariant cache hit.
[2023-03-12 11:51:32] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 11:51:34] [INFO ] Implicit Places using invariants and state equation in 2523 ms returned []
Implicit Place search using SMT with State Equation took 3253 ms to find 0 implicit places.
[2023-03-12 11:51:34] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 11:51:34] [INFO ] Invariant cache hit.
[2023-03-12 11:51:37] [INFO ] Dead Transitions using invariants and state equation in 2196 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7775 ms. Remains : 224/224 places, 8588/8588 transitions.
Computed a total of 167 stabilizing places and 324 stable transitions
Computed a total of 167 stabilizing places and 324 stable transitions
Detected a total of 167/224 stabilizing places and 324/8588 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 225 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 7 states, 17 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false, false]
Incomplete random walk after 10001 steps, including 14 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 11:51:37] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 11:51:37] [INFO ] Invariant cache hit.
[2023-03-12 11:51:38] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) p1 p2)))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 7 factoid took 341 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter insensitive) to 6 states, 13 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Product exploration explored 100000 steps with 855 reset in 1650 ms.
Product exploration explored 100000 steps with 870 reset in 1677 ms.
Support contains 4 out of 224 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 224/224 places, 8588/8588 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 17 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 223 transition count 8587
Applied a total of 2 rules in 3317 ms. Remains 223 /224 variables (removed 1) and now considering 8587/8588 (removed 1) transitions.
[2023-03-12 11:51:45] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 223 cols
[2023-03-12 11:51:45] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 11:51:47] [INFO ] Dead Transitions using invariants and state equation in 2354 ms found 0 transitions.
[2023-03-12 11:51:47] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 11:51:47] [INFO ] Invariant cache hit.
[2023-03-12 11:51:48] [INFO ] Implicit Places using invariants in 738 ms returned []
[2023-03-12 11:51:48] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 11:51:48] [INFO ] Invariant cache hit.
[2023-03-12 11:51:49] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 11:51:52] [INFO ] Implicit Places using invariants and state equation in 3629 ms returned []
Implicit Place search using SMT with State Equation took 4367 ms to find 0 implicit places.
[2023-03-12 11:51:53] [INFO ] Redundant transitions in 860 ms returned []
[2023-03-12 11:51:53] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 11:51:53] [INFO ] Invariant cache hit.
[2023-03-12 11:51:55] [INFO ] Dead Transitions using invariants and state equation in 2297 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 223/224 places, 8587/8588 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13203 ms. Remains : 223/224 places, 8587/8588 transitions.
Treatment of property BridgeAndVehicles-PT-V80P20N50-LTLCardinality-01 finished in 37094 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((p0||X(p1))))'
Support contains 3 out of 226 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 226/226 places, 8588/8588 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 225 transition count 8588
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 224 transition count 8587
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 224 transition count 8587
Applied a total of 3 rules in 94 ms. Remains 224 /226 variables (removed 2) and now considering 8587/8588 (removed 1) transitions.
[2023-03-12 11:51:55] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 224 cols
[2023-03-12 11:51:55] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 11:51:58] [INFO ] Dead Transitions using invariants and state equation in 2250 ms found 0 transitions.
[2023-03-12 11:51:58] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 11:51:58] [INFO ] Invariant cache hit.
[2023-03-12 11:51:58] [INFO ] Implicit Places using invariants in 762 ms returned []
[2023-03-12 11:51:58] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 11:51:58] [INFO ] Invariant cache hit.
[2023-03-12 11:51:59] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 11:52:02] [INFO ] Implicit Places using invariants and state equation in 3369 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 4142 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 223/226 places, 8587/8588 transitions.
Applied a total of 0 rules in 79 ms. Remains 223 /223 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6569 ms. Remains : 223/226 places, 8587/8588 transitions.
Stuttering acceptance computed with spot in 96 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N50-LTLCardinality-03 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=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT 1 (ADD s84 s85)), p1:(LEQ s171 (ADD s84 s85))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V80P20N50-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P20N50-LTLCardinality-03 finished in 6716 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 226 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 226/226 places, 8588/8588 transitions.
Graph (complete) has 10945 edges and 226 vertex of which 225 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.12 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 224 transition count 8587
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 224 transition count 8587
Applied a total of 3 rules in 2497 ms. Remains 224 /226 variables (removed 2) and now considering 8587/8588 (removed 1) transitions.
[2023-03-12 11:52:05] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 11:52:05] [INFO ] Invariant cache hit.
[2023-03-12 11:52:07] [INFO ] Dead Transitions using invariants and state equation in 2295 ms found 0 transitions.
[2023-03-12 11:52:07] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 11:52:07] [INFO ] Invariant cache hit.
[2023-03-12 11:52:08] [INFO ] Implicit Places using invariants in 1008 ms returned []
[2023-03-12 11:52:08] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 11:52:08] [INFO ] Invariant cache hit.
[2023-03-12 11:52:08] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 11:52:12] [INFO ] Implicit Places using invariants and state equation in 4543 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 5562 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 223/226 places, 8587/8588 transitions.
Applied a total of 0 rules in 2367 ms. Remains 223 /223 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 12722 ms. Remains : 223/226 places, 8587/8588 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N50-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 2 s83)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 648 steps with 0 reset in 26 ms.
FORMULA BridgeAndVehicles-PT-V80P20N50-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P20N50-LTLCardinality-07 finished in 12885 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 226 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 226/226 places, 8588/8588 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 225 transition count 8588
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 224 transition count 8587
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 224 transition count 8587
Applied a total of 3 rules in 148 ms. Remains 224 /226 variables (removed 2) and now considering 8587/8588 (removed 1) transitions.
[2023-03-12 11:52:15] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 11:52:15] [INFO ] Invariant cache hit.
[2023-03-12 11:52:17] [INFO ] Dead Transitions using invariants and state equation in 2414 ms found 0 transitions.
[2023-03-12 11:52:17] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 11:52:17] [INFO ] Invariant cache hit.
[2023-03-12 11:52:18] [INFO ] Implicit Places using invariants in 808 ms returned []
[2023-03-12 11:52:18] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 11:52:18] [INFO ] Invariant cache hit.
[2023-03-12 11:52:18] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 11:52:22] [INFO ] Implicit Places using invariants and state equation in 3692 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 4511 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 223/226 places, 8587/8588 transitions.
Applied a total of 0 rules in 81 ms. Remains 223 /223 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7167 ms. Remains : 223/226 places, 8587/8588 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N50-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ s83 s85)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 648 steps with 0 reset in 15 ms.
FORMULA BridgeAndVehicles-PT-V80P20N50-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P20N50-LTLCardinality-08 finished in 7352 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 226 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 226/226 places, 8588/8588 transitions.
Graph (complete) has 10945 edges and 226 vertex of which 225 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 224 transition count 8587
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 224 transition count 8587
Applied a total of 3 rules in 2708 ms. Remains 224 /226 variables (removed 2) and now considering 8587/8588 (removed 1) transitions.
[2023-03-12 11:52:25] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 11:52:25] [INFO ] Invariant cache hit.
[2023-03-12 11:52:27] [INFO ] Dead Transitions using invariants and state equation in 2130 ms found 0 transitions.
[2023-03-12 11:52:27] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 11:52:27] [INFO ] Invariant cache hit.
[2023-03-12 11:52:28] [INFO ] Implicit Places using invariants in 948 ms returned []
[2023-03-12 11:52:28] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 11:52:28] [INFO ] Invariant cache hit.
[2023-03-12 11:52:28] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 11:52:32] [INFO ] Implicit Places using invariants and state equation in 4443 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 5400 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 223/226 places, 8587/8588 transitions.
Applied a total of 0 rules in 2356 ms. Remains 223 /223 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 12596 ms. Remains : 223/226 places, 8587/8588 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N50-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s83 s0)], 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 648 steps with 0 reset in 23 ms.
FORMULA BridgeAndVehicles-PT-V80P20N50-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P20N50-LTLCardinality-11 finished in 12708 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(p0) U (p1||F(p2))))'
Support contains 6 out of 226 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 226/226 places, 8588/8588 transitions.
Applied a total of 0 rules in 2554 ms. Remains 226 /226 variables (removed 0) and now considering 8588/8588 (removed 0) transitions.
[2023-03-12 11:52:38] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
// Phase 1: matrix 530 rows 226 cols
[2023-03-12 11:52:38] [INFO ] Computed 5 place invariants in 7 ms
[2023-03-12 11:52:40] [INFO ] Dead Transitions using invariants and state equation in 2156 ms found 0 transitions.
[2023-03-12 11:52:40] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 11:52:40] [INFO ] Invariant cache hit.
[2023-03-12 11:52:41] [INFO ] Implicit Places using invariants in 957 ms returned []
[2023-03-12 11:52:41] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 11:52:41] [INFO ] Invariant cache hit.
[2023-03-12 11:52:41] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 11:52:45] [INFO ] Implicit Places using invariants and state equation in 4531 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 5498 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 225/226 places, 8588/8588 transitions.
Applied a total of 0 rules in 2534 ms. Remains 225 /225 variables (removed 0) and now considering 8588/8588 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 12744 ms. Remains : 225/226 places, 8588/8588 transitions.
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N50-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s83 s172), p2:(GT s110 s173), p0:(LEQ s0 s224)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 181 reset in 1629 ms.
Product exploration explored 100000 steps with 181 reset in 1641 ms.
Computed a total of 168 stabilizing places and 324 stable transitions
Graph (complete) has 10781 edges and 225 vertex of which 224 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.37 ms
Computed a total of 168 stabilizing places and 324 stable transitions
Detected a total of 168/225 stabilizing places and 324/8588 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p2) p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT p2)), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 398 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p2), (NOT p2)]
Finished random walk after 603 steps, including 0 resets, run visited all 1 properties in 16 ms. (steps per millisecond=37 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p2) p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT p2)), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 13 factoid took 415 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p2)]
[2023-03-12 11:52:52] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
// Phase 1: matrix 530 rows 225 cols
[2023-03-12 11:52:52] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 11:52:55] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 11:52:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 11:52:56] [INFO ] [Real]Absence check using state equation in 1180 ms returned sat
[2023-03-12 11:52:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 11:52:59] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 11:52:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 11:53:00] [INFO ] [Nat]Absence check using state equation in 443 ms returned sat
[2023-03-12 11:53:00] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 11:53:03] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-12 11:53:03] [INFO ] [Nat]Added 102 Read/Feed constraints in 3395 ms returned sat
[2023-03-12 11:53:03] [INFO ] Computed and/alt/rep : 210/418/210 causal constraints (skipped 317 transitions) in 320 ms.
[2023-03-12 11:53:04] [INFO ] Added : 35 causal constraints over 7 iterations in 657 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 2 out of 225 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 225/225 places, 8588/8588 transitions.
Applied a total of 0 rules in 2533 ms. Remains 225 /225 variables (removed 0) and now considering 8588/8588 (removed 0) transitions.
[2023-03-12 11:53:06] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 11:53:06] [INFO ] Invariant cache hit.
[2023-03-12 11:53:09] [INFO ] Dead Transitions using invariants and state equation in 2322 ms found 0 transitions.
[2023-03-12 11:53:09] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 11:53:09] [INFO ] Invariant cache hit.
[2023-03-12 11:53:10] [INFO ] Implicit Places using invariants in 1005 ms returned []
[2023-03-12 11:53:10] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 11:53:10] [INFO ] Invariant cache hit.
[2023-03-12 11:53:10] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 11:53:14] [INFO ] Implicit Places using invariants and state equation in 4753 ms returned []
Implicit Place search using SMT with State Equation took 5760 ms to find 0 implicit places.
[2023-03-12 11:53:15] [INFO ] Redundant transitions in 931 ms returned []
[2023-03-12 11:53:15] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 11:53:15] [INFO ] Invariant cache hit.
[2023-03-12 11:53:18] [INFO ] Dead Transitions using invariants and state equation in 2238 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13791 ms. Remains : 225/225 places, 8588/8588 transitions.
Computed a total of 168 stabilizing places and 324 stable transitions
Graph (complete) has 10781 edges and 225 vertex of which 224 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.34 ms
Computed a total of 168 stabilizing places and 324 stable transitions
Detected a total of 168/225 stabilizing places and 324/8588 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 120 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 31 ms :[(NOT p2)]
Finished random walk after 498 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=45 )
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 4 factoid took 135 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 28 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p2)]
[2023-03-12 11:53:18] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 11:53:18] [INFO ] Invariant cache hit.
[2023-03-12 11:53:21] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 11:53:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 11:53:22] [INFO ] [Real]Absence check using state equation in 1154 ms returned sat
[2023-03-12 11:53:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 11:53:25] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 11:53:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 11:53:25] [INFO ] [Nat]Absence check using state equation in 471 ms returned sat
[2023-03-12 11:53:25] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 11:53:28] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-12 11:53:31] [INFO ] [Nat]Added 102 Read/Feed constraints in 6066 ms returned unknown
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 30 ms :[(NOT p2)]
Product exploration explored 100000 steps with 181 reset in 1704 ms.
Product exploration explored 100000 steps with 182 reset in 1673 ms.
Support contains 2 out of 225 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 225/225 places, 8588/8588 transitions.
Graph (complete) has 10781 edges and 225 vertex of which 224 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 223 transition count 8587
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 223 transition count 8587
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 17 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 221 transition count 8586
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 17 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 219 transition count 8584
Applied a total of 10 rules in 2669 ms. Remains 219 /225 variables (removed 6) and now considering 8584/8588 (removed 4) transitions.
[2023-03-12 11:53:37] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
// Phase 1: matrix 526 rows 219 cols
[2023-03-12 11:53:37] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-12 11:53:38] [INFO ] Implicit Places using invariants in 1064 ms returned []
[2023-03-12 11:53:38] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
[2023-03-12 11:53:38] [INFO ] Invariant cache hit.
[2023-03-12 11:53:40] [INFO ] Implicit Places using invariants and state equation in 1371 ms returned []
Implicit Place search using SMT with State Equation took 2437 ms to find 0 implicit places.
[2023-03-12 11:53:41] [INFO ] Redundant transitions in 804 ms returned []
[2023-03-12 11:53:41] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
[2023-03-12 11:53:41] [INFO ] Invariant cache hit.
[2023-03-12 11:53:43] [INFO ] Dead Transitions using invariants and state equation in 2383 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 219/225 places, 8584/8588 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8300 ms. Remains : 219/225 places, 8584/8588 transitions.
Treatment of property BridgeAndVehicles-PT-V80P20N50-LTLCardinality-12 finished in 68326 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 226 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 226/226 places, 8588/8588 transitions.
Graph (complete) has 10945 edges and 226 vertex of which 225 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.16 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 224 transition count 8587
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 224 transition count 8587
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 20 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 222 transition count 8586
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 20 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 220 transition count 8584
Applied a total of 10 rules in 2689 ms. Remains 220 /226 variables (removed 6) and now considering 8584/8588 (removed 4) transitions.
[2023-03-12 11:53:46] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
// Phase 1: matrix 526 rows 220 cols
[2023-03-12 11:53:46] [INFO ] Computed 4 place invariants in 7 ms
[2023-03-12 11:53:47] [INFO ] Implicit Places using invariants in 978 ms returned []
[2023-03-12 11:53:47] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
[2023-03-12 11:53:47] [INFO ] Invariant cache hit.
[2023-03-12 11:53:47] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 11:53:52] [INFO ] Implicit Places using invariants and state equation in 5024 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 6014 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 219/226 places, 8584/8588 transitions.
Applied a total of 0 rules in 2320 ms. Remains 219 /219 variables (removed 0) and now considering 8584/8584 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11026 ms. Remains : 219/226 places, 8584/8588 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N50-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 s167)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 205 reset in 2235 ms.
Product exploration explored 100000 steps with 205 reset in 2019 ms.
Computed a total of 164 stabilizing places and 322 stable transitions
Computed a total of 164 stabilizing places and 322 stable transitions
Detected a total of 164/219 stabilizing places and 322/8584 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 142 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Finished random walk after 253 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=50 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 118 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
[2023-03-12 11:53:59] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
// Phase 1: matrix 526 rows 219 cols
[2023-03-12 11:53:59] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-12 11:54:02] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 11:54:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 11:54:02] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2023-03-12 11:54:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 11:54:04] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-12 11:54:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 11:54:05] [INFO ] [Nat]Absence check using state equation in 244 ms returned sat
[2023-03-12 11:54:05] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 11:54:08] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-12 11:54:09] [INFO ] [Nat]Added 102 Read/Feed constraints in 4069 ms returned sat
[2023-03-12 11:54:09] [INFO ] Computed and/alt/rep : 210/418/210 causal constraints (skipped 313 transitions) in 279 ms.
[2023-03-12 11:54:10] [INFO ] Added : 52 causal constraints over 11 iterations in 963 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 219 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 219/219 places, 8584/8584 transitions.
Applied a total of 0 rules in 2407 ms. Remains 219 /219 variables (removed 0) and now considering 8584/8584 (removed 0) transitions.
[2023-03-12 11:54:12] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
[2023-03-12 11:54:12] [INFO ] Invariant cache hit.
[2023-03-12 11:54:13] [INFO ] Implicit Places using invariants in 1146 ms returned []
[2023-03-12 11:54:13] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
[2023-03-12 11:54:13] [INFO ] Invariant cache hit.
[2023-03-12 11:54:15] [INFO ] Implicit Places using invariants and state equation in 1628 ms returned []
Implicit Place search using SMT with State Equation took 2777 ms to find 0 implicit places.
[2023-03-12 11:54:16] [INFO ] Redundant transitions in 823 ms returned []
[2023-03-12 11:54:16] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
[2023-03-12 11:54:16] [INFO ] Invariant cache hit.
[2023-03-12 11:54:18] [INFO ] Dead Transitions using invariants and state equation in 2295 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8315 ms. Remains : 219/219 places, 8584/8584 transitions.
Computed a total of 164 stabilizing places and 322 stable transitions
Computed a total of 164 stabilizing places and 322 stable transitions
Detected a total of 164/219 stabilizing places and 322/8584 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 149 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 242 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=40 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 165 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2023-03-12 11:54:19] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
[2023-03-12 11:54:19] [INFO ] Invariant cache hit.
[2023-03-12 11:54:21] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-12 11:54:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 11:54:21] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2023-03-12 11:54:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 11:54:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-12 11:54:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 11:54:24] [INFO ] [Nat]Absence check using state equation in 248 ms returned sat
[2023-03-12 11:54:24] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 11:54:26] [INFO ] [Nat]Added 102 Read/Feed constraints in 1657 ms returned sat
[2023-03-12 11:54:27] [INFO ] Computed and/alt/rep : 210/418/210 causal constraints (skipped 313 transitions) in 300 ms.
[2023-03-12 11:54:27] [INFO ] Added : 50 causal constraints over 11 iterations in 1087 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Product exploration explored 100000 steps with 205 reset in 2168 ms.
Product exploration explored 100000 steps with 205 reset in 2175 ms.
Support contains 1 out of 219 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 219/219 places, 8584/8584 transitions.
Applied a total of 0 rules in 2441 ms. Remains 219 /219 variables (removed 0) and now considering 8584/8584 (removed 0) transitions.
[2023-03-12 11:54:34] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
[2023-03-12 11:54:34] [INFO ] Invariant cache hit.
[2023-03-12 11:54:35] [INFO ] Implicit Places using invariants in 1050 ms returned []
[2023-03-12 11:54:35] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
[2023-03-12 11:54:35] [INFO ] Invariant cache hit.
[2023-03-12 11:54:37] [INFO ] Implicit Places using invariants and state equation in 1385 ms returned []
Implicit Place search using SMT with State Equation took 2437 ms to find 0 implicit places.
[2023-03-12 11:54:38] [INFO ] Redundant transitions in 978 ms returned []
[2023-03-12 11:54:38] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
[2023-03-12 11:54:38] [INFO ] Invariant cache hit.
[2023-03-12 11:54:40] [INFO ] Dead Transitions using invariants and state equation in 2201 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8062 ms. Remains : 219/219 places, 8584/8584 transitions.
Treatment of property BridgeAndVehicles-PT-V80P20N50-LTLCardinality-14 finished in 56885 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(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' '!(X(F(((F(p0)||X(p1)) U (G((F(p0)||X(p1)))||((F(p0)||X(p1))&&G(!p2)))))))'
Found a Shortening insensitive property : BridgeAndVehicles-PT-V80P20N50-LTLCardinality-01
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND p2 (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), false]
Support contains 4 out of 226 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 226/226 places, 8588/8588 transitions.
Graph (complete) has 10945 edges and 226 vertex of which 225 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.11 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 20 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 224 transition count 8587
Applied a total of 3 rules in 141 ms. Remains 224 /226 variables (removed 2) and now considering 8587/8588 (removed 1) transitions.
[2023-03-12 11:54:41] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 224 cols
[2023-03-12 11:54:41] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 11:54:43] [INFO ] Dead Transitions using invariants and state equation in 2169 ms found 0 transitions.
[2023-03-12 11:54:43] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 11:54:43] [INFO ] Invariant cache hit.
[2023-03-12 11:54:44] [INFO ] Implicit Places using invariants in 709 ms returned []
[2023-03-12 11:54:44] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 11:54:44] [INFO ] Invariant cache hit.
[2023-03-12 11:54:44] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 11:54:47] [INFO ] Implicit Places using invariants and state equation in 3070 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3788 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 223/226 places, 8587/8588 transitions.
Applied a total of 0 rules in 98 ms. Remains 223 /223 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 6197 ms. Remains : 223/226 places, 8587/8588 transitions.
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N50-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p2, acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 6}], [{ cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={1} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 6}], [{ cond=(AND p2 (NOT p0)), acceptance={0, 1} source=5 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={1} source=5 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 5}, { cond=(AND p2 (NOT p0)), acceptance={0} source=5 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={0, 1} source=6 dest: 3}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=6 dest: 5}, { cond=(AND p2 (NOT p0) p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p2:(OR (LEQ s82 (ADD s84 s85)) (LEQ 1 s171)), p0:(LEQ s82 (ADD s84 s85)), p1:(GT 1 s171)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1632 reset in 1713 ms.
Product exploration explored 100000 steps with 1567 reset in 1888 ms.
Computed a total of 166 stabilizing places and 323 stable transitions
Computed a total of 166 stabilizing places and 323 stable transitions
Detected a total of 166/223 stabilizing places and 323/8587 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 636 ms. Reduced automaton from 7 states, 22 edges and 3 AP (stutter sensitive) to 7 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 268 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND p2 (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), false]
Incomplete random walk after 10000 steps, including 17 resets, run finished after 362 ms. (steps per millisecond=27 ) properties (out of 10) seen :8
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 11:54:52] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 223 cols
[2023-03-12 11:54:52] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 11:54:52] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (G (NOT (AND p2 p1 (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (AND (NOT p2) (NOT p0))), (F (AND p2 (NOT p1) (NOT p0))), (F (NOT p2)), (F (AND p2 (NOT p0))), (F (NOT p0)), (F (AND (NOT p2) p1 (NOT p0))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 13 factoid took 767 ms. Reduced automaton from 7 states, 22 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Support contains 4 out of 223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 8587/8587 transitions.
Applied a total of 0 rules in 45 ms. Remains 223 /223 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
[2023-03-12 11:54:53] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 11:54:53] [INFO ] Invariant cache hit.
[2023-03-12 11:54:56] [INFO ] Dead Transitions using invariants and state equation in 2298 ms found 0 transitions.
[2023-03-12 11:54:56] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 11:54:56] [INFO ] Invariant cache hit.
[2023-03-12 11:54:57] [INFO ] Implicit Places using invariants in 777 ms returned []
[2023-03-12 11:54:57] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 11:54:57] [INFO ] Invariant cache hit.
[2023-03-12 11:54:57] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 11:55:01] [INFO ] Implicit Places using invariants and state equation in 4670 ms returned []
Implicit Place search using SMT with State Equation took 5449 ms to find 0 implicit places.
[2023-03-12 11:55:01] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 11:55:01] [INFO ] Invariant cache hit.
[2023-03-12 11:55:03] [INFO ] Dead Transitions using invariants and state equation in 2139 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9933 ms. Remains : 223/223 places, 8587/8587 transitions.
Computed a total of 166 stabilizing places and 323 stable transitions
Computed a total of 166 stabilizing places and 323 stable transitions
Detected a total of 166/223 stabilizing places and 323/8587 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 217 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 7 states, 17 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false, false]
Incomplete random walk after 10000 steps, including 17 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 11:55:04] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 11:55:04] [INFO ] Invariant cache hit.
[2023-03-12 11:55:04] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) p1 p2)))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 7 factoid took 376 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter insensitive) to 6 states, 13 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 224 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Product exploration explored 100000 steps with 992 reset in 1801 ms.
Product exploration explored 100000 steps with 985 reset in 1799 ms.
Support contains 4 out of 223 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 223/223 places, 8587/8587 transitions.
Applied a total of 0 rules in 2901 ms. Remains 223 /223 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
[2023-03-12 11:55:12] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 11:55:12] [INFO ] Invariant cache hit.
[2023-03-12 11:55:14] [INFO ] Dead Transitions using invariants and state equation in 2281 ms found 0 transitions.
[2023-03-12 11:55:14] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 11:55:14] [INFO ] Invariant cache hit.
[2023-03-12 11:55:15] [INFO ] Implicit Places using invariants in 729 ms returned []
[2023-03-12 11:55:15] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 11:55:15] [INFO ] Invariant cache hit.
[2023-03-12 11:55:15] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 11:55:18] [INFO ] Implicit Places using invariants and state equation in 3110 ms returned []
Implicit Place search using SMT with State Equation took 3841 ms to find 0 implicit places.
[2023-03-12 11:55:19] [INFO ] Redundant transitions in 1045 ms returned []
[2023-03-12 11:55:19] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 11:55:19] [INFO ] Invariant cache hit.
[2023-03-12 11:55:21] [INFO ] Dead Transitions using invariants and state equation in 2155 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12232 ms. Remains : 223/223 places, 8587/8587 transitions.
Treatment of property BridgeAndVehicles-PT-V80P20N50-LTLCardinality-01 finished in 41233 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(p0) U (p1||F(p2))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2023-03-12 11:55:22] [INFO ] Flatten gal took : 287 ms
[2023-03-12 11:55:22] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-12 11:55:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 226 places, 8588 transitions and 67308 arcs took 74 ms.
Total runtime 337738 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1999/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1999/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1999/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1999/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : BridgeAndVehicles-PT-V80P20N50-LTLCardinality-00
Could not compute solution for formula : BridgeAndVehicles-PT-V80P20N50-LTLCardinality-01
Could not compute solution for formula : BridgeAndVehicles-PT-V80P20N50-LTLCardinality-12
Could not compute solution for formula : BridgeAndVehicles-PT-V80P20N50-LTLCardinality-14

BK_STOP 1678622132185

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name BridgeAndVehicles-PT-V80P20N50-LTLCardinality-00
ltl formula formula --ltl=/tmp/1999/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 226 places, 8588 transitions and 67308 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.760 real 0.440 user 0.310 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1999/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1999/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1999/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1999/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2
ltl formula name BridgeAndVehicles-PT-V80P20N50-LTLCardinality-01
ltl formula formula --ltl=/tmp/1999/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 226 places, 8588 transitions and 67308 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.810 real 0.340 user 0.420 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1999/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1999/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1999/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1999/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2
ltl formula name BridgeAndVehicles-PT-V80P20N50-LTLCardinality-12
ltl formula formula --ltl=/tmp/1999/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 226 places, 8588 transitions and 67308 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.620 real 0.350 user 0.330 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1999/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1999/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1999/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1999/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
ltl formula name BridgeAndVehicles-PT-V80P20N50-LTLCardinality-14
ltl formula formula --ltl=/tmp/1999/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 226 places, 8588 transitions and 67308 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.680 real 0.300 user 0.280 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1999/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1999/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1999/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1999/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-PT-V80P20N50"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is BridgeAndVehicles-PT-V80P20N50, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r041-tajo-167813694500291"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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