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.r078-tall-165260110600650.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 FamilyReunion-COL-L00200M0020C010P010G005, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260110600650
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 372K
-rw-r--r-- 1 mcc users 6.7K Apr 30 13:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 30 13:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 30 10:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 30 10:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 9 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 9 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 9 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_pt
-rw-r--r-- 1 mcc users 24 May 10 09:33 instance
-rw-r--r-- 1 mcc users 5 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 146K 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 FamilyReunion-COL-L00200M0020C010P010G005-CTLFireability-00
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-CTLFireability-01
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-CTLFireability-02
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-CTLFireability-03
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-CTLFireability-04
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-CTLFireability-05
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-CTLFireability-06
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-CTLFireability-07
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-CTLFireability-08
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-CTLFireability-09
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-CTLFireability-10
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-CTLFireability-11
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-CTLFireability-12
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-CTLFireability-13
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-CTLFireability-14
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1652706221310

Running Version 202205111006
[2022-05-16 13:03:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -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-16 13:03:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 13:03:42] [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-16 13:03:43] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-16 13:03:43] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 753 ms
[2022-05-16 13:03:43] [INFO ] Detected 5 constant HL places corresponding to 56 PT places.
[2022-05-16 13:03:43] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 144109 PT places and 134480.0 transition bindings in 41 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
[2022-05-16 13:03:43] [INFO ] Built PT skeleton of HLPN with 104 places and 66 transitions 198 arcs in 8 ms.
[2022-05-16 13:03:43] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Computed a total of 104 stabilizing places and 66 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 104 transition count 66
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 8 formulas.
FORMULA FamilyReunion-COL-L00200M0020C010P010G005-CTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00200M0020C010P010G005-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Remains 13 properties that can be checked using skeleton over-approximation.
Initial state reduction rules removed 1 formulas.
Reduce places removed 5 places and 0 transitions.
FORMULA FamilyReunion-COL-L00200M0020C010P010G005-CTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 99 stabilizing places and 66 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 99 transition count 66
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10102 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=146 ) properties (out of 43) seen :13
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 30) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 29) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Running SMT prover for 28 properties.
// Phase 1: matrix 66 rows 99 cols
[2022-05-16 13:03:44] [INFO ] Computed 33 place invariants in 15 ms
[2022-05-16 13:03:44] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2022-05-16 13:03:44] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 9 ms returned sat
[2022-05-16 13:03:44] [INFO ] After 193ms SMT Verify possible using state equation in real domain returned unsat :0 sat :14 real:14
[2022-05-16 13:03:44] [INFO ] After 295ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :13 real:15
Attempting to minimize the solution found.
Minimization took 66 ms.
[2022-05-16 13:03:44] [INFO ] After 776ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:28
[2022-05-16 13:03:45] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 13:03:45] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 8 ms returned sat
[2022-05-16 13:03:45] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :28
[2022-05-16 13:03:45] [INFO ] After 314ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :28
Attempting to minimize the solution found.
Minimization took 116 ms.
[2022-05-16 13:03:45] [INFO ] After 621ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :28
Fused 28 Parikh solutions to 27 different solutions.
Finished Parikh walk after 452 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=226 )
Parikh walk visited 28 properties in 195 ms.
[2022-05-16 13:03:45] [INFO ] Flatten gal took : 31 ms
[2022-05-16 13:03:45] [INFO ] Flatten gal took : 8 ms
Transition Gate2ANDJoin forces synchronizations/join behavior on parameter l of sort LegalResident
Transition ReceiveLangChoice forces synchronizations/join behavior on parameter m of sort MICSystem
Symmetric sort wr.t. initial and guards and successors and join/free detected :CINFORMI
Symmetric sort wr.t. initial detected :CINFORMI
Symmetric sort wr.t. initial and guards detected :CINFORMI
Applying symmetric unfolding of full symmetric sort :CINFORMI domain size was 11
Transition Gate1ANDJoin forces synchronizations/join behavior on parameter p of sort PublicAdminOffice
Symmetric sort wr.t. initial and guards and successors and join/free detected :GovernmentCommission
Symmetric sort wr.t. initial detected :GovernmentCommission
Symmetric sort wr.t. initial and guards detected :GovernmentCommission
Applying symmetric unfolding of full symmetric sort :GovernmentCommission domain size was 6
Symmetric sort wr.t. initial and guards and successors and join/free detected :Response
Symmetric sort wr.t. initial detected :Response
Transition SendClearanceToRel : guard parameter $r(Response:2) in guard (EQ $r 0)introduces in Response(2) partition with 2 elements
[2022-05-16 13:03:46] [INFO ] Unfolded HLPN to a Petri net with 128969 places and 110159 transitions 316597 arcs in 611 ms.
[2022-05-16 13:03:46] [INFO ] Unfolded 13 HLPN properties in 26 ms.
[2022-05-16 13:03:46] [INFO ] Reduced 4020 identical enabling conditions.
[2022-05-16 13:03:46] [INFO ] Reduced 4020 identical enabling conditions.
[2022-05-16 13:03:46] [INFO ] Reduced 2010 identical enabling conditions.
[2022-05-16 13:03:46] [INFO ] Reduced 2010 identical enabling conditions.
Deduced a syphon composed of 201 places in 361 ms
Reduce places removed 237 places and 0 transitions.
Support contains 112171 out of 128732 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128732/128732 places, 110159/110159 transitions.
Reduce places removed 649 places and 0 transitions.
Discarding 4221 places :
Implicit places reduction removed 4221 places
Iterating post reduction 0 with 4870 rules applied. Total rules applied 4870 place count 123862 transition count 110159
Applied a total of 4870 rules in 6242 ms. Remains 123862 /128732 variables (removed 4870) and now considering 110159/110159 (removed 0) transitions.
// Phase 1: matrix 110159 rows 123862 cols
[2022-05-16 13:05:55] [WARNING] Invariant computation timed out after 120 seconds.
[2022-05-16 13:06:01] [INFO ] Computed 25934 place invariants in 125896 ms
[2022-05-16 13:06:05] [INFO ] Implicit Places using invariants in 130708 ms returned []
Implicit Place search using SMT only with invariants took 130710 ms to find 0 implicit places.
// Phase 1: matrix 110159 rows 123862 cols
[2022-05-16 13:08:05] [INFO ] Computed 25934 place invariants in 119593 ms
[2022-05-16 13:08:17] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 13:08:17] [INFO ] Dead Transitions using invariants and state equation in 132061 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 123862/128732 places, 110159/110159 transitions.
Finished structural reductions, in 1 iterations. Remains : 123862/128732 places, 110159/110159 transitions.
Support contains 112171 out of 123862 places after structural reductions.
[2022-05-16 13:08:23] [INFO ] Flatten gal took : 4080 ms
[2022-05-16 13:08:34] [INFO ] Flatten gal took : 4450 ms
[2022-05-16 13:08:47] [INFO ] Input system was already deterministic with 110159 transitions.
Support contains 103528 out of 123862 places (down from 112171) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 7306 ms. (steps per millisecond=1 ) properties (out of 52) seen :24
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=12 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 864 ms. (steps per millisecond=1 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=6 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=6 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=7 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=7 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=14 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=6 ) properties (out of 28) seen :0
Running SMT prover for 28 properties.
// Phase 1: matrix 110159 rows 123862 cols
[2022-05-16 13:10:59] [WARNING] Invariant computation timed out after 120 seconds.
[2022-05-16 13:11:04] [INFO ] Computed 25934 place invariants in 125412 ms
[2022-05-16 13:11:24] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-16 13:11:24] [INFO ] After 25206ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 28 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 46645 out of 123862 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 123862/123862 places, 110159/110159 transitions.
Graph (complete) has 181905 edges and 123862 vertex of which 122253 are kept as prefixes of interest. Removing 1609 places using SCC suffix rule.156 ms
Discarding 1609 places :
Also discarding 1608 output transitions
Drop transitions removed 1608 transitions
Discarding 21507 places :
Implicit places reduction removed 21507 places
Drop transitions removed 21708 transitions
Trivial Post-agglo rules discarded 21708 transitions
Performed 21708 trivial Post agglomeration. Transition count delta: 21708
Iterating post reduction 0 with 43215 rules applied. Total rules applied 43216 place count 100746 transition count 86843
Reduce places removed 21708 places and 0 transitions.
Performed 8643 Post agglomeration using F-continuation condition.Transition count delta: 8643
Iterating post reduction 1 with 30351 rules applied. Total rules applied 73567 place count 79038 transition count 78200
Reduce places removed 8643 places and 0 transitions.
Iterating post reduction 2 with 8643 rules applied. Total rules applied 82210 place count 70395 transition count 78200
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 201 Pre rules applied. Total rules applied 82210 place count 70395 transition count 77999
Deduced a syphon composed of 201 places in 162 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 3 with 402 rules applied. Total rules applied 82612 place count 70194 transition count 77999
Performed 201 Post agglomeration using F-continuation condition.Transition count delta: 201
Deduced a syphon composed of 201 places in 100 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 3 with 402 rules applied. Total rules applied 83014 place count 69993 transition count 77798
Free-agglomeration rule (complex) applied 4221 times.
Iterating global reduction 3 with 4221 rules applied. Total rules applied 87235 place count 69993 transition count 73577
Reduce places removed 4221 places and 0 transitions.
Iterating post reduction 3 with 4221 rules applied. Total rules applied 91456 place count 65772 transition count 73577
Applied a total of 91456 rules in 62334 ms. Remains 65772 /123862 variables (removed 58090) and now considering 73577/110159 (removed 36582) transitions.
Finished structural reductions, in 1 iterations. Remains : 65772/123862 places, 73577/110159 transitions.
[2022-05-16 13:12:31] [INFO ] Flatten gal took : 3588 ms
[2022-05-16 13:12:41] [INFO ] Flatten gal took : 4309 ms
[2022-05-16 13:12:53] [INFO ] Input system was already deterministic with 110159 transitions.
Computed a total of 123862 stabilizing places and 110159 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 123862 transition count 110159
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Starting structural reductions in LTL mode, iteration 0 : 123862/123862 places, 110159/110159 transitions.
Discarding 17487 places :
Implicit places reduction removed 17487 places
Iterating post reduction 0 with 17487 rules applied. Total rules applied 17487 place count 106375 transition count 110159
Applied a total of 17487 rules in 2858 ms. Remains 106375 /123862 variables (removed 17487) and now considering 110159/110159 (removed 0) transitions.
// Phase 1: matrix 110159 rows 106375 cols
[2022-05-16 13:13:30] [INFO ] Computed 8447 place invariants in 33614 ms
[2022-05-16 13:13:39] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 13:13:39] [INFO ] Implicit Places using invariants in 42994 ms returned []
Implicit Place search using SMT only with invariants took 42996 ms to find 0 implicit places.
// Phase 1: matrix 110159 rows 106375 cols
[2022-05-16 13:14:13] [INFO ] Computed 8447 place invariants in 33933 ms
[2022-05-16 13:14:21] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 13:14:21] [INFO ] Dead Transitions using invariants and state equation in 41660 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 106375/123862 places, 110159/110159 transitions.
Finished structural reductions, in 1 iterations. Remains : 106375/123862 places, 110159/110159 transitions.
[2022-05-16 13:14:24] [INFO ] Flatten gal took : 2635 ms
[2022-05-16 13:14:27] [INFO ] Flatten gal took : 2851 ms
[2022-05-16 13:14:32] [INFO ] Input system was already deterministic with 110159 transitions.
[2022-05-16 13:14:35] [INFO ] Flatten gal took : 2645 ms
[2022-05-16 13:14:38] [INFO ] Flatten gal took : 2854 ms
[2022-05-16 13:14:38] [INFO ] Time to serialize gal into /tmp/CTLFireability3770549638069891446.gal : 390 ms
[2022-05-16 13:14:38] [INFO ] Time to serialize properties into /tmp/CTLFireability9424260915550856417.ctl : 28 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3770549638069891446.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9424260915550856417.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
Detected timeout of ITS tools.
[2022-05-16 13:15:11] [INFO ] Flatten gal took : 2734 ms
[2022-05-16 13:15:11] [INFO ] Applying decomposition
[2022-05-16 13:15:14] [INFO ] Flatten gal took : 2898 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph8701659559778208148.txt' '-o' '/tmp/graph8701659559778208148.bin' '-w' '/tmp/graph8701659559778208148.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8701659559778208148.bin' '-l' '-1' '-v' '-w' '/tmp/graph8701659559778208148.weights' '-q' '0' '-e' '0.001'
[2022-05-16 13:15:25] [INFO ] Decomposing Gal with order
[2022-05-16 13:20:14] [INFO ] Rewriting arrays to variables to allow decomposition.

BK_TIME_CONFINEMENT_REACHED

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

tar xzf /home/mcc/BenchKit/INPUTS/FamilyReunion-COL-L00200M0020C010P010G005.tgz
mv FamilyReunion-COL-L00200M0020C010P010G005 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;