Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r186-tajo-165281572200372.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Referendum-COL-0200, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-tajo-165281572200372
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 268K
-rw-r--r-- 1 mcc users 7.5K Apr 29 14:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 29 14:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 29 14:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 29 14:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 9 08:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 08:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 11K May 10 09:34 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 Referendum-COL-0200-LTLFireability-00
FORMULA_NAME Referendum-COL-0200-LTLFireability-01
FORMULA_NAME Referendum-COL-0200-LTLFireability-02
FORMULA_NAME Referendum-COL-0200-LTLFireability-03
FORMULA_NAME Referendum-COL-0200-LTLFireability-04
FORMULA_NAME Referendum-COL-0200-LTLFireability-05
FORMULA_NAME Referendum-COL-0200-LTLFireability-06
FORMULA_NAME Referendum-COL-0200-LTLFireability-07
FORMULA_NAME Referendum-COL-0200-LTLFireability-08
FORMULA_NAME Referendum-COL-0200-LTLFireability-09
FORMULA_NAME Referendum-COL-0200-LTLFireability-10
FORMULA_NAME Referendum-COL-0200-LTLFireability-11
FORMULA_NAME Referendum-COL-0200-LTLFireability-12
FORMULA_NAME Referendum-COL-0200-LTLFireability-13
FORMULA_NAME Referendum-COL-0200-LTLFireability-14
FORMULA_NAME Referendum-COL-0200-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653083165332

