Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r024-tall-165251917900003.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
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 r024-tall-165251917900003
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 288K
-rw-r--r-- 1 mcc users 8.7K Apr 29 21:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 29 21:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 29 21:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 29 21:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 9 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 9 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 9 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_pt
-rw-r--r-- 1 mcc users 10 May 10 09:33 instance
-rw-r--r-- 1 mcc users 5 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 37K May 10 09:33 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 1652537278692

Running Version 202205111006
[2022-05-14 14:07:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-14 14:07:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-14 14:08:00] [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.
[2022-05-14 14:08:00] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-14 14:08:00] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 617 ms
[2022-05-14 14:08:00] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 28 PT places and 346.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-14 14:08:00] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 7 ms.
[2022-05-14 14:08:00] [INFO ] Skeletonized 13 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLCardinality-13 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.2 ms
Remains 10 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.
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 208 ms. (steps per millisecond=48 ) properties (out of 10) seen :8
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 10 rows 12 cols
[2022-05-14 14:08:01] [INFO ] Computed 4 place invariants in 6 ms
[2022-05-14 14:08:01] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2022-05-14 14:08:01] [INFO ] After 98ms 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 1 ms.
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-14 14:08:01] [INFO ] Flatten gal took : 14 ms
[2022-05-14 14:08:01] [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
[2022-05-14 14:08:01] [INFO ] Unfolded HLPN to a Petri net with 28 places and 52 transitions 326 arcs in 15 ms.
[2022-05-14 14:08:01] [INFO ] Unfolded 6 HLPN properties in 0 ms.
Support contains 10 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
Applied a total of 2 rules in 7 ms. Remains 26 /28 variables (removed 2) and now considering 52/52 (removed 0) transitions.
[2022-05-14 14:08:01] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2022-05-14 14:08:01] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 14:08:01] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
[2022-05-14 14:08:01] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2022-05-14 14:08:01] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 14:08:01] [INFO ] Implicit Places using invariants in 68 ms returned []
[2022-05-14 14:08:01] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2022-05-14 14:08:01] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 14:08:01] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-14 14:08:01] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2022-05-14 14:08:01] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2022-05-14 14:08:01] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 14:08:01] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 26/28 places, 52/52 transitions.
Finished structural reductions, in 1 iterations. Remains : 26/28 places, 52/52 transitions.
Support contains 10 out of 26 places after structural reductions.
[2022-05-14 14:08:01] [INFO ] Flatten gal took : 9 ms
[2022-05-14 14:08:01] [INFO ] Flatten gal took : 8 ms
[2022-05-14 14:08:01] [INFO ] Input system was already deterministic with 52 transitions.
Finished random walk after 353 steps, including 8 resets, run visited all 9 properties in 7 ms. (steps per millisecond=50 )
Computed a total of 17 stabilizing places and 20 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||p0)))'
Support contains 1 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 52/52 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 25 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 25 transition count 51
Applied a total of 2 rules in 3 ms. Remains 25 /26 variables (removed 1) and now considering 51/52 (removed 1) transitions.
[2022-05-14 14:08:01] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2022-05-14 14:08:01] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 14:08:01] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
[2022-05-14 14:08:01] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2022-05-14 14:08:01] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-14 14:08:01] [INFO ] Implicit Places using invariants in 39 ms returned []
[2022-05-14 14:08:01] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2022-05-14 14:08:01] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 14:08:02] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-14 14:08:02] [INFO ] Implicit Places using invariants and state equation in 181 ms returned [7, 14]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 223 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/26 places, 51/52 transitions.
Applied a total of 0 rules in 0 ms. Remains 23 /23 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 23/26 places, 51/52 transitions.
Stuttering acceptance computed with spot in 295 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V04P05N02-LTLCardinality-00 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 3 s13)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 193 ms.
Product exploration explored 100000 steps with 50000 reset in 141 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 : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-COL-V04P05N02-LTLCardinality-00 finished in 1080 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(p0)||G(p1)))'
Support contains 1 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 52/52 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 25 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 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 5 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 9 place count 21 transition count 48
Applied a total of 9 rules in 13 ms. Remains 21 /26 variables (removed 5) and now considering 48/52 (removed 4) transitions.
[2022-05-14 14:08:02] [INFO ] Flow matrix only has 30 transitions (discarded 18 similar events)
// Phase 1: matrix 30 rows 21 cols
[2022-05-14 14:08:02] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-14 14:08:02] [INFO ] Implicit Places using invariants in 46 ms returned []
[2022-05-14 14:08:02] [INFO ] Flow matrix only has 30 transitions (discarded 18 similar events)
// Phase 1: matrix 30 rows 21 cols
[2022-05-14 14:08:02] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-14 14:08:02] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-14 14:08:03] [INFO ] Implicit Places using invariants and state equation in 99 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 147 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/26 places, 48/52 transitions.
Applied a total of 0 rules in 4 ms. Remains 20 /20 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 20/26 places, 48/52 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-COL-V04P05N02-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LEQ 1 s11), p1:(LEQ s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 26597 reset in 204 ms.
Product exploration explored 100000 steps with 26732 reset in 214 ms.
Computed a total of 13 stabilizing places and 18 stable transitions
Computed a total of 13 stabilizing places and 18 stable transitions
Detected a total of 13/20 stabilizing places and 18/48 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 5 factoid took 308 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 328 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 132 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-14 14:08:03] [INFO ] Flow matrix only has 30 transitions (discarded 18 similar events)
// Phase 1: matrix 30 rows 20 cols
[2022-05-14 14:08:03] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-14 14:08:03] [INFO ] After 14ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F p0), (F (NOT (AND (NOT p0) p1)))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 6 factoid took 356 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-COL-V04P05N02-LTLCardinality-01 finished in 1479 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X((X(F(G(F(p0))))||X(!p0)||p1)))))'
Support contains 4 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 52/52 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 25 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 25 transition count 51
Applied a total of 2 rules in 4 ms. Remains 25 /26 variables (removed 1) and now considering 51/52 (removed 1) transitions.
[2022-05-14 14:08:04] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2022-05-14 14:08:04] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 14:08:04] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
[2022-05-14 14:08:04] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2022-05-14 14:08:04] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 14:08:04] [INFO ] Implicit Places using invariants in 30 ms returned []
[2022-05-14 14:08:04] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2022-05-14 14:08:04] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 14:08:04] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-14 14:08:04] [INFO ] Implicit Places using invariants and state equation in 52 ms returned [7, 14]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 83 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/26 places, 51/52 transitions.
Applied a total of 0 rules in 0 ms. Remains 23 /23 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 23/26 places, 51/52 transitions.
Stuttering acceptance computed with spot in 217 ms :[false, false, false, false, (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V04P05N02-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(GT 1 (ADD s21 s22)), p0:(GT (ADD s21 s22) (ADD s16 s17))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 74 steps with 2 reset in 1 ms.
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V04P05N02-LTLCardinality-02 finished in 370 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(G(p0))))'
Support contains 1 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 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.
[2022-05-14 14:08:04] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2022-05-14 14:08:04] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 14:08:04] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
[2022-05-14 14:08:04] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2022-05-14 14:08:04] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-14 14:08:04] [INFO ] Implicit Places using invariants in 55 ms returned []
[2022-05-14 14:08:04] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2022-05-14 14:08:04] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-14 14:08:04] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-14 14:08:04] [INFO ] Implicit Places using invariants and state equation in 62 ms returned [7, 15]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 120 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/26 places, 52/52 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 24/26 places, 52/52 transitions.
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V04P05N02-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 2 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V04P05N02-LTLCardinality-03 finished in 256 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(X((G(p0)||p1))))))'
Support contains 5 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 52/52 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 25 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 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 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 23 transition count 50
Applied a total of 5 rules in 6 ms. Remains 23 /26 variables (removed 3) and now considering 50/52 (removed 2) transitions.
[2022-05-14 14:08:04] [INFO ] Flow matrix only has 32 transitions (discarded 18 similar events)
// Phase 1: matrix 32 rows 23 cols
[2022-05-14 14:08:04] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-14 14:08:04] [INFO ] Implicit Places using invariants in 23 ms returned []
[2022-05-14 14:08:04] [INFO ] Flow matrix only has 32 transitions (discarded 18 similar events)
// Phase 1: matrix 32 rows 23 cols
[2022-05-14 14:08:05] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-14 14:08:05] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-14 14:08:05] [INFO ] Implicit Places using invariants and state equation in 41 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 76 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/26 places, 50/52 transitions.
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 22/26 places, 50/52 transitions.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-COL-V04P05N02-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s15 s16) (ADD s13 s14)), p1:(LEQ 3 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5732 reset in 142 ms.
Product exploration explored 100000 steps with 5776 reset in 184 ms.
Computed a total of 13 stabilizing places and 18 stable transitions
Computed a total of 13 stabilizing places and 18 stable transitions
Detected a total of 13/22 stabilizing places and 18/50 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 2 factoid took 236 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 2 factoid took 269 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2022-05-14 14:08:06] [INFO ] Flow matrix only has 32 transitions (discarded 18 similar events)
// Phase 1: matrix 32 rows 22 cols
[2022-05-14 14:08:06] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-14 14:08:06] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 14:08:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:06] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-14 14:08:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:08:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2022-05-14 14:08:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:06] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-14 14:08:06] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-14 14:08:06] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2022-05-14 14:08:06] [INFO ] Computed and/alt/rep : 23/95/23 causal constraints (skipped 6 transitions) in 5 ms.
[2022-05-14 14:08:06] [INFO ] Added : 10 causal constraints over 4 iterations in 38 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 50/50 transitions.
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2022-05-14 14:08:06] [INFO ] Flow matrix only has 32 transitions (discarded 18 similar events)
// Phase 1: matrix 32 rows 22 cols
[2022-05-14 14:08:06] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-14 14:08:06] [INFO ] Implicit Places using invariants in 40 ms returned []
[2022-05-14 14:08:06] [INFO ] Flow matrix only has 32 transitions (discarded 18 similar events)
// Phase 1: matrix 32 rows 22 cols
[2022-05-14 14:08:06] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-14 14:08:06] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-14 14:08:06] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2022-05-14 14:08:06] [INFO ] Redundant transitions in 1 ms returned []
[2022-05-14 14:08:06] [INFO ] Flow matrix only has 32 transitions (discarded 18 similar events)
// Phase 1: matrix 32 rows 22 cols
[2022-05-14 14:08:06] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-14 14:08:06] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 50/50 transitions.
Computed a total of 13 stabilizing places and 18 stable transitions
Computed a total of 13 stabilizing places and 18 stable transitions
Detected a total of 13/22 stabilizing places and 18/50 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 2 factoid took 238 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 2 factoid took 264 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2022-05-14 14:08:07] [INFO ] Flow matrix only has 32 transitions (discarded 18 similar events)
// Phase 1: matrix 32 rows 22 cols
[2022-05-14 14:08:07] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-14 14:08:07] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2022-05-14 14:08:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:07] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-14 14:08:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:08:07] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 14:08:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:08:07] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-14 14:08:07] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-14 14:08:07] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2022-05-14 14:08:07] [INFO ] Computed and/alt/rep : 23/95/23 causal constraints (skipped 6 transitions) in 3 ms.
[2022-05-14 14:08:07] [INFO ] Added : 10 causal constraints over 4 iterations in 29 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5701 reset in 131 ms.
Product exploration explored 100000 steps with 5824 reset in 131 ms.
Built C files in :
/tmp/ltsmin6723294505900679030
[2022-05-14 14:08:07] [INFO ] Computing symmetric may disable matrix : 50 transitions.
[2022-05-14 14:08:07] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 14:08:07] [INFO ] Computing symmetric may enable matrix : 50 transitions.
[2022-05-14 14:08:07] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 14:08:07] [INFO ] Computing Do-Not-Accords matrix : 50 transitions.
[2022-05-14 14:08:07] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 14:08:07] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6723294505900679030
Running compilation step : cd /tmp/ltsmin6723294505900679030;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 225 ms.
Running link step : cd /tmp/ltsmin6723294505900679030;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin6723294505900679030;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6433978693142101523.hoa' '--buchi-type=spotba'
LTSmin run took 175 ms.
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLCardinality-09 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BridgeAndVehicles-COL-V04P05N02-LTLCardinality-09 finished in 3348 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(G((F(p0) U G(p0)))))))'
Support contains 1 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 52/52 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 25 transition count 51
Applied a total of 2 rules in 4 ms. Remains 25 /26 variables (removed 1) and now considering 51/52 (removed 1) transitions.
[2022-05-14 14:08:08] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2022-05-14 14:08:08] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-14 14:08:08] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2022-05-14 14:08:08] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2022-05-14 14:08:08] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-14 14:08:08] [INFO ] Implicit Places using invariants in 80 ms returned []
[2022-05-14 14:08:08] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2022-05-14 14:08:08] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-14 14:08:08] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-14 14:08:08] [INFO ] Implicit Places using invariants and state equation in 51 ms returned [7, 14]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 135 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/26 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 2 iterations. Remains : 23/26 places, 51/52 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V04P05N02-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s7)], 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-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V04P05N02-LTLCardinality-15 finished in 220 ms.
All properties solved by simple procedures.
Total runtime 8597 ms.

BK_STOP 1652537288632

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="itstools"
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-4028"
echo " Executing tool itstools"
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 r024-tall-165251917900003"
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 ;