Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r065-tajo-171620414200002.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is BridgeAndVehicles-COL-V04P05N02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r065-tajo-171620414200002
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 9.2K Apr 13 01:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Apr 13 01:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 13 01:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 13 01:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 13 01:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Apr 13 01:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 13 01:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 13 01:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 37K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716622652224

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=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V04P05N02
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202304061127
[2024-05-25 07:37:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 07:37:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 07:37:34] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-25 07:37:34] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-25 07:37:35] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 575 ms
[2024-05-25 07:37:35] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 28 PT places and 346.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2024-05-25 07:37:35] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 10 ms.
[2024-05-25 07:37:35] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Initial state reduction rules removed 5 formulas.
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 12 stabilizing places and 6 stable transitions
Graph (complete) has 51 edges and 15 vertex of which 13 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Remains 11 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Computed a total of 9 stabilizing places and 6 stable transitions
Graph (complete) has 22 edges and 12 vertex of which 10 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 445 ms. (steps per millisecond=22 ) properties (out of 21) seen :15
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 10 rows 12 cols
[2024-05-25 07:37:36] [INFO ] Computed 4 invariants in 3 ms
[2024-05-25 07:37:36] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-25 07:37:36] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2024-05-25 07:37:36] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-25 07:37:36] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :2
[2024-05-25 07:37:36] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :2
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-25 07:37:36] [INFO ] After 68ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :2
Fused 5 Parikh solutions to 2 different solutions.
Finished Parikh walk after 18 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=9 )
Parikh walk visited 1 properties in 2 ms.
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 10/10 transitions.
Graph (complete) has 20 edges and 12 vertex of which 10 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 10 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 9 transition count 9
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 9 transition count 8
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 9 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 8 transition count 7
Applied a total of 6 rules in 14 ms. Remains 8 /12 variables (removed 4) and now considering 7/10 (removed 3) transitions.
// Phase 1: matrix 7 rows 8 cols
[2024-05-25 07:37:36] [INFO ] Computed 2 invariants in 1 ms
[2024-05-25 07:37:36] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 8/12 places, 7/10 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Finished probabilistic random walk after 445 steps, run visited all 1 properties in 18 ms. (steps per millisecond=24 )
Probabilistic random walk after 445 steps, saw 156 distinct states, run finished after 18 ms. (steps per millisecond=24 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
[2024-05-25 07:37:36] [INFO ] Flatten gal took : 23 ms
[2024-05-25 07:37:36] [INFO ] Flatten gal took : 3 ms
Arc [1:1*[(MOD (ADD $cA 1) 5)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 5) 5) 5)]] contains successor/predecessor on variables of sort voitureB
Arc [13:1*[(MOD (ADD $cpt 1) 3)]] contains successor/predecessor on variables of sort compteur
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2024-05-25 07:37:36] [INFO ] Unfolded HLPN to a Petri net with 28 places and 52 transitions 326 arcs in 11 ms.
[2024-05-25 07:37:36] [INFO ] Unfolded 11 HLPN properties in 1 ms.
Support contains 15 out of 28 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 52/52 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2024-05-25 07:37:36] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 28 cols
[2024-05-25 07:37:36] [INFO ] Computed 7 invariants in 1 ms
[2024-05-25 07:37:36] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
[2024-05-25 07:37:36] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2024-05-25 07:37:36] [INFO ] Invariant cache hit.
[2024-05-25 07:37:36] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-25 07:37:36] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2024-05-25 07:37:36] [INFO ] Invariant cache hit.
[2024-05-25 07:37:37] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 07:37:37] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2024-05-25 07:37:37] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2024-05-25 07:37:37] [INFO ] Invariant cache hit.
[2024-05-25 07:37:37] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 271 ms. Remains : 28/28 places, 52/52 transitions.
Support contains 15 out of 28 places after structural reductions.
[2024-05-25 07:37:37] [INFO ] Flatten gal took : 9 ms
[2024-05-25 07:37:37] [INFO ] Flatten gal took : 34 ms
[2024-05-25 07:37:37] [INFO ] Input system was already deterministic with 52 transitions.
Incomplete random walk after 10000 steps, including 229 resets, run finished after 327 ms. (steps per millisecond=30 ) properties (out of 20) seen :13
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 125 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 112 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 111 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2024-05-25 07:37:38] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2024-05-25 07:37:38] [INFO ] Invariant cache hit.
[2024-05-25 07:37:38] [INFO ] [Real]Absence check using 7 positive place invariants in 52 ms returned sat
[2024-05-25 07:37:38] [INFO ] After 705ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:6
[2024-05-25 07:37:38] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-25 07:37:38] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :4
[2024-05-25 07:37:39] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 07:37:39] [INFO ] After 21ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :3 sat :4
[2024-05-25 07:37:39] [INFO ] After 63ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :4
Attempting to minimize the solution found.
Minimization took 102 ms.
[2024-05-25 07:37:39] [INFO ] After 272ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :4
Fused 7 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 28 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 28/28 places, 52/52 transitions.
Graph (complete) has 146 edges and 28 vertex of which 26 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 26 /28 variables (removed 2) and now considering 52/52 (removed 0) transitions.
[2024-05-25 07:37:39] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2024-05-25 07:37:39] [INFO ] Computed 5 invariants in 3 ms
[2024-05-25 07:37:39] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 26/28 places, 52/52 transitions.
Incomplete random walk after 10000 steps, including 230 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 94 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 94 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 113 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 4) seen :0
Probably explored full state space saw : 2874 states, properties seen :0
Probabilistic random walk after 10034 steps, saw 2874 distinct states, run finished after 137 ms. (steps per millisecond=73 ) properties seen :0
Explored full state space saw : 2874 states, properties seen :0
Exhaustive walk after 10034 steps, saw 2874 distinct states, run finished after 97 ms. (steps per millisecond=103 ) properties seen :0
Parikh walk visited 0 properties in 0 ms.
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 7 atomic propositions for a total of 10 simplifications.
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 19 stabilizing places and 20 stable transitions
Graph (complete) has 214 edges and 28 vertex of which 26 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 28 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 28/28 places, 52/52 transitions.
Graph (complete) has 214 edges and 28 vertex of which 26 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 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 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 25 transition count 51
Applied a total of 3 rules in 5 ms. Remains 25 /28 variables (removed 3) and now considering 51/52 (removed 1) transitions.
[2024-05-25 07:37:40] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2024-05-25 07:37:40] [INFO ] Computed 5 invariants in 2 ms
[2024-05-25 07:37:43] [INFO ] Dead Transitions using invariants and state equation in 2738 ms found 0 transitions.
[2024-05-25 07:37:43] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-25 07:37:43] [INFO ] Invariant cache hit.
[2024-05-25 07:37:43] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-25 07:37:43] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-25 07:37:43] [INFO ] Invariant cache hit.
[2024-05-25 07:37:43] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 07:37:43] [INFO ] Implicit Places using invariants and state equation in 102 ms returned [7, 14]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 188 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/28 places, 51/52 transitions.
Applied a total of 0 rules in 3 ms. Remains 23 /23 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2936 ms. Remains : 23/28 places, 51/52 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 249 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V04P05N02-LTLCardinality-04 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:(LEQ 1 s12)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 6312 reset in 353 ms.
Product exploration explored 100000 steps with 6295 reset in 263 ms.
Computed a total of 14 stabilizing places and 19 stable transitions
Computed a total of 14 stabilizing places and 19 stable transitions
Detected a total of 14/23 stabilizing places and 19/51 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 137 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Finished random walk after 16 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=16 )
Parikh walk visited 0 properties in 0 ms.
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 143 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
[2024-05-25 07:37:44] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2024-05-25 07:37:44] [INFO ] Computed 5 invariants in 2 ms
[2024-05-25 07:37:44] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 07:37:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 07:37:44] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-25 07:37:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 07:37:44] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 07:37:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 07:37:44] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 07:37:44] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 07:37:44] [INFO ] [Nat]Added 6 Read/Feed constraints in 4 ms returned sat
[2024-05-25 07:37:44] [INFO ] Computed and/alt/rep : 24/79/24 causal constraints (skipped 6 transitions) in 4 ms.
[2024-05-25 07:37:44] [INFO ] Added : 19 causal constraints over 4 iterations in 54 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 51/51 transitions.
Applied a total of 0 rules in 5 ms. Remains 23 /23 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2024-05-25 07:37:44] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-25 07:37:44] [INFO ] Invariant cache hit.
[2024-05-25 07:37:45] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
[2024-05-25 07:37:45] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-25 07:37:45] [INFO ] Invariant cache hit.
[2024-05-25 07:37:45] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-25 07:37:45] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-25 07:37:45] [INFO ] Invariant cache hit.
[2024-05-25 07:37:45] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 07:37:45] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
[2024-05-25 07:37:45] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-25 07:37:45] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-25 07:37:45] [INFO ] Invariant cache hit.
[2024-05-25 07:37:45] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 515 ms. Remains : 23/23 places, 51/51 transitions.
Computed a total of 14 stabilizing places and 19 stable transitions
Computed a total of 14 stabilizing places and 19 stable transitions
Detected a total of 14/23 stabilizing places and 19/51 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 115 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0)]
Finished random walk after 16 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=16 )
Parikh walk visited 0 properties in 0 ms.
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 141 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
[2024-05-25 07:37:46] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-25 07:37:46] [INFO ] Invariant cache hit.
[2024-05-25 07:37:46] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 07:37:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 07:37:46] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-25 07:37:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 07:37:46] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 07:37:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 07:37:46] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-25 07:37:46] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 07:37:46] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2024-05-25 07:37:46] [INFO ] Computed and/alt/rep : 24/79/24 causal constraints (skipped 6 transitions) in 7 ms.
[2024-05-25 07:37:46] [INFO ] Added : 12 causal constraints over 3 iterations in 34 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6289 reset in 133 ms.
Product exploration explored 100000 steps with 6321 reset in 117 ms.
Built C files in :
/tmp/ltsmin18394836987137865135
[2024-05-25 07:37:46] [INFO ] Computing symmetric may disable matrix : 51 transitions.
[2024-05-25 07:37:46] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 07:37:46] [INFO ] Computing symmetric may enable matrix : 51 transitions.
[2024-05-25 07:37:46] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 07:37:46] [INFO ] Computing Do-Not-Accords matrix : 51 transitions.
[2024-05-25 07:37:46] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 07:37:46] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18394836987137865135
Running compilation step : cd /tmp/ltsmin18394836987137865135;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 278 ms.
Running link step : cd /tmp/ltsmin18394836987137865135;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin18394836987137865135;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4359724509320403379.hoa' '--buchi-type=spotba'
LTSmin run took 223 ms.
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLCardinality-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BridgeAndVehicles-COL-V04P05N02-LTLCardinality-04 finished in 6938 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 3 out of 28 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 28/28 places, 52/52 transitions.
Graph (complete) has 214 edges and 28 vertex of which 27 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 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 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 26 transition count 51
Applied a total of 3 rules in 9 ms. Remains 26 /28 variables (removed 2) and now considering 51/52 (removed 1) transitions.
[2024-05-25 07:37:47] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 26 cols
[2024-05-25 07:37:47] [INFO ] Computed 6 invariants in 1 ms
[2024-05-25 07:37:47] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
[2024-05-25 07:37:47] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-25 07:37:47] [INFO ] Invariant cache hit.
[2024-05-25 07:37:47] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-25 07:37:47] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-25 07:37:47] [INFO ] Invariant cache hit.
[2024-05-25 07:37:47] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 07:37:47] [INFO ] Implicit Places using invariants and state equation in 84 ms returned [8, 15]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 175 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/28 places, 51/52 transitions.
Applied a total of 0 rules in 33 ms. Remains 24 /24 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 277 ms. Remains : 24/28 places, 51/52 transitions.
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-COL-V04P05N02-LTLCardinality-07 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:(GT 1 (ADD s17 s18)), p1:(GT 1 s6)], 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]]
Stuttering criterion allowed to conclude after 64 steps with 4 reset in 0 ms.
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V04P05N02-LTLCardinality-07 finished in 453 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&X(X(p1)))))))'
Support contains 3 out of 28 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 52/52 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 27 transition count 52
Applied a total of 1 rules in 1 ms. Remains 27 /28 variables (removed 1) and now considering 52/52 (removed 0) transitions.
[2024-05-25 07:37:47] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 27 cols
[2024-05-25 07:37:47] [INFO ] Computed 6 invariants in 2 ms
[2024-05-25 07:37:50] [INFO ] Dead Transitions using invariants and state equation in 2745 ms found 0 transitions.
[2024-05-25 07:37:50] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2024-05-25 07:37:50] [INFO ] Invariant cache hit.
[2024-05-25 07:37:50] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-25 07:37:50] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2024-05-25 07:37:50] [INFO ] Invariant cache hit.
[2024-05-25 07:37:50] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 07:37:50] [INFO ] Implicit Places using invariants and state equation in 65 ms returned [7, 15]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 140 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/28 places, 52/52 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2894 ms. Remains : 25/28 places, 52/52 transitions.
Stuttering acceptance computed with spot in 257 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-COL-V04P05N02-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 1}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 4}]], initial=2, aps=[p0:(LEQ s6 1), p1:(LEQ s14 s15)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V04P05N02-LTLCardinality-08 finished in 3167 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 28 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 52/52 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 27 transition count 52
Applied a total of 1 rules in 1 ms. Remains 27 /28 variables (removed 1) and now considering 52/52 (removed 0) transitions.
[2024-05-25 07:37:50] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2024-05-25 07:37:50] [INFO ] Invariant cache hit.
[2024-05-25 07:37:50] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
[2024-05-25 07:37:50] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2024-05-25 07:37:50] [INFO ] Invariant cache hit.
[2024-05-25 07:37:50] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-25 07:37:50] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2024-05-25 07:37:50] [INFO ] Invariant cache hit.
[2024-05-25 07:37:50] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 07:37:51] [INFO ] Implicit Places using invariants and state equation in 55 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 98 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 26/28 places, 52/52 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 146 ms. Remains : 26/28 places, 52/52 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : BridgeAndVehicles-COL-V04P05N02-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(GT s16 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V04P05N02-LTLCardinality-10 finished in 247 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 4 out of 28 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 52/52 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 26 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 25 transition count 51
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 25 transition count 51
Applied a total of 4 rules in 2 ms. Remains 25 /28 variables (removed 3) and now considering 51/52 (removed 1) transitions.
[2024-05-25 07:37:51] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2024-05-25 07:37:51] [INFO ] Computed 5 invariants in 2 ms
[2024-05-25 07:37:51] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
[2024-05-25 07:37:51] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-25 07:37:51] [INFO ] Invariant cache hit.
[2024-05-25 07:37:51] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-25 07:37:51] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-25 07:37:51] [INFO ] Invariant cache hit.
[2024-05-25 07:37:51] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 07:37:51] [INFO ] Implicit Places using invariants and state equation in 53 ms returned [7, 14]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 94 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/28 places, 51/52 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 142 ms. Remains : 23/28 places, 51/52 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V04P05N02-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s14 s15) (ADD s21 s22))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 30843 reset in 115 ms.
Product exploration explored 100000 steps with 30516 reset in 127 ms.
Computed a total of 14 stabilizing places and 19 stable transitions
Computed a total of 14 stabilizing places and 19 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 185 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 174 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 51/51 transitions.
Applied a total of 0 rules in 0 ms. Remains 23 /23 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2024-05-25 07:37:52] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2024-05-25 07:37:52] [INFO ] Computed 5 invariants in 1 ms
[2024-05-25 07:37:52] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
[2024-05-25 07:37:52] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-25 07:37:52] [INFO ] Invariant cache hit.
[2024-05-25 07:37:52] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-25 07:37:52] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-25 07:37:52] [INFO ] Invariant cache hit.
[2024-05-25 07:37:52] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 07:37:52] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2024-05-25 07:37:52] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-25 07:37:52] [INFO ] Invariant cache hit.
[2024-05-25 07:37:52] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 157 ms. Remains : 23/23 places, 51/51 transitions.
Computed a total of 14 stabilizing places and 19 stable transitions
Computed a total of 14 stabilizing places and 19 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 184 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 159 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 30615 reset in 129 ms.
Product exploration explored 100000 steps with 30490 reset in 136 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 51/51 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 51
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 1 rules in 3 ms. Remains 23 /23 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2024-05-25 07:37:53] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2024-05-25 07:37:53] [INFO ] Computed 5 invariants in 1 ms
[2024-05-25 07:37:53] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
[2024-05-25 07:37:53] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 07:37:53] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-25 07:37:53] [INFO ] Invariant cache hit.
[2024-05-25 07:37:53] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/23 places, 51/51 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 109 ms. Remains : 23/23 places, 51/51 transitions.
Built C files in :
/tmp/ltsmin14752503399590224615
[2024-05-25 07:37:53] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14752503399590224615
Running compilation step : cd /tmp/ltsmin14752503399590224615;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 166 ms.
Running link step : cd /tmp/ltsmin14752503399590224615;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin14752503399590224615;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased324332020237137454.hoa' '--buchi-type=spotba'
LTSmin run took 157 ms.
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLCardinality-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BridgeAndVehicles-COL-V04P05N02-LTLCardinality-11 finished in 3055 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(G(p0)))))'
Support contains 2 out of 28 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 28/28 places, 52/52 transitions.
Graph (complete) has 214 edges and 28 vertex of which 26 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 25 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 25 transition count 51
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 23 transition count 50
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 21 transition count 48
Applied a total of 10 rules in 9 ms. Remains 21 /28 variables (removed 7) and now considering 48/52 (removed 4) transitions.
[2024-05-25 07:37:54] [INFO ] Flow matrix only has 30 transitions (discarded 18 similar events)
// Phase 1: matrix 30 rows 21 cols
[2024-05-25 07:37:54] [INFO ] Computed 4 invariants in 1 ms
[2024-05-25 07:37:54] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-25 07:37:54] [INFO ] Flow matrix only has 30 transitions (discarded 18 similar events)
[2024-05-25 07:37:54] [INFO ] Invariant cache hit.
[2024-05-25 07:37:54] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 07:37:54] [INFO ] Implicit Places using invariants and state equation in 54 ms returned [6, 12]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 93 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/28 places, 48/52 transitions.
Applied a total of 0 rules in 3 ms. Remains 19 /19 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 105 ms. Remains : 19/28 places, 48/52 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V04P05N02-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s5 s11)], 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 3283 reset in 142 ms.
Product exploration explored 100000 steps with 3283 reset in 132 ms.
Computed a total of 12 stabilizing places and 18 stable transitions
Computed a total of 12 stabilizing places and 18 stable transitions
Detected a total of 12/19 stabilizing places and 18/48 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 221 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 37 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 256 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 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Support contains 2 out of 19 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 48/48 transitions.
Applied a total of 0 rules in 3 ms. Remains 19 /19 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2024-05-25 07:37:55] [INFO ] Flow matrix only has 30 transitions (discarded 18 similar events)
// Phase 1: matrix 30 rows 19 cols
[2024-05-25 07:37:55] [INFO ] Computed 4 invariants in 2 ms
[2024-05-25 07:37:55] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-25 07:37:55] [INFO ] Flow matrix only has 30 transitions (discarded 18 similar events)
[2024-05-25 07:37:55] [INFO ] Invariant cache hit.
[2024-05-25 07:37:55] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 07:37:55] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2024-05-25 07:37:55] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-25 07:37:55] [INFO ] Flow matrix only has 30 transitions (discarded 18 similar events)
[2024-05-25 07:37:55] [INFO ] Invariant cache hit.
[2024-05-25 07:37:55] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 147 ms. Remains : 19/19 places, 48/48 transitions.
Computed a total of 12 stabilizing places and 18 stable transitions
Computed a total of 12 stabilizing places and 18 stable transitions
Detected a total of 12/19 stabilizing places and 18/48 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 190 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 34 ms :[(NOT p0)]
Finished random walk after 31 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=31 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 186 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 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3282 reset in 112 ms.
Product exploration explored 100000 steps with 3286 reset in 122 ms.
Built C files in :
/tmp/ltsmin3592928249135876463
[2024-05-25 07:37:56] [INFO ] Computing symmetric may disable matrix : 48 transitions.
[2024-05-25 07:37:56] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 07:37:56] [INFO ] Computing symmetric may enable matrix : 48 transitions.
[2024-05-25 07:37:56] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 07:37:56] [INFO ] Computing Do-Not-Accords matrix : 48 transitions.
[2024-05-25 07:37:56] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 07:37:56] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3592928249135876463
Running compilation step : cd /tmp/ltsmin3592928249135876463;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 196 ms.
Running link step : cd /tmp/ltsmin3592928249135876463;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin3592928249135876463;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16367304044707640372.hoa' '--buchi-type=spotba'
LTSmin run took 106 ms.
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLCardinality-12 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BridgeAndVehicles-COL-V04P05N02-LTLCardinality-12 finished in 2418 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 28 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 28/28 places, 52/52 transitions.
Graph (complete) has 214 edges and 28 vertex of which 26 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 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 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 25 transition count 51
Applied a total of 3 rules in 5 ms. Remains 25 /28 variables (removed 3) and now considering 51/52 (removed 1) transitions.
[2024-05-25 07:37:56] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2024-05-25 07:37:56] [INFO ] Computed 5 invariants in 4 ms
[2024-05-25 07:37:56] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
[2024-05-25 07:37:56] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-25 07:37:56] [INFO ] Invariant cache hit.
[2024-05-25 07:37:56] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-25 07:37:56] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-25 07:37:56] [INFO ] Invariant cache hit.
[2024-05-25 07:37:56] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 07:37:56] [INFO ] Implicit Places using invariants and state equation in 73 ms returned [7, 14]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 124 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/28 places, 51/52 transitions.
Applied a total of 0 rules in 2 ms. Remains 23 /23 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 181 ms. Remains : 23/28 places, 51/52 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V04P05N02-LTLCardinality-13 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 s12 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 37 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V04P05N02-LTLCardinality-13 finished in 242 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Support contains 3 out of 28 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 52/52 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 26 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 25 transition count 51
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 25 transition count 51
Applied a total of 4 rules in 1 ms. Remains 25 /28 variables (removed 3) and now considering 51/52 (removed 1) transitions.
[2024-05-25 07:37:56] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2024-05-25 07:37:56] [INFO ] Computed 5 invariants in 1 ms
[2024-05-25 07:37:56] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
[2024-05-25 07:37:56] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-25 07:37:56] [INFO ] Invariant cache hit.
[2024-05-25 07:37:56] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-25 07:37:56] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-25 07:37:56] [INFO ] Invariant cache hit.
[2024-05-25 07:37:56] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 07:37:57] [INFO ] Implicit Places using invariants and state equation in 77 ms returned [7, 14]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 116 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/28 places, 51/52 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 161 ms. Remains : 23/28 places, 51/52 transitions.
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-COL-V04P05N02-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(LEQ 2 s6), p0:(LEQ s0 s13)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V04P05N02-LTLCardinality-14 finished in 299 ms.
All properties solved by simple procedures.
Total runtime 22621 ms.

BK_STOP 1716622677306

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-COL-V04P05N02"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is BridgeAndVehicles-COL-V04P05N02, 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 r065-tajo-171620414200002"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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