Running Version 202205111006
[2022-05-20 21:46:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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-20 21:46:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 21:46:06] [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-20 21:46:07] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-20 21:46:07] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 512 ms
[2022-05-20 21:46:07] [INFO ] Imported 4 HL places and 3 HL transitions for a total of 601 PT places and 401.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2022-05-20 21:46:07] [INFO ] Built PT skeleton of HLPN with 4 places and 3 transitions 6 arcs in 5 ms.
[2022-05-20 21:46:07] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Initial state reduction rules removed 4 formulas.
FORMULA Referendum-COL-0200-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0200-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0200-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0200-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 4 properties that can be checked using skeleton over-approximation.
Computed a total of 4 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 6 ms. (steps per millisecond=0 )
[2022-05-20 21:46:07] [INFO ] Flatten gal took : 14 ms
[2022-05-20 21:46:07] [INFO ] Flatten gal took : 1 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :Voters
Arc [0:1*[0]] contains constants of sort Voters
Arc [0:1*[1]] contains constants of sort Voters
Arc [0:1*[2]] contains constants of sort Voters
Arc [0:1*[3]] contains constants of sort Voters
Arc [0:1*[4]] contains constants of sort Voters
Arc [0:1*[5]] contains constants of sort Voters
Arc [0:1*[6]] contains constants of sort Voters
Arc [0:1*[7]] contains constants of sort Voters
Arc [0:1*[8]] contains constants of sort Voters
Arc [0:1*[9]] contains constants of sort Voters
Arc [0:1*[10]] contains constants of sort Voters
Arc [0:1*[11]] contains constants of sort Voters
Arc [0:1*[12]] contains constants of sort Voters
Arc [0:1*[13]] contains constants of sort Voters
Arc [0:1*[14]] contains constants of sort Voters
Arc [0:1*[15]] contains constants of sort Voters
Arc [0:1*[16]] contains constants of sort Voters
Arc [0:1*[17]] contains constants of sort Voters
Arc [0:1*[18]] contains constants of sort Voters
Arc [0:1*[19]] contains constants of sort Voters
Arc [0:1*[20]] contains constants of sort Voters
Arc [0:1*[21]] contains constants of sort Voters
Arc [0:1*[22]] contains constants of sort Voters
Arc [0:1*[23]] contains constants of sort Voters
Arc [0:1*[24]] contains constants of sort Voters
Arc [0:1*[25]] contains constants of sort Voters
Arc [0:1*[26]] contains constants of sort Voters
Arc [0:1*[27]] contains constants of sort Voters
Arc [0:1*[28]] contains constants of sort Voters
Arc [0:1*[29]] contains constants of sort Voters
Arc [0:1*[30]] contains constants of sort Voters
Arc [0:1*[31]] contains constants of sort Voters
Arc [0:1*[32]] contains constants of sort Voters
Arc [0:1*[33]] contains constants of sort Voters
Arc [0:1*[34]] contains constants of sort Voters
Arc [0:1*[35]] contains constants of sort Voters
Arc [0:1*[36]] contains constants of sort Voters
Arc [0:1*[37]] contains constants of sort Voters
Arc [0:1*[38]] contains constants of sort Voters
Arc [0:1*[39]] contains constants of sort Voters
Arc [0:1*[40]] contains constants of sort Voters
Arc [0:1*[41]] contains constants of sort Voters
Arc [0:1*[42]] contains constants of sort Voters
Arc [0:1*[43]] contains constants of sort Voters
Arc [0:1*[44]] contains constants of sort Voters
Arc [0:1*[45]] contains constants of sort Voters
Arc [0:1*[46]] contains constants of sort Voters
Arc [0:1*[47]] contains constants of sort Voters
Arc [0:1*[48]] contains constants of sort Voters
Arc [0:1*[49]] contains constants of sort Voters
Arc [0:1*[50]] contains constants of sort Voters
Arc [0:1*[51]] contains constants of sort Voters
Arc [0:1*[52]] contains constants of sort Voters
Arc [0:1*[53]] contains constants of sort Voters
Arc [0:1*[54]] contains constants of sort Voters
Arc [0:1*[55]] contains constants of sort Voters
Arc [0:1*[56]] contains constants of sort Voters
Arc [0:1*[57]] contains constants of sort Voters
Arc [0:1*[58]] contains constants of sort Voters
Arc [0:1*[59]] contains constants of sort Voters
Arc [0:1*[60]] contains constants of sort Voters
Arc [0:1*[61]] contains constants of sort Voters
Arc [0:1*[62]] contains constants of sort Voters
Arc [0:1*[63]] contains constants of sort Voters
Arc [0:1*[64]] contains constants of sort Voters
Arc [0:1*[65]] contains constants of sort Voters
Arc [0:1*[66]] contains constants of sort Voters
Arc [0:1*[67]] contains constants of sort Voters
Arc [0:1*[68]] contains constants of sort Voters
Arc [0:1*[69]] contains constants of sort Voters
Arc [0:1*[70]] contains constants of sort Voters
Arc [0:1*[71]] contains constants of sort Voters
Arc [0:1*[72]] contains constants of sort Voters
Arc [0:1*[73]] contains constants of sort Voters
Arc [0:1*[74]] contains constants of sort Voters
Arc [0:1*[75]] contains constants of sort Voters
Arc [0:1*[76]] contains constants of sort Voters
Arc [0:1*[77]] contains constants of sort Voters
Arc [0:1*[78]] contains constants of sort Voters
Arc [0:1*[79]] contains constants of sort Voters
Arc [0:1*[80]] contains constants of sort Voters
Arc [0:1*[81]] contains constants of sort Voters
Arc [0:1*[82]] contains constants of sort Voters
Arc [0:1*[83]] contains constants of sort Voters
Arc [0:1*[84]] contains constants of sort Voters
Arc [0:1*[85]] contains constants of sort Voters
Arc [0:1*[86]] contains constants of sort Voters
Arc [0:1*[87]] contains constants of sort Voters
Arc [0:1*[88]] contains constants of sort Voters
Arc [0:1*[89]] contains constants of sort Voters
Arc [0:1*[90]] contains constants of sort Voters
Arc [0:1*[91]] contains constants of sort Voters
Arc [0:1*[92]] contains constants of sort Voters
Arc [0:1*[93]] contains constants of sort Voters
Arc [0:1*[94]] contains constants of sort Voters
Arc [0:1*[95]] contains constants of sort Voters
Arc [0:1*[96]] contains constants of sort Voters
Arc [0:1*[97]] contains constants of sort Voters
Arc [0:1*[98]] contains constants of sort Voters
Arc [0:1*[99]] contains constants of sort Voters
Arc [0:1*[100]] contains constants of sort Voters
Arc [0:1*[101]] contains constants of sort Voters
Arc [0:1*[102]] contains constants of sort Voters
Arc [0:1*[103]] contains constants of sort Voters
Arc [0:1*[104]] contains constants of sort Voters
Arc [0:1*[105]] contains constants of sort Voters
Arc [0:1*[106]] contains constants of sort Voters
Arc [0:1*[107]] contains constants of sort Voters
Arc [0:1*[108]] contains constants of sort Voters
Arc [0:1*[109]] contains constants of sort Voters
Arc [0:1*[110]] contains constants of sort Voters
Arc [0:1*[111]] contains constants of sort Voters
Arc [0:1*[112]] contains constants of sort Voters
Arc [0:1*[113]] contains constants of sort Voters
Arc [0:1*[114]] contains constants of sort Voters
Arc [0:1*[115]] contains constants of sort Voters
Arc [0:1*[116]] contains constants of sort Voters
Arc [0:1*[117]] contains constants of sort Voters
Arc [0:1*[118]] contains constants of sort Voters
Arc [0:1*[119]] contains constants of sort Voters
Arc [0:1*[120]] contains constants of sort Voters
Arc [0:1*[121]] contains constants of sort Voters
Arc [0:1*[122]] contains constants of sort Voters
Arc [0:1*[123]] contains constants of sort Voters
Arc [0:1*[124]] contains constants of sort Voters
Arc [0:1*[125]] contains constants of sort Voters
Arc [0:1*[126]] contains constants of sort Voters
Arc [0:1*[127]] contains constants of sort Voters
Arc [0:1*[128]] contains constants of sort Voters
Arc [0:1*[129]] contains constants of sort Voters
Arc [0:1*[130]] contains constants of sort Voters
Arc [0:1*[131]] contains constants of sort Voters
Arc [0:1*[132]] contains constants of sort Voters
Arc [0:1*[133]] contains constants of sort Voters
Arc [0:1*[134]] contains constants of sort Voters
Arc [0:1*[135]] contains constants of sort Voters
Arc [0:1*[136]] contains constants of sort Voters
Arc [0:1*[137]] contains constants of sort Voters
Arc [0:1*[138]] contains constants of sort Voters
Arc [0:1*[139]] contains constants of sort Voters
Arc [0:1*[140]] contains constants of sort Voters
Arc [0:1*[141]] contains constants of sort Voters
Arc [0:1*[142]] contains constants of sort Voters
Arc [0:1*[143]] contains constants of sort Voters
Arc [0:1*[144]] contains constants of sort Voters
Arc [0:1*[145]] contains constants of sort Voters
Arc [0:1*[146]] contains constants of sort Voters
Arc [0:1*[147]] contains constants of sort Voters
Arc [0:1*[148]] contains constants of sort Voters
Arc [0:1*[149]] contains constants of sort Voters
Arc [0:1*[150]] contains constants of sort Voters
Arc [0:1*[151]] contains constants of sort Voters
Arc [0:1*[152]] contains constants of sort Voters
Arc [0:1*[153]] contains constants of sort Voters
Arc [0:1*[154]] contains constants of sort Voters
Arc [0:1*[155]] contains constants of sort Voters
Arc [0:1*[156]] contains constants of sort Voters
Arc [0:1*[157]] contains constants of sort Voters
Arc [0:1*[158]] contains constants of sort Voters
Arc [0:1*[159]] contains constants of sort Voters
Arc [0:1*[160]] contains constants of sort Voters
Arc [0:1*[161]] contains constants of sort Voters
Arc [0:1*[162]] contains constants of sort Voters
Arc [0:1*[163]] contains constants of sort Voters
Arc [0:1*[164]] contains constants of sort Voters
Arc [0:1*[165]] contains constants of sort Voters
Arc [0:1*[166]] contains constants of sort Voters
Arc [0:1*[167]] contains constants of sort Voters
Arc [0:1*[168]] contains constants of sort Voters
Arc [0:1*[169]] contains constants of sort Voters
Arc [0:1*[170]] contains constants of sort Voters
Arc [0:1*[171]] contains constants of sort Voters
Arc [0:1*[172]] contains constants of sort Voters
Arc [0:1*[173]] contains constants of sort Voters
Arc [0:1*[174]] contains constants of sort Voters
Arc [0:1*[175]] contains constants of sort Voters
Arc [0:1*[176]] contains constants of sort Voters
Arc [0:1*[177]] contains constants of sort Voters
Arc [0:1*[178]] contains constants of sort Voters
Arc [0:1*[179]] contains constants of sort Voters
Arc [0:1*[180]] contains constants of sort Voters
Arc [0:1*[181]] contains constants of sort Voters
Arc [0:1*[182]] contains constants of sort Voters
Arc [0:1*[183]] contains constants of sort Voters
Arc [0:1*[184]] contains constants of sort Voters
Arc [0:1*[185]] contains constants of sort Voters
Arc [0:1*[186]] contains constants of sort Voters
Arc [0:1*[187]] contains constants of sort Voters
Arc [0:1*[188]] contains constants of sort Voters
Arc [0:1*[189]] contains constants of sort Voters
Arc [0:1*[190]] contains constants of sort Voters
Arc [0:1*[191]] contains constants of sort Voters
Arc [0:1*[192]] contains constants of sort Voters
Arc [0:1*[193]] contains constants of sort Voters
Arc [0:1*[194]] contains constants of sort Voters
Arc [0:1*[195]] contains constants of sort Voters
Arc [0:1*[196]] contains constants of sort Voters
Arc [0:1*[197]] contains constants of sort Voters
Arc [0:1*[198]] contains constants of sort Voters
Arc [0:1*[199]] contains constants of sort Voters
Transition start : constants on arcs in [[0:1*[0]], [0:1*[1]], [0:1*[2]], [0:1*[3]], [0:1*[4]], [0:1*[5]], [0:1*[6]], [0:1*[7]], [0:1*[8]], [0:1*[9]], [0:1*[10]], [0:1*[11]], [0:1*[12]], [0:1*[13]], [0:1*[14]], [0:1*[15]], [0:1*[16]], [0:1*[17]], [0:1*[18]], [0:1*[19]], [0:1*[20]], [0:1*[21]], [0:1*[22]], [0:1*[23]], [0:1*[24]], [0:1*[25]], [0:1*[26]], [0:1*[27]], [0:1*[28]], [0:1*[29]], [0:1*[30]], [0:1*[31]], [0:1*[32]], [0:1*[33]], [0:1*[34]], [0:1*[35]], [0:1*[36]], [0:1*[37]], [0:1*[38]], [0:1*[39]], [0:1*[40]], [0:1*[41]], [0:1*[42]], [0:1*[43]], [0:1*[44]], [0:1*[45]], [0:1*[46]], [0:1*[47]], [0:1*[48]], [0:1*[49]], [0:1*[50]], [0:1*[51]], [0:1*[52]], [0:1*[53]], [0:1*[54]], [0:1*[55]], [0:1*[56]], [0:1*[57]], [0:1*[58]], [0:1*[59]], [0:1*[60]], [0:1*[61]], [0:1*[62]], [0:1*[63]], [0:1*[64]], [0:1*[65]], [0:1*[66]], [0:1*[67]], [0:1*[68]], [0:1*[69]], [0:1*[70]], [0:1*[71]], [0:1*[72]], [0:1*[73]], [0:1*[74]], [0:1*[75]], [0:1*[76]], [0:1*[77]], [0:1*[78]], [0:1*[79]], [0:1*[80]], [0:1*[81]], [0:1*[82]], [0:1*[83]], [0:1*[84]], [0:1*[85]], [0:1*[86]], [0:1*[87]], [0:1*[88]], [0:1*[89]], [0:1*[90]], [0:1*[91]], [0:1*[92]], [0:1*[93]], [0:1*[94]], [0:1*[95]], [0:1*[96]], [0:1*[97]], [0:1*[98]], [0:1*[99]], [0:1*[100]], [0:1*[101]], [0:1*[102]], [0:1*[103]], [0:1*[104]], [0:1*[105]], [0:1*[106]], [0:1*[107]], [0:1*[108]], [0:1*[109]], [0:1*[110]], [0:1*[111]], [0:1*[112]], [0:1*[113]], [0:1*[114]], [0:1*[115]], [0:1*[116]], [0:1*[117]], [0:1*[118]], [0:1*[119]], [0:1*[120]], [0:1*[121]], [0:1*[122]], [0:1*[123]], [0:1*[124]], [0:1*[125]], [0:1*[126]], [0:1*[127]], [0:1*[128]], [0:1*[129]], [0:1*[130]], [0:1*[131]], [0:1*[132]], [0:1*[133]], [0:1*[134]], [0:1*[135]], [0:1*[136]], [0:1*[137]], [0:1*[138]], [0:1*[139]], [0:1*[140]], [0:1*[141]], [0:1*[142]], [0:1*[143]], [0:1*[144]], [0:1*[145]], [0:1*[146]], [0:1*[147]], [0:1*[148]], [0:1*[149]], [0:1*[150]], [0:1*[151]], [0:1*[152]], [0:1*[153]], [0:1*[154]], [0:1*[155]], [0:1*[156]], [0:1*[157]], [0:1*[158]], [0:1*[159]], [0:1*[160]], [0:1*[161]], [0:1*[162]], [0:1*[163]], [0:1*[164]], [0:1*[165]], [0:1*[166]], [0:1*[167]], [0:1*[168]], [0:1*[169]], [0:1*[170]], [0:1*[171]], [0:1*[172]], [0:1*[173]], [0:1*[174]], [0:1*[175]], [0:1*[176]], [0:1*[177]], [0:1*[178]], [0:1*[179]], [0:1*[180]], [0:1*[181]], [0:1*[182]], [0:1*[183]], [0:1*[184]], [0:1*[185]], [0:1*[186]], [0:1*[187]], [0:1*[188]], [0:1*[189]], [0:1*[190]], [0:1*[191]], [0:1*[192]], [0:1*[193]], [0:1*[194]], [0:1*[195]], [0:1*[196]], [0:1*[197]], [0:1*[198]], [0:1*[199]]] introduces in Voters(200) partition with 1 elements that refines current partition to 1 subsets.
Symmetric sort wr.t. initial detected :Voters
Symmetric sort wr.t. initial and guards detected :Voters
Applying symmetric unfolding of full symmetric sort :Voters domain size was 200
[2022-05-20 21:46:07] [INFO ] Unfolded HLPN to a Petri net with 4 places and 3 transitions 6 arcs in 37 ms.
[2022-05-20 21:46:07] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 2 transition count 2
Applied a total of 3 rules in 8 ms. Remains 2 /4 variables (removed 2) and now considering 2/3 (removed 1) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:46:07] [INFO ] Computed 0 place invariants in 9 ms
[2022-05-20 21:46:07] [INFO ] Implicit Places using invariants in 96 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:46:07] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:46:07] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:46:07] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:46:07] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2/4 places, 2/3 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/4 places, 2/3 transitions.
Support contains 2 out of 2 places after structural reductions.
[2022-05-20 21:46:07] [INFO ] Flatten gal took : 3 ms
[2022-05-20 21:46:07] [INFO ] Flatten gal took : 2 ms
[2022-05-20 21:46:07] [INFO ] Input system was already deterministic with 2 transitions.
Incomplete random walk after 10149 steps, including 49 resets, run finished after 15 ms. (steps per millisecond=676 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10149 steps, including 49 resets, run finished after 10 ms. (steps per millisecond=1014 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:46:07] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:46:07] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA Referendum-COL-0200-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 2 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 1 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:46:08] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:46:08] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:46:08] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:46:08] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:46:08] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:46:08] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/2 places, 2/2 transitions.
Stuttering acceptance computed with spot in 332 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-COL-0200-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 495 reset in 277 ms.
Product exploration explored 100000 steps with 495 reset in 167 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 134 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-COL-0200-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-COL-0200-LTLFireability-01 finished in 1113 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(F(p0)))||p1)))'
Support contains 2 out of 2 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:46:09] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:46:09] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:46:09] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:46:09] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:46:09] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:46:09] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/2 places, 2/2 transitions.
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-COL-0200-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s0 1), p0:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 144 ms.
Product exploration explored 100000 steps with 50000 reset in 111 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 7 factoid took 159 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-COL-0200-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-COL-0200-LTLFireability-03 finished in 833 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 2 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Graph (complete) has 1 edges and 2 vertex of which 1 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Applied a total of 1 rules in 4 ms. Remains 1 /2 variables (removed 1) and now considering 1/2 (removed 1) transitions.
// Phase 1: matrix 1 rows 1 cols
[2022-05-20 21:46:09] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:46:10] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2022-05-20 21:46:10] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-20 21:46:10] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2022-05-20 21:46:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2022-05-20 21:46:10] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-20 21:46:10] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1/2 places, 1/2 transitions.
Finished structural reductions, in 1 iterations. Remains : 1/2 places, 1/2 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : Referendum-COL-0200-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA Referendum-COL-0200-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0200-LTLFireability-04 finished in 287 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((G(F(X((!p0 U !F(G(F(p1)))))))&&G(!p0)))))'
Support contains 2 out of 2 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 1 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:46:10] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:46:10] [INFO ] Implicit Places using invariants in 83 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:46:10] [INFO ] Computed 0 place invariants in 4 ms
[2022-05-20 21:46:10] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2022-05-20 21:46:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:46:10] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:46:10] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/2 places, 2/2 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR p0 p1), p1]
Running random walk in product with property : Referendum-COL-0200-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s0 1), p1:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 201 steps with 0 reset in 2 ms.
FORMULA Referendum-COL-0200-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0200-LTLFireability-05 finished in 380 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(X(p0)))&&(G((X(!p0)&&G(!p0)))||!p0))))'
Support contains 1 out of 2 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 2 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:46:10] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:46:10] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:46:10] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:46:10] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:46:10] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:46:10] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/2 places, 2/2 transitions.
Stuttering acceptance computed with spot in 196 ms :[true, true, (NOT p0), (NOT p0), true]
Running random walk in product with property : Referendum-COL-0200-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(LT s0 1)], 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA Referendum-COL-0200-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0200-LTLFireability-07 finished in 303 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(X(X(F(p0))))&&G(p1))))'
Support contains 2 out of 2 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:46:10] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-20 21:46:10] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:46:10] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:46:10] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2022-05-20 21:46:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:46:11] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:46:11] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/2 places, 2/2 transitions.
Stuttering acceptance computed with spot in 83 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Referendum-COL-0200-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LT s1 1), p0:(LT s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 495 reset in 82 ms.
Product exploration explored 100000 steps with 495 reset in 73 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1)), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 9 factoid took 453 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-COL-0200-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-COL-0200-LTLFireability-09 finished in 854 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 1 out of 2 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:46:11] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:46:11] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:46:11] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:46:11] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:46:11] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:46:11] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/2 places, 2/2 transitions.
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-COL-0200-LTLFireability-10 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:(LT s0 1)], 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 1 ms.
FORMULA Referendum-COL-0200-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0200-LTLFireability-10 finished in 251 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((!(!p0 U G(p0))&&X(p1)&&X(p0))))'
Support contains 2 out of 2 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:46:12] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:46:12] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:46:12] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:46:12] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:46:12] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:46:12] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/2 places, 2/2 transitions.
Stuttering acceptance computed with spot in 172 ms :[p0, true, true]
Running random walk in product with property : Referendum-COL-0200-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s1 1), p1:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 201 steps with 0 reset in 1 ms.
FORMULA Referendum-COL-0200-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0200-LTLFireability-11 finished in 332 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U G(F(!p0))))))'
Support contains 1 out of 2 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:46:12] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:46:12] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:46:12] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:46:12] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2022-05-20 21:46:12] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:46:12] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:46:12] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/2 places, 2/2 transitions.
Stuttering acceptance computed with spot in 134 ms :[p0, p0]
Running random walk in product with property : Referendum-COL-0200-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 201 steps with 0 reset in 0 ms.
FORMULA Referendum-COL-0200-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0200-LTLFireability-12 finished in 297 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 2 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 1 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:46:12] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:46:12] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:46:12] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:46:12] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2022-05-20 21:46:12] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:46:12] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:46:12] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/2 places, 2/2 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : Referendum-COL-0200-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 77 ms.
Product exploration explored 100000 steps with 50000 reset in 61 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 123 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-COL-0200-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-COL-0200-LTLFireability-14 finished in 506 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(!(!p0 U F(G(!F(!p0))))) U G(!p0)))'
Support contains 1 out of 2 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:46:13] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:46:13] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:46:13] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:46:13] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2022-05-20 21:46:13] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:46:13] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:46:13] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/2 places, 2/2 transitions.
Stuttering acceptance computed with spot in 57 ms :[p0]
Running random walk in product with property : Referendum-COL-0200-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 201 steps with 0 reset in 1 ms.
FORMULA Referendum-COL-0200-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0200-LTLFireability-15 finished in 178 ms.
All properties solved by simple procedures.
Total runtime 6730 ms.

BK_STOP 1653083173868

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="Referendum-COL-0200"
export BK_EXAMINATION="LTLFireability"
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 Referendum-COL-0200, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r186-tajo-165281572200372"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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